EUVIMEDEUVIMED entdecken
Crossref

Augmented Lagrangian–Based First-Order Methods for Convex-Constrained Programs with Weakly Convex Objective

Zichong Li, Yangyang Xu

INFORMS Journal on Optimization · 2021-10 · 3 (4) · 373-397

DOI: 10.1287/ijoo.2021.0052 ↗

Kurz gefasst

Fachartikel in der Zeitschrift INFORMS Journal on Optimization, 2021-10. Verfasst von Zichong Li und 1 weiteren Autor:innen. Die Arbeit wurde bisher 15-mal zitiert (Crossref) und nennt 15 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

First-order methods (FOMs) have been widely used for solving large-scale problems. A majority of existing works focus on problems without constraint or with simple constraints. Several recent works have studied FOMs for problems with complicated functional constraints. In this paper, we design a novel augmented Lagrangian (AL)–based FOM for solving problems with nonconvex objective and convex constraint functions. The new method follows the framework of the proximal point (PP) method. On approximately solving PP subproblems, it mixes the usage of the inexact AL method (iALM) and the quadratic penalty method, whereas the latter is always fed with estimated multipliers by the iALM. The proposed method achieves the best-known complexity result to produce a near Karush–Kuhn–Tucker (KKT) point. Theoretically, the hybrid method has a lower iteration-complexity requirement than its counterpart that only uses iALM to solve PP subproblems; numerically, it can perform significantly better than a pure-penalty-based method. Numerical experiments are conducted on nonconvex linearly constrained quadratic programs. The numerical results demonstrate the efficiency of the proposed methods over existing ones.

Zitieren

APA

Li, Z., & Xu, Y. (2021). Augmented Lagrangian–Based First-Order Methods for Convex-Constrained Programs with Weakly Convex Objective. INFORMS Journal on Optimization, 3(4), 373-397. https://doi.org/10.1287/ijoo.2021.0052

Vancouver

Li Z, Xu Y. Augmented Lagrangian–Based First-Order Methods for Convex-Constrained Programs with Weakly Convex Objective. INFORMS Journal on Optimization. 2021;3(4):373-397. doi:10.1287/ijoo.2021.0052

BibTeX
@article{Li2021,
  author = {Li, Zichong and Xu, Yangyang},
  title = {Augmented Lagrangian–Based First-Order Methods for Convex-Constrained Programs with Weakly Convex Objective},
  journal = {INFORMS Journal on Optimization},
  year = {2021},
  volume = {3},
  number = {4},
  pages = {373--397},
  doi = {10.1287/ijoo.2021.0052}
}
Kostenlos starten →