Fetching the paper…
Reading the bibliography…
In this paper, we present novel randomized algorithms for solving saddle point problems whose dual feasible region is given by the direct product of many convex sets.
On the numerical solution of heat conduction problems in two and three space variables
Jr. Douglas, Jim and Jr. Rachford, H. H · 1956
Earlier work this paper cites.
The relaxation method of finding the common point convex sets and its application to the solution of problems in convex programming
L.M. Bregman · 1967
Earlier work this paper cites.
Sur l’approximation, par éléments finis d’ordre un, et la résolution, par pénalisation-dualité d’une classe de problèmes de dirichlet non linéaires
Roland Glowinski and A Marroco · 1975
Earlier work this paper cites.
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
D. Gabay and B. Mercier · 1976
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R. Rockafellar · 1976
Earlier work this paper cites.
Splitting algorithms for the sum of two nonlinear operators
P. L. Lions and B. Mercier · 1979
Earlier work this paper cites.
Chapter ix applications of the method of multipliers to variational inequalities
Daniel Gabay · 1983
Earlier work this paper cites.
On the douglas-rachford splitting method and the proximal point algorithm for maximal monotone operators
Jonathan Eckstein and DimitriP. Bertsekas · 1992
Earlier work this paper cites.
Enlargement of monotone operators with applications to variational inequalities
Regina S Burachik, Alfredo N Iusem, and Benar Fux Svaiter · 1997
Earlier work this paper cites.
Prox-method with rate of convergence o ( 1 / t ) o(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
A. S. Nemirovski · 2005
Earlier work this paper cites.
Smooth minimization of nonsmooth functions
Y. E. Nesterov · 2005
Earlier work this paper cites.
A convergent incremental gradient method with a constant step size
D. Blatt, A. Hero, and H. Gauchman · 2007
Earlier work this paper cites.
On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
R.D.C. Monteiro and B.F. Svaiter · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
A. S. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Earlier work this paper cites.
A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
E. Esser, X. Zhang, and T.F. Chan · 2010
Earlier work this paper cites.
Randomized methods for linear constraints: Convergence rates and conditioning
D. Leventhal and A. S. Lewis · 2010
Earlier work this paper cites.
Complexity of variants of tsengÔøΩs modified f-b splitting and korpelevich’s methods for hemi-variational inequalities with applications to saddle-point and convex optimization problems
R.D.C. Monteiro and B.F. Svaiter · 2010
Cited alongside, same era.
On the complexity of the hybrid proximal projection method for the iterates and the ergodic mean
R.D.C. Monteiro and B.F. Svaiter · 2010
Cited alongside, same era.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. E. Nesterov · 2010
Cited alongside, same era.
Distributed optimization and statistical learning via the alternating direction method of multipliers
Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein · 2011
Cited alongside, same era.
A first-order primal-dual algorithm for convex problems with applications to imaging
A. Chambolle and T. Pock · 2011
Cited alongside, same era.
Iteration-complexity of first-order penalty methods for convex programming
G. Lan and R. D. C. Monteiro · 2013
Later among the works it cites.
On the complexity analysis of randomized block-coordinate descent methods
Z. Lu and L. Xiao · 2013
Later among the works it cites.
Mixedgrad: An O(1/T) convergence rate algorithm for stochastic smooth optimization
Mehrdad Mahdavi and Rong Jin · 2013
Later among the works it cites.
Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
Renato DC Monteiro and Benar F Svaiter · 2013
Later among the works it cites.
Minimizing finite sums with the stochastic average gradient
M. Schmidt, N. L. Roux, and F. Bach · 2013
Later among the works it cites.
Stochastic dual coordinate ascent methods for regularized loss
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Primal-dual first-order methods with 𝒪 ( 1 / ϵ ) {\cal O}(1/\epsilon) iteration-complexity for cone programming
G. Lan, Z. Lu, and R. D. C. Monteiro · 2011
Cited alongside, same era.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, I: a generic algorithmic framework
S. Ghadimi and G. Lan · 2012
Cited alongside, same era.
Fast multiple-splitting algorithms for convex optimization
D. Goldfarb and S. Ma · 2012
Cited alongside, same era.
On the $o(1/n)$ convergence rate of the douglasñrachford alternating direction method
B. He and X. Yuan · 2012
Cited alongside, same era.
On the o(1/n) convergence rate of the douglas-rachford alternating direction method
Bingsheng He and Xiaoming Yuan · 2012
Cited alongside, same era.
On the Linear Convergence of the Alternating Direction Method of Multipliers
M. Hong and Z.-Q. Luo · 2012
Cited alongside, same era.
An optimal method for stochastic composite optimization
G. Lan · 2012
Cited alongside, same era.
Shai Shalev-Shwartz and Tong Zhang · 2013
Later among the works it cites.
Stochastic Dual Coordinate Ascent with Alternating Direction Multiplier Method
T. Suzuki · 2013
Later among the works it cites.
Accelerated schemes for a class of variational inequalities
Y. Chen, G. Lan, and Y. Ouyang · 2014
Closest in time.
Optimal primal-dual methods for a class of saddle point problems
Y. Chen, G. Lan, and Y. Ouyang · 2014
Closest in time.
Mirror prox algorithm for multi-term composite minimization and semi-separable problems
N. He, A. Juditsky, and A. Nemirovski · 2014
Closest in time.
An accelerated linearized alternating direction method of multipliers
Y. Ouyang, Y. Chen, G. Lan, and E. Pasiliao · 2014
Closest in time.
On the Global Linear Convergence of the ADMM with Multi-Block Variables
Shuzhong Zhang Tianyi Lin, Shiqian Ma · 2014
Closest in time.
Stochastic primal-dual coordinate method for regularized empirical risk minimization
Yuchen Zhang and Lin Xiao · 2014
Closest in time.
Stochastic block mirror descent methods for nonsmooth and stochastic optimization
C. D. Dang and G. Lan · 2015
Closest in time.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
S. Shalev-Shwartz and T. Zhang · 2015
Closest in time.