Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming

In this paper we present a complete iteration complexity analysis of inexact first-order Lagrangian and penalty methods for solving cone-constrained convex problems that have or may not have optimal Lagrange multipliers that close the duality gap. We first assume the existence of optimal Lagrange mu...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization methods & software Jg. 34; H. 2; S. 305 - 335
Hauptverfasser: Necoara, I., Patrascu, A., Glineur, F.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Abingdon Taylor & Francis 04.03.2019
Taylor & Francis Ltd
Schlagworte:
(augmented) dual first-order methods
approximate primal solution
Complexity
Computational geometry
conic convex problems
Convexity
Iterative methods
Lagrange multiplier
Mathematical programming
Methods
overall computational complexity
penalty fast gradient methods
penalty functions
smooth (augmented) dual functions
Smoothing
ISSN:1055-6788, 1029-4937
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we present a complete iteration complexity analysis of inexact first-order Lagrangian and penalty methods for solving cone-constrained convex problems that have or may not have optimal Lagrange multipliers that close the duality gap. We first assume the existence of optimal Lagrange multipliers and study primal-dual first-order methods based on inexact information and augmented Lagrangian smoothing or Nesterov-type smoothing. For inexact (fast) gradient augmented Lagrangian methods, we derive an overall computational complexity of projections onto a simple primal set in order to attain an ε-optimal solution of the conic convex problem. For the inexact fast gradient method combined with Nesterov-type smoothing, we derive computational complexity projections onto the same set. Then, we assume that optimal Lagrange multipliers might not exist for the cone-constrained convex problem, and analyse the fast gradient method for solving penalty reformulations of the problem. For the fast gradient method combined with penalty framework, we also derive an overall computational complexity of projections onto a simple primal set to attain an ε-optimal solution for the original problem.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1055-6788
1029-4937
DOI:10.1080/10556788.2017.1380642