期刊文献+

基于投影神经网络求解凸规划问题的二分法

A Bisection Method for Convex Programming Based on the Projection Neural Network
下载PDF
导出
摘要 将投影梯度神经网络方法和二分法相结合,提出了一种求解凸规划的新算法,并证明了该算法的收敛性. In this paper, a new algorithm for convex programming is proposed by combining projection neural network with bisection method. The convergence of the algorithm is proved.
出处 《海南师范大学学报(自然科学版)》 CAS 2014年第1期15-17,62,共4页 Journal of Hainan Normal University(Natural Science)
关键词 凸规划 二分法 神经网络 convex programming bisection method neural network
  • 相关文献

参考文献6

  • 1Tank D W, Hopfield J J. Simple 'neural' optimization net- work: an A/D converter, signal decision circuit and a lin- ear programming circuit[ J ]. IEEE Trans Circuits Syst, 1986,33:533-541.
  • 2Kennedy M P, Chua L O. Neural networks for nonlinear programming[J ]. IEEE Trans Circuits Syst,1988,35:554- 562.
  • 3Zhang S, Constantinides A. Lagrange programming neural networks[ J ]. IEEE Transaction on Circuits and Sys- tems-II:Analog and Digital Signal Processing,1992,39(7): 441-452.
  • 4Liang X, Wang J. A recurrent neural network for nonlin-ear optimization with a continuously differentiable objec- tive functions and bound constraints[ J ]. IEEE Transac- tions on Neural Networks, 2000,11 (6): 1251-1262.
  • 5Gao X. A novel neural network for nonlinear convex pro- gramming[ J ]. IEEE Transactions on Neural Networks, 2004,15:613-621.
  • 6Yang Y, Cao J. A feedback neural network for solving con- vex constraint optimization problems[J ]. Appl Math Com- put,2008,201:340-350.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部