Augmented Lagrangian Methods for Convex Matrix Optimization Problems

  • Ying Cui
  • , Chao Ding
  • , Xu Dong Li
  • , Xin Yuan Zhao

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we provide some gentle introductions to the recent advance in augmented Lagrangian methods for solving large-scale convex matrix optimization problems (cMOP). Specifically, we reviewed two types of sufficient conditions for ensuring the quadratic growth conditions of a class of constrained convex matrix optimization problems regularized by nonsmooth spectral functions. Under a mild quadratic growth condition on the dual of cMOP, we further discussed the R-superlinear convergence of the Karush–Kuhn–Tucker (KKT) residuals of the sequence generated by the augmented Lagrangian methods (ALM) for solving convex matrix optimization problems. Implementation details of the ALM for solving core convex matrix optimization problems are also provided.

Original languageEnglish (US)
Pages (from-to)305-342
Number of pages38
JournalJournal of the Operations Research Society of China
Volume10
Issue number2
DOIs
StatePublished - Jun 2022

Bibliographical note

Publisher Copyright:
© 2021, Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag GmbH Germany, part of Springer Nature.

Keywords

  • Augmented Lagrangian methods
  • Fast convergence rates
  • Matrix optimization
  • Metric subregularity
  • Quadratic growth conditions
  • Semismooth Newton methods
  • Spectral functions

Fingerprint

Dive into the research topics of 'Augmented Lagrangian Methods for Convex Matrix Optimization Problems'. Together they form a unique fingerprint.

Cite this