Improved local convergence results for augmented Lagrangian methods in \({\varvec{C}}^\mathbf{2}\)-cone reducible constrained optimization

  • Christian Kanzow
  • Daniel Steck
Short Communication Series A


This paper deals with a class of cone-reducible constrained optimization problems which encompasses nonlinear programming, semidefinite programming, second-order cone programming, and any combination thereof. Using the second-order sufficient condition and a strict version of the Robinson constraint qualification, we provide a (semi-)local error bound which generalizes known results from the literature. Moreover, under the same assumptions, we prove that an augmented Lagrangian method is locally convergent with rate proportional to \(1/\rho _k\), where \(\rho _k\) is the penalty parameter, and that \(\{\rho _k\}\) remains bounded.


Augmented Lagrangian method Local convergence Rate of convergence \(C^2\)-cone reducible sets Error bound Semidefinite programming Second-order cone programming 

Mathematics Subject Classification

65K05 90C22 90C30 90C31 


  1. 1.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2011)CrossRefzbMATHGoogle Scholar
  3. 3.
    Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, New York (1982)zbMATHGoogle Scholar
  4. 4.
    Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1995)zbMATHGoogle Scholar
  5. 5.
    Birgin, E.G., Floudas, C.A., Martínez, J.M.: Global minimization using an augmented Lagrangian method with variable lower-level constraints. Math. Program. 125(1, Ser. A), 139–162 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Birgin, E.G., Martínez, J.M.: Practical Augmented Lagrangian Methods for Constrained Optimization. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2014)CrossRefzbMATHGoogle Scholar
  7. 7.
    Bonnans, J.F.: Ramírez C, H.: Perturbation analysis of second-order cone programming problems. Math. Program. 104(2–3, Ser. B), 205–227 (2005)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer Series in Operations Research. Springer, New York (2000)CrossRefzbMATHGoogle Scholar
  9. 9.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-region methods. MPS/SIAM Series on Optimization. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA; Mathematical Programming Society (MPS), Philadelphia, PA (2000)Google Scholar
  11. 11.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Ding, C., Sun, D., Zhang, L.: Characterization of the robust isolated calmness for a class of conic programming problems. SIAM J. Optim. 27(1), 67–90 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Fernández, D., Solodov, M.V.: Local convergence of exact and inexact augmented Lagrangian methods under the second-order sufficient optimality condition. SIAM J. Optim. 22(2), 384–407 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Ito, K., Kunisch, K.: The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces. Math. Program. 46(3, Ser. A), 341–360 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Kanzow, C., Steck, D.: On error bounds and multiplier methods for variational problems in Banach spaces. Technical Report, Institute of Mathematics, University of Würzburg (2017)Google Scholar
  16. 16.
    Kanzow, C., Steck, D., Wachsmuth, D.: An augmented Lagrangian method for optimization problems in Banach spaces. SIAM J. Control Optim. 56(1), 272–291 (2018)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Kočvara, M., Stingl, M.: PENNON: a code for convex nonlinear and semidefinite programming. Optim. Methods Softw. 18(3), 317–333 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Kočvara, M., Stingl, M.: PENNON: a generalized augmented Lagrangian method for semidefinite programming. In: High performance algorithms and software for nonlinear optimization (Erice, 2001), vol. 82, Appl. Optim., pp. 303–321. Kluwer Acad. Publ., Norwell, MA (2003)Google Scholar
  19. 19.
    Liu, Y.-J., Zhang, L.-W.: Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems. Nonlinear Anal. 67(5), 1359–1373 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Liu, Y.J., Zhang, L.W.: Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones. J. Optim. Theory Appl. 139(3), 557–575 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Mordukhovich, B.S.: Variational analysis and generalized differentiation. I, volume 330 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer, Berlin (2006). Basic theoryGoogle Scholar
  22. 22.
    Nocedal, J., Wright, S.J.: Numerical Optimization, second edn. Springer, New York (2006)zbMATHGoogle Scholar
  23. 23.
    Pang, J.-S., Fukushima, M.: Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games. Comput. Manag. Sci. 2(1), 21–56 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Robinson, S.M.: Stability theory for systems of inequalities. II. Differentiable nonlinear systems. SIAM J. Numer. Anal. 13(4), 497–513 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Shapiro, A.: On uniqueness of Lagrange multipliers in optimization problems subject to cone constraints. SIAM J. Optim. 7(2), 508–518 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    Shapiro, A.: Sensitivity analysis of generalized equations. J. Math. Sci. 115(4), 2554–2565 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Sun, D., Sun, J., Zhang, L.: The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming. Math. Program. 114(2, Ser. A), 349–391 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    Wachsmuth, G.: On LICQ and the uniqueness of Lagrange multipliers. Oper. Res. Lett. 41(1), 78–80 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    Zhang, Y., Zhang, L.: On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization. Oper. Res. Lett. 44(4), 474–478 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  30. 30.
    Zhang, Y., Zhang, L., Wu, J., Wang, K.: Characterizations of local upper Lipschitz property of perturbed solutions to nonlinear second-order cone programs. Optimization 66(7), 1079–1103 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  31. 31.
    Zhao, X.-Y., Sun, D., Toh, K.-C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737–1765 (2010)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society 2018

Authors and Affiliations

  1. 1.Institute of MathematicsUniversity of Würzburg, Campus Hubland NordWürzburgGermany

Personalised recommendations