CASIA OpenIR  > 类脑智能研究中心
An Improved Recurrent Network for Online Equality-Constrained Quadratic Programming
Ke Chen; Zhaoxiang Zhang
Conference NameThe eighth International Conference on Brain Inspired Cognitive Systems
Source PublicationBICS 2016
Conference Date28-30 November 2016
Conference PlaceBeijing, China
AbstractEncouraged by the success of conventional GradientNet and recently-proposed ZhangNet for online equality-constrained quadratic programming problem, an improved recurrent network and its electronic implementation are firstly proposed and developed in this paper. Exploited in the primal form of quadratic programming with linear equality constraints, the proposed neural model can solve the problem effectively. Moreover, compared to the existing recurrent networks, i.e., GradientNet (GN) and ZhangNet (ZN), our model can theoretically guarantee superior global exponential convergence performance. Robustness performance of our such neural model is also analysed under a large model implementation error, with the upper bound of stead-state solution error estimated. Simulation results demonstrate theoretical analysis on the proposed model for online equality-constrained quadratic programming.
KeywordRecurrent Networks Online Equality-constrained Quadratic Programming Global Exponential Convergence Robustness Analysis
Document Type会议论文
Corresponding AuthorZhaoxiang Zhang
Recommended Citation
GB/T 7714
Ke Chen,Zhaoxiang Zhang. An Improved Recurrent Network for Online Equality-Constrained Quadratic Programming[C],2016.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Ke Chen]'s Articles
[Zhaoxiang Zhang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Ke Chen]'s Articles
[Zhaoxiang Zhang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Ke Chen]'s Articles
[Zhaoxiang Zhang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.