A novel neural network for solving convex quadratic programming problems subject to equality and inequality constraints

This paper proposes a neural network model for solving convex quadratic programming (CQP) problems, whose equilibrium points coincide with Karush–Kuhn–Tucker (KKT) points of the CQP problem. Using the equality transformation and Fischer–Burmeister (FB) function, we construct the neural network model...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Neurocomputing (Amsterdam) Ročník 214; s. 23 - 31
Hlavní autoři:	Huang, Xinjian, Lou, Xuyang, Cui, Baotong
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 19.11.2016
Témata:	Convex quadratic programming Fischer-Burmeister function Neural network Stability Convex quadratic programming Fischer-Burmeister function Stability Neural network
ISSN:	0925-2312, 1872-8286
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	This paper proposes a neural network model for solving convex quadratic programming (CQP) problems, whose equilibrium points coincide with Karush–Kuhn–Tucker (KKT) points of the CQP problem. Using the equality transformation and Fischer–Burmeister (FB) function, we construct the neural network model and present the KKT condition for the CQP problem. In contrast to two existing neural networks for solving such problems, the proposed neural network has fewer variables and neurons, which makes circuit realization easier. Moreover, the proposed neural network is asymptotically stable in the sense of Lyapunov such that it converges to an exact optimal solution of the CQP problem. Simulation results are provided to show the feasibility and efficiency of the proposed network.
ISSN:	0925-2312 1872-8286
DOI:	10.1016/j.neucom.2016.05.032