摘要
将投影梯度神经网络方法和二分法相结合,提出了一种求解凸规划的新算法,并证明了该算法的收敛性.
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