摘要
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.
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.
基金
Supported by the NNSF of China(10231060)
Supported by the Soft Science Foundation of Henan Province(082400430820)
