Abstract
In this paper, a modified SQP method with nonmonotone line search technique is presented based on the modified quadratic subproblem proposed in Zhou (1997) and the nonmonotone line search technique. This algorithm starts from an arbitrary initial point, adjusts penalty parameter automatically and can overcome the Maratos effect. What is more, the subproblem is feasible at each iterate point. The global and local superlinear convergence properties are obtained under certain conditions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bazaraa, M.S. and Goode, J.J. (1982), An algorithm for solving linearly constraint minimax problem, European Journal of Operational Research 11: 158-166.
Burke, J.V. and Han, S.P. (1989), A robust SQP methods, Mathematical Programming 43: 277-303.
Boggs, P.T., Tolle, J.W. and Wang, P. (1982), On the local convergence of quasinewton methods for constrained optimization, SIAM J. on Control and Optimization 20: 161-171.
Bonnans, J.F. and Launay, G. (1995), Sequential quadratic programming with penalization of displacement, SIAM J. Optimization 54: 792-812.
Bonnons, J.F., Panier, E.R., Titts, A.L. and Zhou. J.L. (1992), Avoiding the Maratos effect by means of nonmonotone linesearch, Inequality constrained problems-feasible iterates, SIAM J. Numerical Analysis 29: 1187-1202.
Chamberlin, R.M., Powell, M.J.D., Lemarechal, C. and Pedersen, H.C. (1982), The watchdog technique for forcing convergence in algorithms for constrained optimization, Mathematical Programming Study 16: 1-7.
De Q. 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 Application 69: 441-467.
Grippo, L., Lampariellp, F. and Lucidi, S. (1986), A nonmonotone line search technique for Newton's method, SIAM J. Numerical Analysis 23: 707-716.
Han, S.P. (1976), Superlinearly convergent variable metric algorithm for general nonlinear programming problems, Mathematical Programming 11: 263-282.
Han, S.P. (1977), A global convergence method for nonlinear programming, Journal of Optimization Theory and Application 22: 217-309.
Han, S.P. and Mangasarian, O.L. (1976), Exact penalty function in nonlinear programming, Mathematical Programming 17: 251-269.
Maratos, N. (1978), Exact penalty function algorithm for finite dimensional and control optimization problems, Ph.D. Thesis, University of London, UK.
Mayne, D.Q. and Polack, E. (1982), A superlinealy convergent algorithm for constrained optimization problems, Mathematical Programming Study 16: 45-61.
Panier, E.R. and Titts, A.L. (1991), Avoiding the Maratos effect by means of a nonmonotone line search I. General constrained problems, SIAM J. Numerical Analysis 28: 1183-1195.
Powell, M.J.D. (1978), A fast algorithms for nonlinearly constrained optimization calculations, in Watson, G.A. (ed.), Numerical Analysis, Springer-Verlag, Berlin, 144-157.
Powell, M.J.D. (1982), Variable metric methods for constrained optimization, in Bächen et al. (eds.), Mathematical programming-The state of art, Springer-Verlag, Berlin.
Robison, S.M. (1982), Generalized equations and their applications, Part II: application to nonlinear programming, Mathematical Programming Study 19: 200-221.
Xue, G.L. (1991), Algorithms and their convergent properties for solving a class linearly constraint minimax problems, Comn. on Appl. Math. and Comput. 5: 11-18.
Zhou, G.L. (1997), A modified SQP method and its global convergence, J. Global Optimization 11: 193-205.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhang, JL., Zhang, XS. A Modified SQP Method with Nonmonotone Linesearch Technique. Journal of Global Optimization 21, 201–218 (2001). https://doi.org/10.1023/A:1011942228555
Issue Date:
DOI: https://doi.org/10.1023/A:1011942228555