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

Celý popis

Podrobná bibliografia

Vydané v:	Optimization methods & software Ročník 34; číslo 2; s. 305 - 335
Hlavní autori:	Necoara, I., Patrascu, A., Glineur, F.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Abingdon Taylor & Francis 04.03.2019 Taylor & Francis Ltd
Predmet:	(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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!