An accelerated augmented Lagrangian method for linearly constrained convex programming with the rate of convergence O(1/k2)

In this paper, we propose and analyze an accelerated augmented Lagrangian method (denoted by AALM) for solving the linearly constrained convex programming. We show that the convergence rate of AALM is O (1/ k 2 ) while the convergence rate of the classical augmented Lagrangian method (ALM) is O (1/...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Applied Mathematics-A Journal of Chinese Universities Ročník 32; číslo 1; s. 117 - 126
Hlavní autori: Ke, Yi-fen, Ma, Chang-feng
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Hangzhou Editorial Committee of Applied Mathematics - A Journal of Chinese Universities 01.03.2017
Springer Nature B.V
Predmet:
Applications of Mathematics
Convergence
Convexity
Lagrange multiplier
Mathematics
Mathematics and Statistics
Nonlinear programming
convex programming
augmented Lagrangian method
accelerated technique
linearly constrained
ISSN:1005-1031, 1993-0445
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we propose and analyze an accelerated augmented Lagrangian method (denoted by AALM) for solving the linearly constrained convex programming. We show that the convergence rate of AALM is O (1/ k 2 ) while the convergence rate of the classical augmented Lagrangian method (ALM) is O (1/ k ). Numerical experiments on the linearly constrained l 1 − l 2 minimization problem are presented to demonstrate the effectiveness of AALM.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1005-1031
1993-0445
DOI:10.1007/s11766-017-3381-z