Stability analysis of time-varying delay neural network for convex quadratic programming with equality constraints and inequality constraints

Abstract

<p style='text-indent:20px;'>This paper presented a class of neural networks with time-varying delays to solve quadratic programming problems. Compared with previous papers, the neural networks proposed in this paper replaced the constant time delays <inline-formula><tex-math id="M1">\begin{document}$ \tau $\end{document}</tex-math></inline-formula> with variable time delays <inline-formula><tex-math id="M2">\begin{document}$ \tau(t) $\end{document}</tex-math></inline-formula> and had a more concise structure. There was an improvement of previous method in proving the existence and uniqueness of solutions of the neural networks in this paper. Further, this paper gave the conditions to be satisfied for the global exponential stability of the proposed neural networks. Through numerical examples, this paper verified that the proposed neural networks were accurate and efficient in solving the quadratic programming problems.</p>