Fetching the paper…
Reading the bibliography…
In this paper, we study the lower iteration complexity bounds for finding the saddle point of a strongly convex and strongly concave saddle point problem: $\min_x\max_yF(x,y)$.
Convex Analysis
R.T. Rockafellar · 1970
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
G.M. Korpelevich · 1976
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. Nemirovsky and D.B. Yudin · 1983
Earlier work this paper cites.
A note on a globally convergent newton method for solving monotone variational inequalities
P. Marcotte and J.-P. Dussault · 1987
Earlier work this paper cites.
Information-based complexity of linear operator equations
A. Nemirovsky · 1992
Earlier work this paper cites.
A globally convergent newton method for solving strongly monotone variational inequalities
K. Taji, M. Fukushima, and T. Ibaraki · 1993
Earlier work this paper cites.
Nonlinear Programming
D.P. Bertsekas · 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. Nemirovski · 2004
Earlier work this paper cites.
Solving strongly monotone variational and quasi-variational inequalities
Yu. Nesterov and L. Scrimali · 2006
Earlier work this paper cites.
Dual extrapolation and its applications to solving variational inequalities and related problems
Yu. Nesterov · 2007
Earlier work this paper cites.
Algorithmic Game Theory
N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani · 2007
Earlier work this paper cites.
Theory of Games and Economic Behavior (commemorative edition)
J. von Neumann, O. Morgenstern, and H.W. Kuhn · 2007
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.
Solving variational inequalities with stochastic mirror-prox algorithm
A. Juditsky, A. Nemirovski, and C. Tauvel · 2011
Earlier work this paper cites.
Generative Adversarial Nets
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio · 2014
Cited alongside, same era.
Distributionally robust logistic regression
S.S. Abadeh, P.M. Esfahani, and D. Kuhn · 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.
On the ergodic convergence rates of a first-order primal–dual algorithm
A. Chambolle and T. Pock · 2016
Cited alongside, same era.
Lower bounds for higher-order convex optimization
N. Agarwal and E. Hazan · 2017
Cited alongside, same era.
Solving non-convex non-concave min-max games under Polyak-Lojasiewicz condition
M. Sanjabi, M. Razaviyayn, and J.D. Lee · 2018
Later among the works it cites.
Oracle complexity of second-order methods for smooth convex optimization
Y. Arjevani, O. Shamir, and R. Shiff · 2019
Closest in time.
Lower bounds for finding stationary points II: First-order methods
Y. Carmon, J.C. Duchi, O. Hinder, and A. Sidford · 2019
Closest in time.
Linear lower bounds and conditioning of differentiable games
A. Ibrahim, W. Azizian, G. Gidel, and I. Mitliagkas · 2019
Closest in time.
Minmax optimization: Stable limit points of gradient descent ascent are locally optimal
C. Jin, P. Netrapalli, and M.I. Jordan · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Arjovsky, S. Chintala, and L. Bottou · 2017
Cited alongside, same era.
Lower bounds for finding stationary points I
Y. Carmon, J.C. Duchi, O. Hinder, and A. Sidford · 2017
Cited alongside, same era.
First-order algorithms for convex optimization with nonseparable objective and coupled constraints
X. Gao and S. Zhang · 2017
Cited alongside, same era.
Y. Xu · 2017
Cited alongside, same era.
Solving weakly-convex-weakly-concave saddle-point problems as weakly-monotone variational inequality
Q. Lin, M. Liu, H. Rafique, and T. Yang · 2018
Cited alongside, same era.
Implementable tensor methods in unconstrained convex optimization
Yu. Nesterov · 2018
Cited alongside, same era.
Lectures on Convex Optimization
Yu. Nesterov · 2018
Cited alongside, same era.
What is local optimality in nonconvex-nonconcave minimax optimization?
C. Jin, P. Netrapalli, and M.I. Jordan · 2019
Closest in time.
On gradient descent ascent for nonconvex-concave minimax problems
T. Lin, C. Jin, and M.I. Jordan · 2019
Closest in time.
S. Lu, I. Tsaknakis, M. Hong, and Y. Chen · 2019
Closest in time.
A. Mokhtari, A. Ozdaglar, and S. Pattathil · 2019
Closest in time.
DSCOVR: Randomized Primal-Dual Block Coordinate Algorithms for Asynchronous Distributed Optimization
L. Xiao, A. Yu, Q. Lin, and W. Chen · 2019
Closest in time.
Accelerating smooth games by manipulating spectral shapes
W. Azizian, D. Scieur, I. Mitliagkas, S. Lacoste-Julien, and G. Gidel · 2020
Closest in time.
Near-optimal algorithms for minimax optimization
T. Lin, C. Jin, and M. Jordan · 2020
Closest in time.
Improved algorithms for convex-concave minimax optimization
Y. Wang and J. Li · 2020
Closest in time.