Fetching the paper…
Reading the bibliography…
We study the iteration complexity of the optimistic gradient descent-ascent (OGDA) method and the extra-gradient (EG) method for finding a saddle point of a convex-concave unconstrained min-max problem.
Brève communication. régularisation d’inéquations variationnelles par approximations successives
Martinet, B · 1970
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
Korpelevich, G · 1976
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
Rockafellar, R. T · 1976
Earlier work this paper cites.
On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in hilbert space
Bruck Jr, R. E · 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.
On the convergence of the proximal point algorithm for convex minimization
Güler, O · 1991
Earlier work this paper cites.
New proximal point algorithms for convex minimization
Güler, O · 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.
Enlargement of monotone operators with applications to variational inequalities
Burachik, R. S., Iusem, A. N., and Svaiter, B. F · 1997
Earlier work this paper cites.
Convergence rates in forward–backward splitting
Chen, G. H. and Rockafellar, R. T · 1997
Earlier work this paper cites.
Convergence of proximal-like algorithms
Teboulle, M · 1997
Earlier work this paper cites.
Dynamic noncooperative game theory , volume 23
Basar, T. and Olsder, G. J · 1999
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
Nemirovski, A · 2004
Earlier work this paper cites.
Finite-dimensional variational inequalities and complementarity problems
Facchinei, F. and Pang, J.-S · 2007
Cited alongside, same era.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
Beck, A. and Teboulle, M · 2009
Cited alongside, same era.
Robust optimization , volume 28
Ben-Tal, A., El Ghaoui, L., and Nemirovski, A · 2009
Cited alongside, same era.
Subgradient methods for saddle-point problems
Nedić, A. and Ozdaglar, A · 2009
Cited alongside, same era.
On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
Monteiro, R. D. and Svaiter, B. F · 2010
Cited alongside, same era.
Convex analysis and monotone operator theory in Hilbert spaces , volume 408
Bauschke, H. H., Combettes, P. L., et al · 2011
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
Later among the works it cites.
Non-uniform stochastic average gradient method for training conditional random fields
Schmidt, M., Babanezhad, R., Ahmed, M., Defazio, A., Clifton, A., and Sarkar, A · 2015
Later among the works it cites.
Wasserstein generative adversarial networks
Arjovsky, M., Chintala, S., and Bottou, L · 2017
Later among the works it cites.
Training gans with optimism
Daskalakis, C., Ilyas, A., Syrgkanis, V., and Zeng, H · 2018
Later among the works it cites.
A variational inequality perspective on generative adversarial nets
Gidel, G., Berard, H., Vincent, P., and Lacoste-Julien, S · 2018
Later among the works it cites.
A primal-dual algorithm for general convex-concave saddle point problems
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A first-order primal-dual algorithm for convex problems with applications to imaging
Chambolle, A. and Pock, T · 2011
Cited alongside, same era.
Online optimization with gradual variations
Chiang, C., Yang, T., Lee, C., Mahdavi, M., Lu, C., Jin, R., and Zhu, S · 2012
Cited alongside, same era.
PID design by convex-concave optimization
Hast, M., Astrom, K., Bernhardsson, B., and Boyd, S · 2013
Cited alongside, same era.
Introductory lectures on convex optimization: A basic course , volume 87
Nesterov, Y · 2013
Cited alongside, same era.
Online learning with predictable sequences
Rakhlin, A. and Sridharan, K · 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.
Hamedani, E. Y. and Aybat, N. S · 2018
Later among the works it cites.
A first-order primal-dual algorithm with linesearch
Malitsky, Y. and Pock, T · 2018
Later among the works it cites.
A forward-backward splitting method for monotone inclusions without cocoercivity
Malitsky, Y. and Tam, M. K · 2018
Later among the works it cites.
On the convergence and robustness of training gans with regularized optimal transport
Sanjabi, M., Ba, J., Razaviyayn, M., and Lee, J. D · 2018
Later among the works it cites.
Linear convergence of the primal-dual gradient method for convex-concave saddle point problems without strong convexity
Du, S. S. and Hu, W · 2019
Closest in time.
Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks
Liang, T. and Stokes, J · 2019
Closest in time.
A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach
Mokhtari, A., Ozdaglar, A., and Pattathil, S · 2020
Closest in time.