By Topic

On the recurrent neural networks for solving general quadratic programming problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Mladenov, V. ; Dept. Theor. of Electr. Eng., Tech. Univ. of Sofia, Bulgaria

Quadratic programming problems are a widespread class of nonlinear programming problems with many practical applications. The case of inequality constraints have been considered in a previous author's paper. In this contribution, an extension of these results for the case of inequality and equality constraints is presented. Based on an equivalent formulation of the Kuhn-Tucker conditions, a new neural network for solving general quadratic programming problems, for the case of both inequality and equality constraints, is proposed. Two theorems for global stability and convergence of this network are given as well. The presented network has lower complexity for implementations and the examples confirm its effectiveness. Simulation results based on SIMULINK® models are given and compared.

Published in:

Neural Network Applications in Electrical Engineering, 2004. NEUREL 2004. 2004 7th Seminar on

Date of Conference:

23-25 Sept. 2004