Fetching the paper…
Reading the bibliography…
Augmented Lagrangian method (ALM) has been popularly used for solving constrained optimization problems.
Multiplier and gradient methods
M. R. Hestenes · 1969
Earlier work this paper cites.
A method for non-linear constraints in minimization problems
M. J. Powell · 1969
Earlier work this paper cites.
Convergence rate of penalty and multiplier methods
D. P. Bertsekas · 1973
Earlier work this paper cites.
A dual approach to solving nonlinear programming problems by unconstrained optimization
R. T. Rockafellar · 1973
Earlier work this paper cites.
The multiplier method of hestenes and powell applied to convex programming
R. T. Rockafellar · 1973
Earlier work this paper cites.
Augmented lagrangians and applications of the proximal point algorithm in convex programming
R. T. Rockafellar · 1976
Earlier work this paper cites.
On the convergence of the proximal point algorithm for convex minimization
O. Güler · 1991
Earlier work this paper cites.
New proximal point algorithms for convex minimization
O. Güler · 1992
Earlier work this paper cites.
On the convergence of the exponential multiplier method for convex programming
P. Tseng and D. P. Bertsekas · 1993
Earlier work this paper cites.
Penalty/barrier multiplier methods for convex programming problems
A. Ben-Tal and M. Zibulevsky · 1997
Earlier work this paper cites.
Nonlinear programming
D. P. Bertsekas · 1999
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Y. Nesterov · 2004
Earlier work this paper cites.
Numerical comparison of augmented lagrangian algorithms for nonconvex problems
E. G. Birgin, R. Castillo, and J. M. Martínez · 2005
Earlier work this paper cites.
CVX: Matlab software for disciplined convex programming, 2008
M. Grant, S. Boyd, and Y. Ye · 2008
Cited alongside, same era.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Cited alongside, same era.
Approximate primal solutions and rate analysis for dual subgradient methods
A. Nedić and A. Ozdaglar · 2009
Cited alongside, same era.
Subgradient methods for saddle-point problems
A. Nedić and A. Ozdaglar · 2009
Cited alongside, same era.
On the acceleration of augmented lagrangian method for linearly constrained optimization
B. He and X. Yuan · 2010
Cited alongside, same era.
Distributed optimization and statistical learning via the alternating direction method of multipliers
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein · 2011
Rate analysis of inexact dual first-order methods application to dual decomposition
I. Necoara and V. Nedelcu · 2014
Later among the works it cites.
Computational complexity of inexact gradient augmented lagrangian methods: application to constrained mpc
V. Nedelcu, I. Necoara, and Q. Tran-Dinh · 2014
Later among the works it cites.
Inexact accelerated augmented lagrangian methods
M. Kang, M. Kang, and M. Jung · 2015
Later among the works it cites.
An accelerated linearized alternating direction method of multipliers
Y. Ouyang, Y. Chen, G. Lan, and E. Pasiliao Jr · 2015
Later among the works it cites.
On the global and linear convergence of the generalized alternating direction method of multipliers
W. Deng and W. Yin · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Convergence rates of inexact proximal-gradient methods for convex optimization
M. Schmidt, N. L. Roux, and F. R. Bach · 2011
Cited alongside, same era.
On the O ( 1 / n ) {O}(1/n) convergence rate of the douglas–rachford alternating direction method
B. He and X. Yuan · 2012
Cited alongside, same era.
Accelerated bregman method for linearly constrained ℓ 1 \ell_{1} – ℓ 2 \ell_{2} minimization
M. Kang, S. Yun, H. Woo, and M. Kang · 2013
Cited alongside, same era.
Iteration-complexity of first-order penalty methods for convex programming
G. Lan and R. D. Monteiro · 2013
Cited alongside, same era.
Gradient methods for minimizing composite functions
Y. Nesterov · 2013
Cited alongside, same era.
Constrained optimization and Lagrange multiplier methods
D. P. Bertsekas · 2014
Cited alongside, same era.
X. Gao, Y. Xu, and S. Zhang · 2016
Later among the works it cites.
Iteration-complexity of first-order augmented lagrangian methods for convex programming
G. Lan, D. Renato, and C. Monteiro · 2016
Later among the works it cites.
Y.-F. Liu, X. Liu, and S. Ma · 2016
Later among the works it cites.
A primal-dual type algorithm with the O ( 1 / t ) {O}(1/t) convergence rate for large scale constrained convex programs
H. Yu and M. J. Neely · 2016
Later among the works it cites.
Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
Y. Xu · 2017
Closest in time.
Asynchronous parallel primal-dual block update methods
Y. Xu · 2017
Closest in time.
Accelerated primal–dual proximal block coordinate updating methods for constrained convex optimization
Y. Xu and S. Zhang · 2017
Closest in time.
A simple parallel algorithm with an O ( 1 / t ) {O}(1/t) convergence rate for general convex programs
H. Yu and M. J. Neely · 2017
Closest in time.