A Recurrent Neural Network for Solving Convex Quadratic Program

Caihong Shan and Huaiqin Wu

Modern Applied Science, 2008, vol. 2, issue 2, 29

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.

Date: 2008
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ccsenet.org/journal/index.php/mas/article/download/2653/2453 (application/pdf)
https://ccsenet.org/journal/index.php/mas/article/view/2653 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:masjnl:v:2:y:2008:i:2:p:29

Access Statistics for this article

More articles in Modern Applied Science from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().