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 i...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.展开更多
This paper presents an augmented Lagrangian algorithm for nonlinear opti- mization of equality and bounded constraints. The method includes internal it- erations and outer iterations, which uses a trust region interio...This paper presents an augmented Lagrangian algorithm for nonlinear opti- mization of equality and bounded constraints. The method includes internal it- erations and outer iterations, which uses a trust region interior-point method in internal iteration. Under some conditions, the paper proves finite termination of internal iteration and analyses the local convergence of accelerating internal mini- mizer iterations. It also proves the global convergence of main algorithm when the approximate solution of internal minimizer is satisfied some conditions.展开更多
基金Supported by the NNSF of China(10231060)Supported by the Soft Science Foundation of Henan Province(082400430820)
文摘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.
文摘This paper presents an augmented Lagrangian algorithm for nonlinear opti- mization of equality and bounded constraints. The method includes internal it- erations and outer iterations, which uses a trust region interior-point method in internal iteration. Under some conditions, the paper proves finite termination of internal iteration and analyses the local convergence of accelerating internal mini- mizer iterations. It also proves the global convergence of main algorithm when the approximate solution of internal minimizer is satisfied some conditions.