A Recurrent Neural Network for Solving Convex Quadratic Program

Caihong Shan, Huaiqin Wu

Abstract


In this paper, we present a recurrent neural network for solving convex quadratic programming problems, in the theoretical aspect, we prove that the proposed neural network can converge globally to the solution set of the problem when the matrix involved in the problem is positive semi-definite and can converge exponentially to a unique solution when the matrix is positive definite. Illustrative examples further show the good performance of the proposed neural network.


Full Text: PDF

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Modern Applied Science   ISSN 1913-1844 (Print)   ISSN 1913-1852 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.