Fetching the paper…
Reading the bibliography…
In this work, we study the computational complexity of reducing the squared gradient magnitude for smooth minimax optimization problems.
Fixed points of nonexpanding maps
Halpern, B · 1967
Earlier work this paper cites.
Monotone operators associated with saddle-functions and minimax problems
Rockafellar, R. T · 1970
Earlier work this paper cites.
Extragradient method for finding saddle points and other problems
Korpelevich, G · 1977
Earlier work this paper cites.
A modification of the Arrow–Hurwicz method for search of saddle points
Popov, L. D · 1980
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
Nemirovsky, A. S. and Yudin, D. B · 1983
Earlier work this paper cites.
On optimality of Krylov’s information when solving linear operator equations
Nemirovsky, A. S · 1991
Earlier work this paper cites.
Information-based complexity of linear operator equations
Nemirovsky, A. S · 1992
Earlier work this paper cites.
On linear convergence of iterative methods for the variational inequality problem
Tseng, P · 1995
Earlier work this paper cites.
A hybrid approximate extragradient–proximal point algorithm using the enlargement of a maximal monotone operator
Solodov, M. V. and Svaiter, B. F · 1999
Earlier work this paper cites.
A modified forward-backward splitting method for maximal monotone mappings
Tseng, P · 2000
Earlier work this paper cites.
Chebyshev Polynomials
Mason, J. C. and Handscomb, D. C · 2002
Earlier work this paper cites.
New extragradient-type methods for general variational inequalities
Noor, M. A · 2003
Earlier work this paper cites.
Prox-method with rate of convergence 𝒪 ( 1 / t ) \mathcal{O}(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems
Nemirovski, A · 2004
Earlier work this paper cites.
Dual extrapolation and its applications to solving variational inequalities and related problems
Nesterov, Y · 2007
Earlier work this paper cites.
Subgradient methods for saddle-point problems
Nedić, A. and Ozdaglar, A · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Nemirovski, A., Juditsky, A., Lan, G., and Shapiro, A · 2009
Earlier work this paper cites.
Primal-dual subgradient methods for convex problems
Nesterov, Y · 2009
Earlier work this paper cites.
On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
Monteiro, R. D. and Svaiter, B. F · 2010
Earlier work this paper cites.
The subgradient extragradient method for solving variational inequalities in Hilbert space
Censor, Y., Gibali, A., and Reich, S · 2011
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
Chambolle, A. and Pock, T · 2011
Earlier work this paper cites.
Near-optimal no-regret algorithms for zero-sum games
Daskalakis, C., Deckelbaum, A., and Kim, A · 2011
Earlier work this paper cites.
Solving variational inequalities with stochastic mirror-prox algorithm
Juditsky, A., Nemirovski, A., and Tauvel, C · 2011
Earlier work this paper cites.
Low-cost modification of Korpelevich’s methods for monotone equilibrium problems
Lyashko, S., Semenov, V., and Voitova, T · 2011
Earlier work this paper cites.
Complexity of variants of T
Monteiro, R. D. and Svaiter, B. F · 2011
Earlier work this paper cites.
Solving strongly monotone variational and quasi-variational inequalities
Nesterov, Y. and Scrimali, L · 2011
Earlier work this paper cites.
Online optimization with gradual variations
Chiang, C.-K., Yang, T., Lee, C.-J., Mahdavi, M., Lu, C.-J., Jin, R., and Zhu, S · 2012
Earlier work this paper cites.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization I: A generic algorithmic framework
Ghadimi, S. and Lan, G · 2012
Earlier work this paper cites.
An optimal method for stochastic composite optimization
Lan, G · 2012
Earlier work this paper cites.
A primal–dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
Condat, L · 2013
Cited alongside, same era.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, II: Shrinking procedures and optimal algorithms
Ghadimi, S. and Lan, G · 2013
Cited alongside, same era.
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y · 2013
Cited alongside, same era.
A splitting algorithm for dual monotone inclusions involving cocoercive operators
Vũ, B. C · 2013
Cited alongside, same era.
Optimal primal-dual methods for a class of saddle point problems
Chen, Y., Lan, G., and Ouyang, Y · 2014
Cited alongside, same era.
Performance of first-order methods for smooth convex minimization: A novel approach
On the convergence of single-call stochastic extra-gradient methods
Hsieh, Y.-G., Iutzeler, F., Malick, J., and Mertikopoulos, P · 2019
Later among the works it cites.
Minmax optimization: Stable limit points of gradient descent ascent are locally optimal
Jin, C., Netrapalli, P., and Jordan, M. I · 2019
Later among the works it cites.
Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks
Liang, T. and Stokes, J · 2019
Later among the works it cites.
Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile
Mertikopoulos, P., Zenati, H., Lecouat, B., Foo, C.-S., Chandrasekhar, V., and Piliouras, G · 2019
Later among the works it cites.
Solving a class of non-convex min-max games using iterative first order methods
Nouiehed, M., Sanjabi, M., Huang, T., Lee, J. D., and Razaviyayn, M · 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…
Drori, Y. and Teboulle, M · 2014
Cited alongside, same era.
Generative adversarial nets
Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., and Bengio, Y · 2014
Cited alongside, same era.
An extragradient algorithm for monotone variational inequalities
Malitsky, Y. V. and Semenov, V · 2014
Cited alongside, same era.
Explaining and harnessing adversarial examples
Goodfellow, I. J., Shlens, J., and Szegedy, C · 2015
Cited alongside, same era.
Projected reflected gradient methods for monotone variational inequalities
Malitsky, Y · 2015
Cited alongside, same era.
Fast convergence of regularized learning in games
Syrgkanis, V., Agarwal, A., Luo, H., and Schapire, R. E · 2015
Cited alongside, same era.
On the iteration complexity of oblivious first-order optimization algorithms
Arjevani, Y. and Shamir, O · 2016
Cited alongside, same era.
Stochastic first-order methods: Non-asymptotic and computer-aided analyses via potential functions
Taylor, A. and Bach, F · 2019
Later among the works it cites.
Efficient algorithms for smooth minimax optimization
Thekumparampil, K. K., Jain, P., Netrapalli, P., and Oh, S · 2019
Later among the works it cites.
On lower iteration complexity bounds for the saddle point problems
Zhang, J., Hong, M., and Zhang, S · 2019
Later among the works it cites.
Optimal stochastic algorithms for convex-concave saddle-point problems
Zhao, R · 2019
Later among the works it cites.
Accelerated methods for saddle-point problem
Alkousa, M., Gasnikov, A., Dvinskikh, D., Kovalev, D., and Stonyakin, F · 2020
Later among the works it cites.
A tight and unified analysis of gradient-based methods for a whole spectrum of differentiable games
Azizian, W., Mitliagkas, I., Lacoste-Julien, S., and Gidel, G · 2020
Later among the works it cites.
Halpern iteration for near-optimal and parameter-free monotone inclusion and strong solutions to variational inequalities
Diakonikolas, J · 2020
Later among the works it cites.
Last iterate is slower than averaged iterate in smooth convex-concave saddle point problems
Golowich, N., Pattathil, S., Daskalakis, C., and Ozdaglar, A · 2020
Later among the works it cites.
On the convergence rate of the halpern-iteration
Lieder, F · 2020
Later among the works it cites.
Hybrid block successive approximation for one-sided non-convex min-max problems: Algorithms and applications
Lu, S., Tsaknakis, I., Hong, M., and Chen, Y · 2020
Later among the works it cites.
Golden ratio algorithms for variational inequalities
Malitsky, Y · 2020
Later among the works it cites.
A forward-backward splitting method for monotone inclusions without cocoercivity
Malitsky, Y. and Tam, M. K · 2020
Later among the works it cites.
Efficient search of first-order Nash equilibria in nonconvex-concave smooth min-max problems
Ostrovskii, D. M., Lowy, A., and Razaviyayn, M · 2020
Later among the works it cites.
Training GANs with centripetal acceleration
Peng, W., Dai, Y.-H., Zhang, H., and Cheng, L · 2020
Later among the works it cites.
Improved algorithms for convex-concave minimax optimization
Wang, Y. and Li, J · 2020
Later among the works it cites.
A catalyst framework for minimax optimization
Yang, J., Zhang, S., Kiyavash, N., and He, N · 2020
Later among the works it cites.
A unified analysis of first-order methods for smooth games via integral quadratic constraints
Zhang, G., Bao, X., Lessard, L., and Grosse, R · 2020
Later among the works it cites.
Adaptive extra-gradient methods for min-max optimization and games
Antonakopoulos, K., Belmega, E. V., and Mertikopoulos, P · 2021
Closest in time.
A warped resolvent algorithm to construct nash equilibria
Bùi, M. N. and Combettes, P. L · 2021
Closest in time.
Proximal gradient descent-ascent: Variable convergence under KŁ geometry
Chen, Z., Zhou, Y., Xu, T., and Liang, Y · 2021
Closest in time.
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
Ouyang, Y. and Xu, Y · 2021
Closest in time.
Large-Scale Convex Optimization via Monotone Operators
Ryu, E. K. and Yin, W · 2021
Closest in time.