Fetching the paper…
Reading the bibliography…
In this paper we propose a general algorithmic framework for first-order methods in optimization in a broad sense, including minimization problems, saddle-point problems and variational inequalities.
On the translocation of masses
Leonid Kantorovich · 1942
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A.S. Nemirovsky and D.B. Yudin · 1983
Earlier work this paper cites.
Optimal methods of smooth convex minimization
A.S. Nemirovskii and Yu.E. Nesterov · 1985
Earlier work this paper cites.
Introduction to Optimization
Boris Polyak · 1987
Earlier work this paper cites.
On the scaling of multidimensional matrices
Joel Franklin and Jens Lorenz · 1989
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.
Practice aspects of moreau–yosida regularization: Theoretical preliminaries
Sagaztizabal C Lemarechal C · 1997
Earlier work this paper cites.
On auxiliary principle for equilibrium problems
G. Mastroeni · 2000
Earlier work this paper cites.
Convex Optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Prox-method with rate of convergence
Arkadi Nemirovski · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: a basic course
Yurii Nesterov · 2004
Earlier work this paper cites.
Cubic regularization of newton method and its global performance
Yurii Nesterov and Boris Polyak · 2006
Earlier work this paper cites.
Some algorithms for solving mixed variational inequalities
P. Q. Khanh T. Q. Bao · 2006
Earlier work this paper cites.
Gradient methods for minimizing composite functions
Yurii Nesterov · 2007
Earlier work this paper cites.
An optimal method for stochastic composite optimization
Guanghui Lan · 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.
Primal-dual subgradient methods for convex problems
Yurii Nesterov · 2009
Earlier work this paper cites.
Accuracy certificates for computational problems with convex structure
Arkadi Nemirovski, Shmuel Onn, and Uriel G Rothblum · 2010
Earlier work this paper cites.
A first-order primal-dual algorithm for convex problems with applications to imaging
Antonin Chambolle and Thomas Pock · 2011
Cited alongside, same era.
Consistent estimation of a population barycenter in the wasserstein space
Jérémie Bigot, Thierry Klein, et al · 2012
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Cited alongside, same era.
First-order methods with inexact oracle: the strongly convex case
Olivier Devolder, François Glineur, Yurii Nesterov, et al · 2013
Cited alongside, same era.
Revisiting frank-wolfe: Projection-free sparse convex optimization
Jaggi M · 2013
Cited alongside, same era.
Optimization with first-order surrogate functions
Julien Mairal · 2013
Cited alongside, same era.
Universal gradient methods for convex optimization problems
Yurii Nesterov · 2015
Later among the works it cites.
A descent lemma beyond lipschitz gradient continuity: first-order methods revisited and applications
Heinz H Bauschke, Jérôme Bolte, and Marc Teboulle · 2016
Later among the works it cites.
Near-linear time approxfimation algorithms for optimal transport via sinkhorn iteration
Jason Altschuler, Jonathan Weed, and Philippe Rigollet · 2017
Later among the works it cites.
Martin Arjovsky, Soumith Chintala, and Léon Bottou · 2017
Later among the works it cites.
Construction of non-asymptotic confidence sets in 2-Wasserstein space
Johannes Ebert, Vladimir Spokoiny, and Alexandra Suvorikova · 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…
First-order methods of smooth convex optimization with inexact oracle
Olivier Devolder, François Glineur, and Yurii Nesterov · 2014
Cited alongside, same era.
Proximal algorithms
Neal Parikh and Stephen Boyd · 2014
Cited alongside, same era.
Wasserstein propagation for semi-supervised learning
Justin Solomon, Raif M. Rustamov, Leonidas Guibas, and Adrian Butscher · 2014
Cited alongside, same era.
Efficient numerical methods to solve sparse linear equations with application to pagerank
Anton Anikin, Alexander Gasnikov, Alexander Gornov, Dmitry Kamzolov, Yury Maximov, and Yurii Nesterov · 2015
Cited alongside, same era.
On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
Amir Beck · 2015
Cited alongside, same era.
Lectures on Modern Convex Optimization (Lecture Notes)
Aaron Ben-Tal and Arkadi Nemirovski · 2015
Cited alongside, same era.
Alexander Gasnikov · 2017
Later among the works it cites.
Two-level iterative method for non-stationary mixed variational inequalities
R. A. Salahutdin I. V. Konnov · 2017
Later among the works it cites.
Existence and consistency of wasserstein barycenters
Thibaut Le Gouic and Jean-Michel Loubes · 2017
Later among the works it cites.
Non-smooth non-convex bregman minimization: Unification and new algorithms
Peter Ochs, Jalal Fadili, and Thomas Brox · 2017
Later among the works it cites.
Fast gradient descent method for convex optimization problems with an oracle that generates a
Alexander Tyurin and Alexander Gasnikov · 2017
Later among the works it cites.
Towards optimal running times for optimal transport
Jose Blanchet, Arun Jambulapati, Carson Kent, and Aaron Sidford · 2018
Later among the works it cites.
Relatively smooth convex optimization by first-order methods, and applications
Haihao Lu, Robert M Freund, and Yurii Nesterov · 2018
Later among the works it cites.
Complexity bounds for primal-dual methods minimizing the model of objective function
Yurii Nesterov · 2018
Later among the works it cites.
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
Yuyuan Ouyang and Yangyang Xu · 2018
Later among the works it cites.
A fast proximal point method for wasserstein distance
Yujia Xie, Xiangfeng Wang, Ruijia Wang, and Hongyuan Zha · 2018
Later among the works it cites.
On the complexity of approximating wasserstein barycenter
Alexey Kroshnin, Darina Dvinskikh, Pavel Dvurechensky, Alexander Gasnikov, Nazarii Tupitsa, and Cesar Uribe · 2019
Closest in time.
On efficient optimal transport: An analysis of greedy and accelerated mirror descent algorithms
Tianyi Lin, Nhat Ho, and Michael I Jordan · 2019
Closest in time.
Gradient methods for problems with inexact model of the objective
Fedor Stonyakin, Darina Dvinskikh, Pavel Dvurechensky, Alexey Kroshnin, Olesya Kuznetsova, Artem Agafonov, Alexander Gasnikov, Alexander Tyurin, Cesar Uribe, Dmitry Pasechnyuk, and Sergei Artamonov · 2019
Closest in time.
Some adaptive proximal method for a special class of abstract variational inequalities
Fedor S Stonyakin · 2019
Closest in time.