Fetching the paper…
Reading the bibliography…
We study a general convex optimization problem, which covers various classic problems in different areas and particularly includes many optimal transport related problems arising in recent years.
On approximate solutions of systems of linear inequalities
A.J. Hoffman · 1952
Earlier work this paper cites.
Proximité et dualité dans un espace Hilbertien
J.-J. Moreau · 1965
Earlier work this paper cites.
The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
L.M. Bregman · 1967
Earlier work this paper cites.
Information-type measures of difference of probability distributions and indirect observation
I. Csiszár · 1967
Earlier work this paper cites.
Régularisation d’inéquations variationnelles par approximations successives
B. Martinet · 1970
Earlier work this paper cites.
Convex Analysis
R.T. Rockafellar · 1970
Earlier work this paper cites.
Augmented Lagrangians and applications of the proximal point algorithm in convex programming
R.T. Rockafellar · 1976
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R.T. Rockafellar · 1976
Earlier work this paper cites.
An iterative row-action method for interval convex programming
Y. Censor and A. Lent · 1981
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate O ( 1 / k 2 ) O(1/k^{2})
Y. Nesterov · 1983
Earlier work this paper cites.
Introduction to optimization
B.T. Polyak · 1987
Earlier work this paper cites.
On an approach to the construction of optimal methods of minimization of smooth convex functions
Y. Nesterov · 1988
Earlier work this paper cites.
Multiplicative iterative algorithms for convex programming
P.P.B Eggermont · 1990
Earlier work this paper cites.
On the convergence of the proximal point algorithm for convex minimization
O. Güler · 1991
Earlier work this paper cites.
Proximal minimization algorithm with D D -functions
Y. Censor and S.A. Zenios · 1992
Earlier work this paper cites.
New proximal point algorithms for convex minimization
O. Güler · 1992
Earlier work this paper cites.
Entropic proximal mappings with applications to nonlinear programming
M. Teboulle · 1992
Earlier work this paper cites.
Convergence analysis of a proximal-like minimization algorithm using Bregman functions
G. Chen and M. Teboulle · 1993
Earlier work this paper cites.
Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming
J. Eckstein · 1993
Earlier work this paper cites.
Entropy-like proximal methods in convex programming
A.N. Iusem, B.F. Svaiter, and M. Teboulle · 1994
Earlier work this paper cites.
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
A. Auslender and M. Haddou · 1995
Earlier work this paper cites.
Convergence rate analysis of nonquadratic proximal methods for convex and linear programming
A.N. Iusem and M. Teboulle · 1995
Cited alongside, same era.
On the convergence of some iterative methods for convex minimization
B Lemaire · 1995
Cited alongside, same era.
Legendre functions and the method of random Bregman projections
H.H. Bauschke and J.M. Borwein · 1997
Cited alongside, same era.
Enlargement of monotone operators with applications to variational inequalities
R.S. Burachik, A.N. Iusem, and B.F. Svaiter · 1997
Cited alongside, same era.
Parallel Optimization: Theory, Algorithms, and Applications
Y. Censor and S.A. Zenios · 1997
Cited alongside, same era.
Proximal minimization methods with generalized Bregman functions
K.C. Kiwiel · 1997
Cited alongside, same era.
On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
R.D.C. Monteiro and B.F. Svaiter · 2010
Later among the works it cites.
Approximation accuracy, gradient methods, and error bound for structured convex optimization
P. Tseng · 2010
Later among the works it cites.
Primal-dual first-order methods with 𝒪 ( 1 / ϵ ) \mathcal{O}(1/\epsilon) iteration-complexity for cone programming
G. Lan, Z. Lu, and R.D.C. Monteiro · 2011
Later among the works it cites.
Convergence rates of inexact proximal-gradient methods for convex optimization
M. Schmidt, N. Roux, and F. Bach · 2011
Later among the works it cites.
An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
R.D.C. Monteiro and B.F. Svaiter · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Convergence of proximal-like algorithms
M. Teboulle · 1997
Cited alongside, same era.
Approximate iterations in Bregman-function-based proximal algorithms
J. Eckstein · 1998
Cited alongside, same era.
Variational Analysis
R.T. Rockafellar and R.J-B. Wets · 1998
Cited alongside, same era.
A hybrid approximate extragradient – proximal point algorithm using the enlargement of a maximal monotone operator
M.V. Solodov and B.F. Svaiter · 1999
Cited alongside, same era.
A hybrid projection-proximal point algorithm
M.V. Solodov and B.F. Svaiter · 1999
Cited alongside, same era.
Error bounds for proximal point subproblems and associated inexact proximal point algorithms
M.V. Solodov and B.F. Svaiter · 2000
Cited alongside, same era.
Accelerated and inexact forward-backward algorithms
S. Villa, S. Salzo, L. Baldassarre, and A. Verri · 2013
Later among the works it cites.
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
J. Altschuler, J. Weed, and P. Rigollet · 2017
Later among the works it cites.
A descent lemma beyond Lipschitz gradient continuity: First-order methods revisited and applications
H.H. Bauschke, J. Bolte, and M. Teboulle · 2017
Later among the works it cites.
Catalyst acceleration for first-order convex optimization: from theory to practice
H. Lin, J. Mairal, and Z. Harchaoui · 2017
Later among the works it cites.
First order methods beyond convexity and lipschitz gradient continuity with applications to quadratic inverse problems
J. Bolte, S. Sabach, M. Teboulle, and Y. Vaisbourd · 2018
Later among the works it cites.
Gurobi Optimizer Reference Manual, 2018
Inc. Gurobi Optimization · 2018
Later among the works it cites.
Relatively smooth convex optimization by first-order methods, and applications
H. Lu, R.M. Freund, and Y. Nesterov · 2018
Later among the works it cites.
A simplified view of first order methods for optimization
M. Teboulle · 2018
Later among the works it cites.
Computational optimal transport
G. Peyré and M. Cuturi · 2019
Later among the works it cites.
H. Chu, L. Liang, K.-C. Toh, and L. Yang · 2020
Later among the works it cites.
On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
X. Li, D.F. Sun, and K.-C. Toh · 2020
Later among the works it cites.
A fast proximal point method for computing exact Wasserstein distance
Y. Xie, X. Wang, R. Wang, and H. Zha · 2020
Later among the works it cites.
Bregman augmented Lagrangian and its acceleration
S. Yan and N. He · 2020
Later among the works it cites.
Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
F. Hanzely, P. Richtárik, and L. Xiao · 2021
Closest in time.
Perturbed Fenchel duality and first-order methods
D.H. Gutman and J.F. Peña · 2022
Closest in time.