Convergence of a stabilized SQP method for equality constrained optimization
- 37 Downloads
We herein present a stabilized sequential programming method for equality constrained programming. The proposed method uses the concepts of proximal point methods and primal-dual regularization. A sequence of regularized problems are approximately solved with the regularization parameter approaching zero. At each iteration, a regularized QP subproblem is solved to obtain a primal-dual search direction. Further, a trust-funnel-like line search scheme is used to globalize the algorithm, and a global convergence under the weak assumption of cone-continuity property is shown. To achieve a fast local convergence, a specially designed second-order correction (SOC) technique is adopted near a solution. Under the second-order sufficient condition and some weak conditions (among which no constraint qualification is involved), the regularized QP subproblem transits to a stabilized QP subproblem in the limit. By possibly combining with the SOC step, the full step will be accepted in the limit and hence the superlinearly local convergence is achieved. Preliminary numerical results are reported, which are encouraging.
KeywordsEquality constrained optimization Stabilized sequential quadratic programming Trust-funnel-like method Global convergence Local convergence
Mathematics Subject Classification90C30 90C55 65K05
The authors would like to thank the two anonymous referees for their useful comments that helped to improve the original version of the manuscript.
- 16.Gill, P.E., Wong, E.: Sequential quadratic programming methods. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, pp. 147–224. Springer, New York, NY (2012)Google Scholar
- 21.Izmailov, A.F., Krylova, A., Uskov, E.I.: Hybrid globalization of stabilized sequential quadratic programming method. In: Bereznyov, V. (ed.) Theoretical and Applied Problems of Nonlinear Analysis, pp. 47–66. Computing Center RAS, Moscow (2011). (in Russian)Google Scholar
- 26.Maratos, N.: Exact penalty function algorithms for finite dimensional and control optimization problems. Ph.D. thesis, University of London (1978)Google Scholar
- 27.Martíne, J.M., Pilotta, E.A.: Inexact restoration methods for nonlinear programming: advances and perspectives. In: Qi, L., Teo, K., Yang, X. (eds.) Optimization and Control with Applications, Applied Optimization, vol. 96, pp. 271–291. Springer, New York (2005)Google Scholar