Skip to main content
Log in

A second-order convergence augmented Lagrangian method using non-quadratic penalty functions

  • Theoretical Article
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

The purpose of the present paper is to study the global convergence of a practical Augmented Lagrangian model algorithm that considers non-quadratic Penalty–Lagrangian functions. We analyze the convergence of the model algorithm to points that satisfy the Karush–Kuhn–Tucker conditions and also the weak second-order necessary optimality condition. The generation scheme of the Penalty–Lagrangian functions includes the exponential penalty function and the logarithmic-barrier without using convex information.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abadie, J.: On the Kuhn–Tucker theorem. In: Abadie, J. (ed.) Nonlinear Programming, pp. 19–36. North Holland, Amsterdam (1967)

    Google Scholar 

  2. 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)

    Article  Google Scholar 

  3. Andreani, R., Birgin, E., Martínez, J.M., Schuverdt, M.L.: Second-order negative-curvature methods for box-constrained and general constrained optimization. Comput. Optim. Appl. 45, 209–236 (2010)

    Article  Google Scholar 

  4. Andreani, R., Echagüe, C.E., Schuverdt, M.L.: Constant-rank condition and second-order constraint qualification. J. Optim. Theory. Appl 146, 155–266 (2009)

    Google Scholar 

  5. Andreani, R., Haeser, G., Schuverdt, M.L., Silva, P.J.S.: Two new weak constraint qualifications and applications. SIAM J. Optim. 22(3), 1109–1135 (2012)

    Article  Google Scholar 

  6. Andreani, R., Haeser, G., Ramos, A., Silva, P.J.S.: A second-order sequential optimality condition associated to the convergence of optimization algorithms. IMA J. Numer. Anal. 37(4), 1902–1929 (2017)

    Article  Google Scholar 

  7. Andreani, R., Martínez, J.M., Ramos, A., Silva, P.J.S.: A cone-continuity constraint qualification and algorithmic consequences. SIAM J. Optim. 26(1), 96–110 (2016)

    Article  Google Scholar 

  8. Andreani, R., Martínez, J.M., Schuverdt, M.L.: On second-order optimality conditions for Nonlinear Programming. Optimization 56, 529–542 (2007)

    Article  Google Scholar 

  9. Ben-Tal, A., Zibulevsky, M.: Penalty/barrier multiplier methods for convex programming problems. SIAM J. Optim. 7, 347–366 (1997)

    Article  Google Scholar 

  10. Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, Inc., New York (1982)

    Google Scholar 

  11. Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)

    Google Scholar 

  12. Birgin, E.G., Castillo, R.A., Martínez, J.M.: Numerical comparison of augmented Lagrangian algorithms for non-convex problems. Comput. Optim. Appl. 31(1), 31–55 (2005)

    Article  Google Scholar 

  13. Birgin, E.G., Fernández, D., Martínez, J.M.: The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems. Optim. Method Softw. 27(6), 1001–1024 (2012)

    Article  Google Scholar 

  14. Dussault, J.P.: Augmented non-quadratic penalty algorithms. Math. Program. 99, 467–486 (2004)

    Article  Google Scholar 

  15. Echebest, N., Sánchez, M.D., Schuverdt, M.L.: Convergence results of an augmented Lagrangian method using the exponential penalty function. J. Optim. Theory. Appl 168, 92–108 (2016)

    Article  Google Scholar 

  16. Haeser, G., Schuverdt, M.L.: On approximate KKT condition and its extension to continuous variational inequalities. J. Optim. Theory. Appl 23, 707–716 (2011)

    Google Scholar 

  17. Hestenes, M.R.: Optimization Theory: The Finite Dimensional Case. John Wiley, New York (1975)

    Google Scholar 

  18. Kočvara, M., Stingl, M.: PENNON: a code for convex nonlinear and semidefinite programming. Optim. Methods Softw. 18(3), 317–333 (2003)

    Article  Google Scholar 

  19. Martínez, J.M., Birgin, E.G.: Practical augmented Lagrangian methods for constrained optimization. SIAM Publications, Philadelphia (2014)

    Google Scholar 

  20. Minchenko, L., Stakhovski, S.: On relaxed constant rank regularity condition in mathematical programming. Optimization 60(4), 429–440 (2011)

    Article  Google Scholar 

  21. Mosheyer, L., Zibulevsky, M.: Penalty/barrier multiplier algorithm for semidefinite programming. Optim. Methods Softw. 13(4), 235–261 (2000)

    Article  Google Scholar 

  22. Tseng, P., Bertsekas, D.P.: On the convergence of the exponential multiplier method for convex programming. Math. Program. 60, 1–19 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. L. Schuverdt.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sánchez, M.D., Schuverdt, M.L. A second-order convergence augmented Lagrangian method using non-quadratic penalty functions. OPSEARCH 56, 390–408 (2019). https://doi.org/10.1007/s12597-019-00366-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-019-00366-3

Keywords

Navigation