摘要
本文将超记忆梯度法推广到求解带有线性约束的非线性规划问题中去,给出了一个新的算法,在适当的条件下,证明了算法的全局收敛性。
In this paper, We extend the supermemory gradient method to solve nonlinear programming With linear constraints. We propose a new algorithm and prove its global convergence under suitable conditions.
出处
《山东矿业学院学报》
CAS
1990年第3期279-285,共7页
Journal of Shandong University of Science and Technology(Natural Science)
关键词
非线性规划
超记忆
梯度
投影法
non-linear programming
constraint conditions
gradient project algorithm
convergence
algorithm.
