TY - GEN
T1 - A recurrent neural network for non-smooth convex programming subject to linear equality and bound constraints
AU - Liu, Qingshan
AU - Wang, Jun
PY - 2006
Y1 - 2006
N2 - In this paper, a recurrent neural network model is proposed for solving non-smooth convex programming problems, which is a natural extension of the previous neural networks. By using the non-smooth analysis and the theory of differential inclusions, the global convergence of the equilibrium is analyzed and proved. One simulation example shows the convergence of the presented neural network. © Springer-Verlag Berlin Heidelberg 2006.
AB - In this paper, a recurrent neural network model is proposed for solving non-smooth convex programming problems, which is a natural extension of the previous neural networks. By using the non-smooth analysis and the theory of differential inclusions, the global convergence of the equilibrium is analyzed and proved. One simulation example shows the convergence of the presented neural network. © Springer-Verlag Berlin Heidelberg 2006.
UR - https://www.scopus.com/pages/publications/33750705261
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-33750705261&origin=recordpage
U2 - 10.1007/11893257_110
DO - 10.1007/11893257_110
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9783540464815
T3 - Lecture Notes in Computer Science
SP - 1004
EP - 1013
BT - Neural Information Processing
A2 - King, Irwin
A2 - Wang, Jun
A2 - Chan, Lai-Wan
PB - Springer
CY - Berlin, Heidelberg
T2 - 13th International Conference on Neural Information Processing (ICONIP 2006)
Y2 - 3 October 2006 through 6 October 2006
ER -