Fetching the paper…
Reading the bibliography…
On solving a convex-concave bilinear saddle-point problem (SPP), there have been many works studying the complexity results of first-order methods.
Problem complexity and method efficiency in optimization
A. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
On optimality of krylov’s information when solving linear operator equations
A. Nemirovsky · 1991
Earlier work this paper cites.
Information-based complexity of linear operator equations
A. S. Nemirovski · 1992
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. Nemirovski · 2004
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Y. Nesterov · 2004
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
A. 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. Chan · 2010
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
A. Chambolle and T. Pock · 2011
Earlier work this paper cites.
Complexity of variants of Tseng’s modified F-B splitting and Korpelevich’s methods for hemivariational inequalities with applications to saddle-point and convex optimization problems
R. D. Monteiro and B. F. Svaiter · 2011
Earlier work this paper cites.
Privacy aware learning
J. C. Duchi, M. I. Jordan, and M. J. Wainwright · 2012
Earlier work this paper cites.
On the O ( 1 / n ) {O}(1/n) convergence rate of the douglas–rachford alternating direction method
B. He and X. Yuan · 2012
Earlier work this paper cites.
A primal–dual splitting method for convex optimization involving lipschitzian, proximable and linear composite terms
L. Condat · 2013
Earlier work this paper cites.
Revisiting frank-wolfe: Projection-free sparse convex optimization
M. Jaggi · 2013
Cited alongside, same era.
The complexity of large-scale convex programming under a linear optimization oracle
G. Lan · 2013
Cited alongside, same era.
Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
R. D. Monteiro and B. F. Svaiter · 2013
Cited alongside, same era.
Gradient methods for minimizing composite functions
Y. Nesterov · 2013
Cited alongside, same era.
Optimal primal-dual methods for a class of saddle point problems
Y. Chen, G. Lan, and Y. Ouyang · 2014
Cited alongside, same era.
First-order methods of smooth convex optimization with inexact oracle
O. Devolder, F. Glineur, and Y. Nesterov · 2014
An accelerated hpe-type algorithm for a class of composite convex-concave saddle-point problems
Y. He and R. D. Monteiro · 2016
Later among the works it cites.
Gradient sliding for composite optimization
G. Lan · 2016
Later among the works it cites.
Accelerated gradient sliding for structured convex optimization
G. Lan and Y. Ouyang · 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.
Conditional gradient sliding for convex optimization
G. Lan and Y. Zhou · 2016
Later among the works it cites.
Tight complexity bounds for optimizing composite objectives
B. E. Woodworth and N. Srebro · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Fast alternating direction optimization methods
T. Goldstein, B. O’Donoghue, S. Setzer, and R. Baraniuk · 2014
Cited alongside, same era.
Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
A. Juditsky and Y. Nesterov · 2014
Cited alongside, same era.
On lower complexity bounds for large-scale smooth convex optimization
C. Guzmán and A. Nemirovski · 2015
Cited alongside, same era.
An accelerated linearized alternating direction method of multipliers
Y. Ouyang, Y. Chen, G. Lan, and E. Pasiliao Jr · 2015
Cited alongside, same era.
Convex analysis
R. T. Rockafellar · 2015
Cited alongside, same era.
Dimension-free iteration complexity of finite sum optimization problems
Y. Arjevani and O. Shamir · 2016
Cited alongside, same era.
Later among the works it cites.
Accelerated schemes for a class of variational inequalities
Y. Chen, G. Lan, and Y. Ouyang · 2017
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
Later among the works it cites.
An optimal randomized incremental gradient method
G. Lan and Y. Zhou · 2017
Later among the works it cites.
Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
Y. Xu · 2017
Later among the works it cites.
Iteration complexity of inexact augmented lagrangian methods for constrained convex programming
Y. Xu · 2017
Later among the works it cites.
A primal-dual algorithm for general convex-concave saddle point problems
E. Y. Hamedani and N. S. Aybat · 2018
Closest in time.
Accelerated primal–dual proximal block coordinate updating methods for constrained convex optimization
Y. Xu and S. Zhang · 2018
Closest in time.
A new primal–dual algorithm for minimizing the sum of three functions with a linear operator
M. Yan · 2018
Closest in time.