Fetching the paper…
Reading the bibliography…
In this paper we study the convex-concave saddle-point problem $\min_x \max_y f(x) + y^T \mathbf{A} x - g(y)$, where $f(x)$ and $g(y)$ are smooth and convex functions.
The extragradient method for finding saddle points and other problems
Korpelevich, G. M · 1976
Earlier work this paper cites.
A method for solving the convex programming problem with convergence rate o (1/kˆ 2)
Nesterov, Y. E · 1983
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course , volume 87
Nesterov, Y · 2003
Earlier work this paper cites.
Solving strongly monotone variational and quasi-variational inequalities
Nesterov, Y. and Scrimali, L · 2006
Earlier work this paper cites.
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H. and Combettes, P. L · 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.
Accelerated dual descent for network flow optimization
Zargham, M., Ribeiro, A., Ozdaglar, A., and Jadbabaie, A · 2013
Earlier work this paper cites.
Chebyshev acceleration of iterative refinement
Arioli, M. and Scott, J · 2014
Earlier work this paper cites.
Stochastic primal-dual coordinate method for regularized empirical risk minimization
Zhang, Y. and Lin, X · 2015
Earlier work this paper cites.
An introduction to continuous optimization for imaging
Chambolle, A. and Pock, T · 2016
Earlier work this paper cites.
Stochastic variance reduction methods for policy evaluation
Du, S. S., Chen, J., Li, L., Xiao, L., and Zhou, D · 2017
Earlier work this paper cites.
Doubly greedy primal-dual coordinate descent for sparse empirical risk minimization
Lei, Q., Yen, I. E.-H., Wu, C.-y., Dhillon, I. S., and Ravikumar, P · 2017
Earlier work this paper cites.
Achieving geometric convergence for distributed optimization over time-varying graphs
Nedic, A., Olshevsky, A., and Shi, W · 2017
Earlier work this paper cites.
Optimal algorithms for smooth and strongly convex distributed optimization in networks
Scaman, K., Bach, F., Bubeck, S., Lee, Y. T., and Massoulié, L · 2017
Cited alongside, same era.
Exploiting strong convexity from data with primal-dual first-order algorithms
Wang, J. and Xiao, L · 2017
Cited alongside, same era.
Training gans with optimism
Daskalakis, C., Ilyas, A., Syrgkanis, V., and Zeng, H · 2018
Cited alongside, same era.
A variational inequality perspective on generative adversarial networks
Gidel, G., Berard, H., Vignoud, G., Vincent, P., and Lacoste-Julien, S · 2018
Cited alongside, same era.
Sketching for large-scale learning of mixture models
Keriven, N., Bourrier, A., Gribonval, R., and Pérez, P · 2018
Cited alongside, same era.
Linear convergence of the primal-dual gradient method for convex-concave saddle point problems without strong convexity
Accelerating smooth games by manipulating spectral shapes
Azizian, W., Scieur, D., Mitliagkas, I., Lacoste-Julien, S., and Gidel, G · 2020
Later among the works it cites.
Relative lipschitzness in extragradient methods and a direct recipe for acceleration
Cohen, M. B., Sidford, A., and Tian, K · 2020
Later among the works it cites.
Linear lower bounds and conditioning of differentiable games
Ibrahim, A., Azizian, W., Gidel, G., and Mitliagkas, I · 2020
Later among the works it cites.
Optimal and practical algorithms for smooth and strongly convex decentralized optimization
Kovalev, D., Salim, A., and Richtárik, P · 2020
Later among the works it cites.
Optimal accelerated variance reduced extra and diging for strongly convex and smooth decentralized optimization
Li, H., Lin, Z., and Fang, Y · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Du, S. S. and Hu, W · 2019
Cited alongside, same era.
Negative momentum for improved game dynamics
Gidel, G., Hemmat, R. A., Pezeshki, M., Le Priol, R., Huang, G., Lacoste-Julien, S., and Mitliagkas, I · 2019
Cited alongside, same era.
Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks
Liang, T. and Stokes, J · 2019
Cited alongside, same era.
Computational optimal transport: With applications to data science
Peyré, G., Cuturi, M., et al · 2019
Cited alongside, same era.
Dscovr: Randomized primal-dual block coordinate algorithms for asynchronous distributed optimization
Xiao, L., Yu, A. W., Lin, Q., and Chen, W · 2019
Cited alongside, same era.
Accelerated methods for saddle-point problem
Alkousa, M., Gasnikov, A., Dvinskikh, D., Kovalev, D., and Stonyakin, F · 2020
Cited alongside, same era.
Ideal: Inexact decentralized accelerated augmented lagrangian method
Arjevani, Y., Bruna, J., Can, B., Gürbüzbalaban, M., Jegelka, S., and Lin, H · 2020
Cited alongside, same era.
Near-optimal algorithms for minimax optimization
Lin, T., Jin, C., and Jordan, M. I · 2020
Later among the works it cites.
Revisiting stochastic extragradient
Mishchenko, K., Kovalev, D., Shulgin, E., Richtárik, P., and Malitsky, Y · 2020
Later among the works it cites.
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
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.
Multi-consensus decentralized accelerated gradient descent
Ye, H., Luo, L., Zhou, Z., and Zhang, T · 2020
Later among the works it cites.
An optimal algorithm for strongly convex minimization under affine constraints
Salim, A., Condat, L., Kovalev, D., and Richtárik, P · 2021
Closest in time.
Dippa: An improved method for bilinear saddle point problems
Xie, G., Han, Y., and Zhang, Z · 2021
Closest in time.