Stability Analysis of Time-varying Delay Neural Network for Convex Quadratic Programming With Equality Constraints and Inequality Constraints

Abstract

In this paper, a kind of neural network with time-varying delays is proposed to solve the problems of quadratic programming. The delay term of the neural network changes with time t. The number of neurons in the neural network is n + h, so the structure is more concise. The equilibrium point of the neural network is consistent with the optimal solution of the original optimization problem. The existence and uniqueness of the equilibrium point of the neural network are proved. Application inequality technique proved global exponential stability of the network. Some numerical examples are given to show that the proposed neural network model has good performance for solving optimization problems.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…