A Globally and Superlinearly Convergent SQP Algorithm for Nonlinear Constrained Optimization

Journal of Global Optimization

Volumn 21, Issue 2, 2001, Pages 157-184

  Qi, Liqun ^a   Yang, Y U Fei ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b HUNAN UNIVERSITY   (China)

Author keywords

Constrained optimization; Exact penalty function; Global convergence; SQP method; Superlinear convergence

Indexed keywords

EID: 0035473196     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011983130559     Document Type: Article

References (18)

1. Boggs, P.T. and Tolle, J.W. (1995), Sequential quadratic programming, Acta Numerica, Cambridge University Press, 1995, pp. 1-51.
2. Burke, J.V. (1989), A sequential quadratic programming algorithm for potentially infeasible mathematical programs, Journal of Mathematical Analysis and Applications 139: 319-351.
3. Burke, J.V. and Han, S.P. (1989), A robust sequential quadratic programming method, Mathematical Programming 43: 277-303.
4. Byrd, R.H., Tapia, R.A. and Zhang, Y. (1992), An SQP augmented Lagrangian BFGS algorithm for constrained optimization, SIAM Journal on Optimization 2: 210-241.
5. 1-functions and the Maratos effect, Operations Research Letters 17: 131-137.
6. Facchinei, F. (1997), Robust recursive quadratic programming algorithm model with global and superlinear convergence properties, Journal of Optimization Theory and Applications 92: 543-579.
7. Glad, T. and Polak, E. (1979), A multiplier method with automatic limitation of penalty growth, Mathematical Programming 17: 140-155.
8. Hock, W. and Schittkowski, K. (1981), Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems 187, Springer-Verlag, Berlin, New York.
9. Gill, P.E. and Murray, W. (1978), Numerically stable methods for quadratic programming, Mathematical Programming 14: 349-372.
10. Lucidi, S. (1992), New results on a continuously differentiable penalty function, SIAM Journal on Optimization 2: 558-574.
11. Moré, J.J. and Sorensen, D.C. (1983), Computing a trust region step, SIAM Journal on Scientific and Statistical Computing 4: 553-572.
12. Panier, E.R. and Tits, A.L. (1987), A superlinearly convergent feasible method for the solution of inequality constrained optimization problems, SIAM Journal on Control and Optimization 25: 934-950.
13. Pantoja, J.F.A. and Mayne, D.Q. (1991), Exact penalty function algorithm with simple updating of the penalty parameter, Journal of Optimization Theory and Applications 69: 441-467.
14. Powell, M.J.D. (1978), A fast algorithm for nonlinearly constrained optimization calculations, in Numerical analysis, Proceedings, Biennial Conference, Dundee 1977, Lecture Notes in Math. 630, Springer-Verlag, Berlin, New York, pp. 144-157.
15. Qi, L. and Sun, J. (1993), A nonsmooth version of Newton's method, Mathematical Programming 58: 353-367.
16. Robinson, S.M. (1980), Strongly regular generalized equations, Mathematics of Operations Research 5: 43-62.
17. Spellucci, P. (1998), A new technique for inconsistent QP problems in the SQP methods, Mathematical Methods of Operations Research 47: 355-400.
18. Tone, K. (1983), Revision of constraint approximations in the successive QP-method for nonlinear programming problems, Mathematical Programming 26: 144-152.