Fetching the paper…
Reading the bibliography…
We show that standard extragradient methods (i.e.
Convex Analysis
R. Tyrrell Rockafellar · 1970
Earlier work this paper cites.
A method for solving a convex programming problem with convergence rate o ( 1 / k 2 ) o(1/k^{2})
Yurii Nesterov · 1983
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A. Nemirovski and D.B̃. Yudin · 1983
Earlier work this paper cites.
Prox-method with rate of convergence o(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
Arkadi Nemirovski · 2004
Earlier work this paper cites.
Dual extrapolation and its applications to solving variational inequalities and related problems
Yurii Nesterov · 2007
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
Amir Beck and Marc Teboulle · 2009
Earlier work this paper cites.
Applications of strong convexity–strong smoothness duality to learning with matrices
Sham M. Kakade, Shai Shalev-Shwartz, and Ambuj Tewari · 2009
Earlier work this paper cites.
Solving variational inequalities with stochastic mirror-prox algorithm
Anatoli Juditsky, Arkadi Nemirovski, and Claire Tauvel · 2011
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Earlier work this paper cites.
Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems
Yin Tat Lee and Aaron Sidford · 2013
Earlier work this paper cites.
Optimization, learning, and games with predictable sequences
Alexander Rakhlin and Karthik Sridharan · 2013
Earlier work this paper cites.
Convex optimization: Algorithms and complexity
Sébastien Bubeck · 2015
Earlier work this paper cites.
Optimal black-box reductions between optimization objectives
Zeyuan Allen Zhu and Elad Hazan · 2016
Earlier work this paper cites.
Even faster accelerated coordinate descent using non-uniform sampling
Zeyuan Allen Zhu, Zheng Qu, Peter Richtárik, and Yang Yuan · 2016
Earlier work this paper cites.
Stochastic variance reduction methods for saddle-point problems
Balamurugan Palaniappan and Francis R. Bach · 2016
Cited alongside, same era.
Katyusha: the first direct acceleration of stochastic gradient methods
Zeyuan Allen Zhu · 2017
Cited alongside, same era.
A descent lemma beyond lipschitz gradient continuity: First-order methods revisited and applications
Heinz H. Bauschke, Jérôme Bolte, and Marc Teboulle · 2017
Cited alongside, same era.
Efficiency of the accelerated coordinate descent method on structured optimization problems
Yurii Nesterov and Sebastian U. Stich · 2017
Cited alongside, same era.
Area-convexity, l ∞ {}_{\mbox{{$\infty$}}} regularization, and undirected multicommodity flow
Jonah Sherman · 2017
Cited alongside, same era.
Minimizing finite sums with the stochastic average gradient
Faster width-dependent algorithm for mixed packing and covering lps
Digvijay Boob, Saurabh Sawlani, and Di Wang · 2019
Later among the works it cites.
Reducing noise in GAN training with variance reduced extragradient
Tatjana Chavdarova, Gauthier Gidel, François Fleuret, and Simon Lacoste-Julien · 2019
Later among the works it cites.
Variance reduction for matrix games
Yair Carmon, Yujia Jin, Aaron Sidford, and Kevin Tian · 2019
Later among the works it cites.
Optimal complexity and certification of bregman first-order methods
Radu-Alexandru Dragomir, Adrien Taylor, Alexandre d’Aspremont, and Jérôme Bolte · 2019
Later among the works it cites.
On the convergence of single-call stochastic extra-gradient methods
Yu-Guan Hsieh, Franck Iutzeler, Jérôme Malick, and Panayotis Mertikopoulos · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Mark W. Schmidt, Nicolas Le Roux, and Francis R. Bach · 2017
Cited alongside, same era.
Faster rates for convex-concave games
Jacob D. Abernethy, Kevin A. Lai, Kfir Y. Levy, and Jun-Kun Wang · 2018
Cited alongside, same era.
Accelerated extra-gradient descent: A novel accelerated first-order method
Jelena Diakonikolas and Lorenzo Orecchia · 2018
Cited alongside, same era.
Accelerated bregman proximal gradient methods for relatively smooth convex optimization
Filip Hanzely, Peter Richtarik, and Lin Xiao · 2018
Cited alongside, same era.
Relatively smooth convex optimization by first-order methods, and applications
Haihao Lu, Robert M. Freund, and Yurii E. Nesterov · 2018
Cited alongside, same era.
Coordinate methods for accelerating ℓ ∞ \ell_{\infty} regression and faster approximate maximum flow
Aaron Sidford and Kevin Tian · 2018
Cited alongside, same era.
Acceleration through optimistic no-regret dynamics
Jun-Kun Wang and Jacob D. Abernethy · 2018
Cited alongside, same era.
A direct tilde{O}(1/epsilon) iteration parallel algorithm for optimal transport
Arun Jambulapati, Aaron Sidford, and Kevin Tian · 2019
Later among the works it cites.
“relative-continuity” for non-lipschitz non-smooth convex optimization using stochastic (or deterministic) mirror descent
Haihao Lu · 2019
Later among the works it cites.
Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile
Panayotis Mertikopoulos, Bruno Lecouat, Houssam Zenati, Chuan-Sheng Foo, Vijay Chandrasekhar, and Georgios Piliouras · 2019
Later among the works it cites.
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
Yuyuan Ouyang and Yangyang Xu · 2019
Later among the works it cites.
On lower iteration complexity bounds for the saddle point problems
Junyu Zhang, Minyi Hong, and Shuzhong Zhang · 2019
Later among the works it cites.
Coordinate methods for matrix games
Yair Carmon, Yujia Jin, Aaron Sidford, and Kevin Tian · 2020
Closest in time.
Near-optimal algorithms for minimax optimization
Tianyi Lin, Chi Jin, and Michael I. Jordan · 2020
Closest in time.
Fedor Stonyakina, Alexander Tyurin, Alexander Gasnikov, Pavel Dvurechensky, Artem Agafonov, Darina Dvinskikh, Dmitry Pasechnyuk, Sergei Artamonov, and Victorya Piskunova · 2020
Closest in time.