Abstract
A globally convergent algorithm based on the stabilized sequential quadratic programming (sSQP) method is presented in order to solve optimization problems with equality constraints and bounds. This formulation has attractive features in the sense that constraint qualifications are not needed at all. In contrast with classic globalization strategies for Newton-like methods, we do not make use of merit functions. Our scheme is based on performing corrections on the solutions of the subproblems by using an inexact restoration procedure. The presented method is well defined and any accumulation point of the generated primal sequence is either a Karush-Kuhn-Tucker point or a stationary (maybe feasible) point of the problem of minimizing the infeasibility. Also, under suitable hypotheses, the sequence generated by the algorithm converges Q-linearly. Numerical experiments are given to confirm theoretical results.
Similar content being viewed by others
References
ALGENCAN: http://www.ime.usp.br/~egbirgin/tango/
Andreani, R., Birgin, E.G., Martínez, J.M., Schuverdt, M.L.: On augmented Lagrangian methods with general lower-level constraints. SIAM J. Optim. 18(4), 1286–1309 (2007)
Andreani, R., Birgin, E.G., Martínez, J.M., Schuverdt, M.L.: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification. Math. Program., Ser. B 111(1–2), 5–32 (2008)
Bertsekas, D.P.: Multiplier methods: a survey. Automatica J. IFAC 12(2), 133–145 (1976)
Bertsekas, D.P.: Constrained optimization and lagrange multiplier methods. In: Computer Science and Applied Mathematics. Academic Press, New York (1982)
Birgin, E.G., Martínez, J.M.: Local convergence of an inexact-restoration method and numerical experiments. J. Optim. Theory Appl. 127(2), 229–247 (2005)
Birgin, E.G., Castillo, R.A., Martínez, J.M.: Numerical comparison of augmented Lagrangian algorithms for nonconvex problems. Comput. Optim. Appl. 31(1), 31–55 (2005)
Birgin, E.G., Floudas, C.A., Martínez, J.M.: Global minimization using an augmented Lagrangian method with variable lower-level constraints. Math. Program., Ser. A 125(1), 139–162 (2010)
Birgin, E.G., Fernández, D., Martínez, J.M.: The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems. Optim. Methods Softw. doi:10.1080/10556788.2011.556634
Conn, A.R., Gould, N.I.M., Toint, P.L.: A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds. SIAM J. Numer. Anal. 28(2), 545–572 (1991)
Conn, A.R., Gould, N.I.M., Toint, P.L.: LANCELOT: a Fortran Package for Large-scale Nonlinear Optimization (Release A). In: Springer Series in Computational Mathematics, vol. 17. Springer, Berlin (1992)
Conn, A.R., Gould, N., Sartenaer, A., Toint, P.L.: Convergence properties of an augmented Lagrangian algorithm for optimization with a combination of general equality and linear constraints. SIAM J. Optim. 6(3), 674–703 (1996)
Contesse-Becker, L.: Extended convergence results for the method of multipliers for non-strictly binding inequality constraints. J. Optim. Theory Appl. 79(2), 273–310 (1993)
Fernández, D.: A quasi-newton strategy for the sSQP method for variational inequality and optimization problems. Math. Program., Ser. A. doi:10.1007/s10107-011-0493-8
Fernández, D., Solodov, M.: Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems. Math. Program., Ser. A 125(1), 47–73 (2010)
Fischer, A.: Local behavior of an iterative framework for generalized equations with nonisolated solutions. Math. Program., Ser. A 94(1), 91–124 (2002)
Fischer, A., Friedlander, A.: A new line search inexact restoration approach for nonlinear programming. Comput. Optim. Appl. 46(2), 333–346 (2010)
Goldfarb, D., Idnani, A.: A numerically stable dual method for solving strictly convex quadratic programs. Math. Program. 27(1), 1–33 (1983)
Hager, W.W.: Stabilized sequential quadratic programming. Comput. Optim. Appl. 12(1–3), 253–273 (1999)
Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4, 303–320 (1969)
Izmailov, A., Solodov, M.: Stabilized SQP revisited. Math. Program., Ser. A. doi:10.1007/s10107-010-0413-3
LANCELOT: http://www.cse.scitech.ac.uk/nag/lancelot/lancelot.shtml
Luo, H.Z., Sun, X.L., Li, D.: On the convergence of augmented Lagrangian methods for constrained global optimization. SIAM J. Optim. 18(4), 1209–1230 (2007)
Martínez, J.M.: Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. J. Optim. Theory Appl. 111(1), 39–58 (2001)
Martínez, J.M., Pilotta, E.A.: Inexact-restoration algorithm for constrained optimization. J. Optim. Theory Appl. 104(1), 135–163 (2000)
Martínez, J.M., Pilotta, E.A.: Inexact restoration methods for nonlinear programming: advances and perspectives. In: Optimization and Control with Applications. Appl. Optim., vol. 96, pp. 271–291. Springer, New York (2005)
Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research. Springer, New York (1999)
Pennanen, T.: Local convergence of the proximal point algorithm and multiplier methods without monotonicity. Math. Oper. Res. 27(1), 170–191 (2002)
Polyak, V.T., Tret’yakov, N.V.: The method of penalty estimates for conditional extremum problems. USSR Comput. Math. Math. Phys. 13(1), 42–58 (1974)
Powell, M.J.D.: A method for nonlinear constraints in minimization problems. In: Optimization, Sympos., Univ. Keele, Keele, 1968, pp. 283–298. Academic Press, London (1969)
Wright, S.J.: Superlinear convergence of a stabilized SQP method to a degenerate solution. Comput. Optim. Appl. 11(3), 253–275 (1998)
Wright, S.J.: Modifying SQP for degenerate problems. SIAM J. Optim. 13(2), 470–497 (2002) (electronic)
Wright, S.J.: Constraint identification and algorithm stabilization for degenerate nonlinear programs. Math. Program., Ser. B 95(1), 137–160 (2003). ISMP 2000, Part 3 (Atlanta, GA)
Acknowledgements
The authors are thankful to the anonymous referees for the careful reading of the manuscript, helpful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was carried out with the aid of grants from ANPCyT, CONICET and SECyT-UNC.
Rights and permissions
About this article
Cite this article
Fernández, D., Pilotta, E.A. & Torres, G.A. An inexact restoration strategy for the globalization of the sSQP method. Comput Optim Appl 54, 595–617 (2013). https://doi.org/10.1007/s10589-012-9502-y
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-012-9502-y