在这份报纸,为非线性的抑制优化问题的新 SQP 可行降下算法介绍了,并且在亲戚的更弱的条件下面,我们仍然校对了新方法拥有全球集中和它数字结果说明的强壮的 convergence.The 新方法是有效的。
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 numerical results illustrate that the new methods are valid.