Skip to main content
SpringerLink
Log in

On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Jordan Algebras are an important tool for dealing with semidefinite programming and optimization over symmetric cones in general. In this paper, a judicious use of Jordan Algebras in the context of sequential optimality conditions is done in order to generalize the global convergence theory of an Augmented Lagrangian method for nonlinear semidefinite programming. An approximate complementarity measure in this context is typically defined in terms of the eigenvalues of the constraint matrix and the eigenvalues of an approximate Lagrange multiplier. By exploiting the Jordan Algebra structure of the problem, we show that a simpler complementarity measure, defined in terms of the Jordan product, is stronger than the one defined in terms of eigenvalues. Thus, besides avoiding a tricky analysis of eigenvalues, a stronger necessary optimality condition is presented. We then prove the global convergence of an Augmented Lagrangian algorithm to this improved necessary optimality condition. The results are also extended to an interior point method. The optimality conditions we present are sequential ones, and no constraint qualification is employed; in particular, a global convergence result is available even when Lagrange multipliers are unbounded.

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

Access this article

Log in via an institution

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. Lourenço, B.F., Fukuda, E.H., Fukushima, M.: Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method. Math. Op. Res. 43(4), 1233–1251 (2018)

    Article  MathSciNet  Google Scholar 

  2. Kanno, Y., Takewaki, I.: Sequential semidefinite program for maximum robustness design of structures under load uncertainty. J. Optim. Theory Appl. 130, 265–287 (2006)

    Article  MathSciNet  Google Scholar 

  3. Stingl, M., Kočvara, M., Leugering, G.: A sequential convex semidefinite programming algorithm with an application to multiple-load free material optimization. SIAM J. Op. 20(1), 130–155 (2009)

    Article  MathSciNet  Google Scholar 

  4. Fares, B., Apkarian, P., Noll, D.: An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory. Int. J. Control 74(4), 348–360 (2001)

    Article  MathSciNet  Google Scholar 

  5. Fares, B., Noll, D., Apkarian, P.: Robust control via sequential semidefinite programming. SIAM J. Control. Optim. 40(6), 1791–1820 (2002)

    Article  MathSciNet  Google Scholar 

  6. Freund, R.W., Jarre, F., Vogelbusch, C.H.: Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling. Math. Program. 109, 581–611 (2007)

    Article  MathSciNet  Google Scholar 

  7. Konno, H., Kawadai, N., Wu, D.: Estimation of failure probability using semi-definite Logit model. CMS 1(1), 59–73 (2003)

    Article  Google Scholar 

  8. Vandenberghe, L., Boyd, S., Wu, S.P.: Determinant maximization with linear matrix inequality constraints. SIAM J. Matrix Anal. Appl. 19(2), 499–533 (1998)

    Article  MathSciNet  Google Scholar 

  9. Andreani, R., Haeser, G., Viana, D.: Optimality conditions and global convergence for nonlinear semidefinite programming. Math. Program. 180, 203–235 (2020)

    Article  MathSciNet  Google Scholar 

  10. Andreani, R., Haeser, G., Martínez, J.M.: On sequential optimality conditions for smooth constrained optimization. Optimization 60(5), 627–641 (2011)

    Article  MathSciNet  Google Scholar 

  11. Andreani, R., Martínez, J.M., Ramos, A., Silva, P.J.S.: Strict constraint qualifications and sequential optimality conditions for constrained optimization. Math. Oper. Res. 43(3), 693–717 (2018)

    Article  MathSciNet  Google Scholar 

  12. Abadie, J.: On the Kuhn-Tucker Theorem. In: Abadie, J. (ed.) Nonlinear Programming, pp. 21–36. John Wiley, New York (1967)

    MATH  Google Scholar 

  13. Guignard, M.: Generalized Kunh-Tucker conditions for mathematical programming in a banach space. SIAM Journal of Control 7, 232–241 (1969)

    Article  Google Scholar 

  14. Haeser, G., Liu, H., Ye, Y.: Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. Math. Program. 178, 263–299 (2019). https://doi.org/10.1007/s10107-018-1290-4

    Article  MathSciNet  MATH  Google Scholar 

  15. Bueno, L., Haeser, G., Rojas, F.: Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications. SIAM J. Optim. 29(1), 31–54 (2019). https://doi.org/10.1137/17M1162524

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  17. Bueno, L.F., Haeser, G., Lara, F., Rojas, F.: An augmented Lagrangian method for quasi-equilibrium problems. Comput. Optim. Appl. (2020). https://doi.org/10.1007/s10589-020-00180-4

    Article  MathSciNet  MATH  Google Scholar 

  18. Andreani, R., Haeser, G., Secchin, L., Silva, P.: New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences. SIAM J. Optim. 29(4), 3201–3230 (2019). https://doi.org/10.1137/18M121040X

    Article  MathSciNet  MATH  Google Scholar 

  19. Kanzow, C., Steck, D., Wachsmuth, D.: An augmented Lagrangian methods for optimization problems in Banach spaces. SIAM J. Control Op. 56(1), 272–291 (2018). https://doi.org/10.1137/16M1107103

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  21. Haeser, G.: A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms. Comput. Optim. Appl. 70(2), 615–639 (2018)

    Article  MathSciNet  Google Scholar 

  22. 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  MathSciNet  Google Scholar 

  23. 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  MathSciNet  Google Scholar 

  24. Martínez, J.M., Pilotta, E.: Inexact restoration algorithm for constrained optimization. J. Op. Theory Appl. 104(1), 135–163 (2000)

    Article  MathSciNet  Google Scholar 

  25. Qi, L., Wei, Z.: On the constant positive linear dependence conditions and its application to SQP methods. SIAM J. Op. 10(4), 963–981 (2000)

    Article  MathSciNet  Google Scholar 

  26. Yamakawa, Y., Okuno, T.: Global convergence of a stabilized sequential quadratic semidefinite programming method for nonlinear semidefinite programs without constraint qualifications. ArXiv:1909.13544 (2019)

  27. Andreani, R., Fukuda, E.H., Haeser, G., Santos, D.O., Secchin, L.D.: Optimality conditions for nonlinear second-order cone programming and symmetric cone programming. Optimization Online (2019)

  28. Yamashita, H., Yabe, H., Harada, K.: A primal-dual interior point method for nonlinear semidefinite programming. Math. Program. 135(1–2), 89–121 (2012)

    Article  MathSciNet  Google Scholar 

  29. Faraut, J., Korànyi, A.: Analysis on symmetric Cones. Clarendon Press, Oxford, Oxford mathematical monographs (1994)

    MATH  Google Scholar 

  30. Baes, M.: Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras. Linear Algebra Appl. 422(2), 664–700 (2007)

    Article  MathSciNet  Google Scholar 

  31. Andreani, R., Martínez, J.M., Svaiter, B.F.: A new sequencial optimality condition for constrained optimization and algorithmic consequences. SIAM J. Optim. 20(6), 3533–3554 (2010)

    Article  MathSciNet  Google Scholar 

  32. Okabe, K.: Improvement of the stabilized sequential quadratic semidefinite programming method for nonlinear programming problems (in Japanese) (2021). Kyoto University, Undergraduate thesis

