Fetching the paper…
Reading the bibliography…
We introduce a class of specially structured linear programming (LP) problems, which has favorable modeling capability for important application problems in different areas such as optimal transport, discrete tomography and economics.
On approximate solutions of systems of linear inequalities
A.J. Hoffman · 1952
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.
Diagonal equivalence to matrices with prescribed row and column sums
R. Sinkhorn · 1967
Earlier work this paper cites.
Convex Analysis
R. T. Rockafellar · 1970
Earlier work this paper cites.
An effective subgradient procedure for minimal cost multicommodity flow problems
J. Kennington and M. Shalaby · 1977
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.
An algorithm for restricted least squares regression
R.L. Dykstra · 1983
Earlier work this paper cites.
The problem of mass transfer in a topological space and probability measures with given marginal measures on the product of two spaces
V.L. Levin · 1984
Earlier work this paper cites.
Introduction to optimization
B. T. Polyak · 1987
Earlier work this paper cites.
Multiplicative iterative algorithms for convex programming
P.P.B Eggermont · 1990
Earlier work this paper cites.
Proximal minimization algorithm with D D -functions
Y. Censor and S.A. Zenios · 1992
Earlier work this paper cites.
On the convergence of the coordinate descent method for convex differentiable minimization
Z.-Q. Luo and P. Tseng · 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.
On the convergence rate of dual ascent methods for linearly constrained convex minimization
Z.-Q. Luo and P. Tseng · 1993
Cited alongside, same era.
Massively parallel proximal algorithms for solving linear stochastic network programs
S. S Nielsen and S. A Zenios · 1993
Cited alongside, same era.
Dual coordinate ascent methods for non-strictly convex minimization
P. Tseng · 1993
Cited alongside, same era.
Entropy-like proximal methods in convex programming
A.N. Iusem, B.F. Svaiter, and M. Teboulle · 1994
Cited alongside, same era.
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
A. Auslender and M. Haddou · 1995
Cited alongside, same era.
Convergence rate analysis of nonquadratic proximal methods for convex and linear programming
Binary tomography by iterating linear programs
S. Weber, C. Schnörr, T. Schüle, and J. Hornegger · 2006
Later among the works it cites.
Sinkhorn distances: Lightspeed computation of optimal transport
M. Cuturi · 2013
Later among the works it cites.
Insights into capacity-constrained optimal transport
J. Korman and R.J. McCann · 2013
Later among the works it cites.
Iterative Bregman projections for regularized transportation problems
J.-D. Benamou, G. Carlier, M. Cuturi, L. Nenna, and G. Peyré · 2015
Later among the works it cites.
Optimal transportation with capacity constraints
J. Korman and R.J. McCann · 2015
Later among the works it cites.
Tomographic reconstruction from a few views: A multi-marginal optimal transport approach
I. Abraham, R. Abraham, M. Bergounioux, and G. Carlier · 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…
A.N. Iusem and M. Teboulle · 1995
Cited alongside, same era.
Solving multistage stochastic network programs on massively parallel computers
S. S Nielsen and S. A Zenios · 1996
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.
Introduction to Linear Optimization
D. Bertsimas and J.N. Tsitsiklis · 1997
Cited alongside, same era.
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.
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.
Bayesian methodology for systemic risk assessment in financial networks
A. Grandy and L. Veraart · 2017
Later among the works it cites.
Dykstra’s algorithm, ADMM, and coordinate descent: Connections, insights, and extensions
R.J. Tibshirani · 2017
Later among the works it cites.
Variational methods for tomographic reconstruction with few views
M. Bergounioux, I. Abraham, R. Abraham, G. Carlier, E. Le Pennec, and E. Trélat · 2018
Later among the works it cites.
Disaggregating input-output tables by the multidimensional RAS method
V. Holy and K. Safr · 2019
Later among the works it cites.
Computational optimal transport
G. Peyré and M. Cuturi · 2019
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
Closest in time.
On the complexity of approximating multimarginal optimal transport
T. Lin, N. Ho, M. Cuturi, and M.I. Jordan · 2022
Closest in time.