Fetching the paper…
Reading the bibliography…
First-order methods have been popularly used for solving large-scale problems.
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.
CVX: Matlab software for disciplined convex programming, 2008
M. Grant, S. Boyd, and Y. Ye · 2008
Earlier work this paper cites.
Subgradient methods for saddle-point problems
A. Nedić and A. Ozdaglar · 2009
Earlier work this paper cites.
On solving large-scale finite minimax problems using exponential smoothing
E. Pee and J. O. Royset · 2011
Earlier work this paper cites.
Gradient methods for minimizing composite functions
Y. Nesterov · 2013
Earlier work this paper cites.
Constrained optimization and Lagrange multiplier methods
D. P. Bertsekas · 2014
Earlier work this paper cites.
M. Hong, T.-H. Chang, X. Wang, M. Razaviyayn, S. Ma, and Z.-Q. Luo · 2014
Cited alongside, same era.
Computational complexity of inexact gradient augmented lagrangian methods: application to constrained mpc
V. Nedelcu, I. Necoara, and Q. Tran-Dinh · 2014
Cited alongside, same era.
Stochastic quasi-fejér block-coordinate fixed point iterations with random sweeping
P. L. Combettes and J.-C. Pesquet · 2015
Cited alongside, same era.
On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
Y. Cui, X. Li, D. Sun, and K.-C. Toh · 2016
Cited alongside, same era.
Coordinate-friendly structures, algorithms and applications
Z. Peng, T. Wu, Y. Xu, M. Yan, and W. Yin · 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.
First-order algorithms for convex optimization with nonseparable objective and coupled constraints
X. Gao and S.-Z. Zhang · 2017
Closest in time.
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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
X. Gao, Y. Xu, and S. Zhang · 2016
Cited alongside, same era.
Iteration-complexity of first-order augmented lagrangian methods for convex programming
G. Lan, D. Renato, and C. Monteiro · 2016
Cited alongside, same era.
Y.-F. Liu, X. Liu, and S. Ma · 2016
Cited alongside, same era.
Y. Xu · 2017
Closest in time.
Y. Xu and S. Zhang · 2017
Closest in time.