Download references

Acknowledgements

We thank the reviewers for their valuable comments and suggestions.

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, University of Campinas, Campinas-SP, Brazil

    R. Andreani

  2. Graduate School of Informatics, Kyoto University, Kyoto, Japan

    E. H. Fukuda

  3. Department of Applied Mathematics, University of São Paulo, São Paulo-SP, Brazil

    G. Haeser

  4. Institute of Science and Technology, Federal University of São Paulo, São José dos Campos-SP, Brazil

    D. O. Santos

  5. Department of Applied Mathematics, Federal University of Espírito Santo, São Mateus, ES, Brazil

    L. D. Secchin

Authors
  1. R. Andreani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. H. Fukuda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G. Haeser
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. D. O. Santos
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. L. D. Secchin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. Haeser.

Ethics declarations

Conflict of Interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

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

This work was supported by the Grant-in-Aid for Scientific Research (C) (19K11840) from Japan Society for the Promotion of Science, FAPESP grants 2013/07375-0, 2017/18308-2 and 2018/24293-0, FAPES grant 116/2019, CNPq and PRONEX - CNPq/FAPERJ grant E-26/010.001247/2016.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Andreani, R., Fukuda, E.H., Haeser, G. et al. On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming. Comput Optim Appl 79, 633–648 (2021). https://doi.org/10.1007/s10589-021-00281-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-021-00281-8

Keywords

Mathematics Subject Classification

Search

Navigation