Fetching the paper…
Reading the bibliography…
We consider the problem of minimizing a smooth convex function by reducing the optimization to computing the Nash equilibrium of a particular zero-sum convex-concave game.
A method for unconstrained convex minimization problem with the rate of convergence o ( 1 / k 2 ) o(1/k^{2})
Yuri Nesterov · 1983
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate o ( 1 / k 2 ) o(1/k^{2})
Yuri Nesterov · 1983
Earlier work this paper cites.
On an approach to the construction of optimal methods of minimization of smooth convex functions
Yuri Nesterov · 1988
Earlier work this paper cites.
Convergence analysis of a proximal-like minimization algorithm using bregman functions
Gong Chen and Marc Teboulle · 1993
Earlier work this paper cites.
Convex analysis
Tyrrell Rockafellar · 1996
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich · 2003
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Yuri Nesterov · 2004
Earlier work this paper cites.
Smooth minimization of nonsmooth functions
Yuri Nesterov · 2005
Earlier work this paper cites.
Optimal strategies from random walks
Jacob Abernethy, Manfred K Warmuth, and Joel Yellin · 2008
Earlier work this paper cites.
On accelerated proximal gradient methods for convex-concave optimization
Paul Tseng · 2008
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.
Mind the duality gap: Logarithmic regret algorithms for online optimization
Sham Kakade and Shai Shalev-Shwartz · 2009
Cited alongside, same era.
Primal-dual first-order methods with o ( 1 / ϵ ) o(1/\epsilon) iteration-complexity for cone programming
Guanghui Lan, Zhaosong Lu, and Renato D. C. Monteiro · 2011
Cited alongside, same era.
Online optimization with gradual variations
Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi, Chi-Jen Lu, Rong Jin, , and Shenghuo Zhu · 2012
Cited alongside, same era.
Minimax optimal algorithms for unconstrained linear optimization
Brendan McMahan and Jacob Abernethy · 2013
Cited alongside, same era.
Online learning with predictable sequences
Alexander Rakhlin and Karthik Sridharan · 2013
Cited alongside, same era.
Optimization, learning, and games with predictable sequences
Alexander Rakhlin and Karthik Sridharan · 2013
Fast convergence of regularized learning in games
Vasilis Syrgkanis, Alekh Agarwal, Haipeng Luo, and Robert E. Schapire · 2015
Later among the works it cites.
Analysis and design of optimization algorithms via integral quadratic constraints
Laurent Lessard, Benjamin Recht, and Andrew Packard · 2016
Later among the works it cites.
A variational perspective on accelerated methods in optimization
Andre Wibisono, Ashia C Wilson, and Michael I Jordan · 2016
Later among the works it cites.
Frank-wolfe and equilibrium computation
Jacob Abernethy and Jun-Kun Wang · 2017
Later among the works it cites.
Linear coupling: An ultimate unification of gradient and mirror descent
Zeyuan Allen-Zhu and Lorenzo Orecchia · 2017
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.
Proximal algorithms
Neal Parikh and Stephen Boyd · 2014
Cited alongside, same era.
A differential equation for modeling nesterov’s accelerated gradient method: Theory and insights
Weijie Su, Stephen Boyd, and Emmanuel Candes · 2014
Cited alongside, same era.
A geometric alternative to nesterov’s accelerated gradient descent
Sabastien Bubeck, Yin Tat Lee, and Mohit Singh · 2015
Cited alongside, same era.
From averaging to acceleration, there is only a step-size
Nicolas Flammarion and Francis Bach · 2015
Cited alongside, same era.
Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, and Haoyang Zeng · 2017
Later among the works it cites.
An optimal randomized incremental gradient method
Guanghui Lan and Yi Zhou · 2017
Later among the works it cites.
Faster rates for convex-concave games
Jacob Abernethy, Kfir Levy, Kevin Lai, and Jun-Kun Wang · 2018
Closest in time.
The mechanics of n-player differentiable games
David Balduzzi, Sebastien Racaniere, James Martens, Jakob Foerster, Karl Tuyls, and Thore Graepel · 2018
Closest in time.
Negative momentum for improved game dynamics
Gauthier Gidel, Reyhane Askari Hemmat, Mohammad Pezeshki, Gabriel Huang, Remi Lepriol, Simon Lacoste-Julien, and Ioannis Mitliagkas · 2018
Closest in time.