摘要: In this paper, the new SQP feasible descent algorithm for nonlinear constrained optimization problems presented, and under weaker conditions of relative, we proofed the new method still possesses global convergence and its strong convergence. The
中图分类号:
张和平, 叶留青. 不等式约束最优化问题的可行SQP下降算法及其收敛性[J]. 数学季刊, 2009, 24(3): 469-474.
ZHANG He-ping, YE Liu-qing. Feasible SQP Descent Method for Inequality Constrained Optimization Problems and Its Convergence [J]. Chinese Quarterly Journal of Mathematics, 2009, 24(3): 469-474.