Abstract
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/spl reg/ models are given and compared.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
