A Delayed Neural Network Method for Solving Convex Optimization Problems
A Delayed Neural Network Method for Solving Convex Optimization Problems
复制标题
DOI：
10.1142/s012906570600069x
复制
发表时间：
2006-08
影响因子：
8
通讯作者：
Yongqing Yang;Jinde Cao
中科院分区：
文献类型：
--
作者：
Yongqing Yang;Jinde Cao
本文提出了一类求解凸规划问题的延迟投影神经网络。证明了该网络解的存在性和全局指数稳定性，保证收敛于凸规划问题的精确最优解。最后给出了几个算例，说明了该网络的有效性。
In this paper, the delayed projection neural network for a class of solving convex programming problem is proposed. The existence of solution and global exponential stability of the proposed network are proved, which can guarantee to converge at an exact optimal solution of the convex programming problems. Several examples are given to show the effectiveness of the proposed network.