Fetching the paper…
Reading the bibliography…
We consider the problem of computing a Wasserstein barycenter for a set of discrete probability distributions with finite supports, which finds many applications in areas such as statistics, machine learning and image processing.
Convex Analysis
R. T. Rockafellar · 1970
Earlier work this paper cites.
Sur l’approximation, par éléments finis d’ordre un, et la résolution, par pénalisation-dualité, d’une classe de problèmes de Dirichlet non linéaires
R. Glowinski and A. Marroco · 1975
Earlier work this paper cites.
A dual algorithm for the solution of nonlinear variational problems via finite element approximations
D. Gabay and B. Mercier · 1976
Earlier work this paper cites.
Some continuity properties of polyhedral multifunctions
S. M. Robinson · 1981
Earlier work this paper cites.
A convexity principle for interacting gases
R.J. McCann · 1997
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner · 1998
Earlier work this paper cites.
Variational Analysis
R. T. Rockafellar and R. J-B. Wets · 1998
Earlier work this paper cites.
Nonlinear Optimization
A. Ruszczyński · 2006
Earlier work this paper cites.
Real-time computerized annotation of pictures
J. Li and J. Z. Wang · 2008
Earlier work this paper cites.
Optimal Transport: Old and New , volume 338
Cédric Villani · 2008
Earlier work this paper cites.
Barycenters in the Wasserstein space
M. Agueh and G. Carlier · 2011
Earlier work this paper cites.
Convex Analysis and Monotone Operator Theory in Hilbert Spaces , volume 408
H. H. Bauschke and P. L. Combettes · 2011
Earlier work this paper cites.
Wasserstein barycenter and its application to texture mixing
J. Rabin, G. Peyré, J. Delon, and M. Bernot · 2011
Earlier work this paper cites.
Alternating direction method with Gaussian back substitution for separable convex programming
B. He, M. Tao, and X. Yuan · 2012
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
M. Cuturi · 2013
Earlier work this paper cites.
Hankel matrix rank minimization with applications to system identification and realization
M. Fazel, T. K. Pong, D. F. Sun, and P. Tseng · 2013
Earlier work this paper cites.
Fast computation of Wasserstein barycenters
M. Cuturi and A. Doucet · 2014
Earlier work this paper cites.
Combinatorics and geometry of transportation polytopes: An update
J. A. De Loera and E. D. Kim · 2014
Cited alongside, same era.
Bregman alternating direction method of multipliers
H. Wang and A. Banerjee · 2014
Cited alongside, same era.
Scaling up discrete distribution clustering using ADMM
J. Ye and J. Li · 2014
Cited alongside, same era.
Iterative Bregman projections for regularized transportation problems
J.-D. Benamou, G. Carlier, M. Cuturi, L. Nenna, and G. Peyré · 2015
Cited alongside, same era.
Numerical methods for matching for teams and Wasserstein barycenters
G. Carlier, A. Oberman, and E. Oudet · 2015
Cited alongside, same era.
A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block
M. Li, D. F. Sun, and K.-C. Toh · 2015
Cited alongside, same era.
Characterization of barycenters in the Wasserstein space by averaging optimal transport maps
J. Bigot and T. Klein · 2018
Closest in time.
Stochastic Wasserstein barycenters
S. Claici, E. Chien, and J. Solomon · 2018
Closest in time.
Regularized optimal transport and the rot mover’s distance
A. Dessein, N. Papadakis, and J.-L. Rouas · 2018
Closest in time.
Quadratically regularized optimal transport on graphs
M. Essid and J. Solomon · 2018
Closest in time.
Gurobi Optimizer Reference Manual, 2018
Inc. Gurobi Optimization · 2018
Closest in time.
Linear rate convergence of the alternating direction method of multipliers for convex composite programming
D. Han, D. F. Sun, and L. Zhang · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
An efficient linear programming method for optimal transportation
A.M. Oberman and Y. Ruan · 2015
Cited alongside, same era.
Convolutional Wasserstein distances: Efficient optimal transportation on geometric domains
J. Solomon, F. De Goes, G. Peyré, M. Cuturi, A. Butscher, A. Nguyen, T. Du, and L. Guibas · 2015
Cited alongside, same era.
A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
D. F. Sun, K.-C. Toh, and L. Yang · 2015
Cited alongside, same era.
Discrete Wasserstein barycenters: Optimal transport for discrete data
E. Anderes, S. Borgwardt, and J. Miller · 2016
Cited alongside, same era.
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
C. Chen, B. He, Y. Ye, and X. Yuan · 2016
Cited alongside, same era.
Fast projection onto the simplex and the ℓ 1 \ell_{1} ball
L. Condat · 2016
Cited alongside, same era.
Fast algorithms for large scale generalized distance weighted discrimination
X. Y. Lam, J. S. Marron, D. F. Sun, and K.-C. Toh · 2018
Closest in time.
QSDPNAL: A two-phase augmented lagrangian method for convex quadratic semidefinite programming
X. Li, D. F. Sun, and K.-C. Toh · 2018
Closest in time.
Wasserstein dictionary learning: Optimal transport-based unsupervised nonlinear dictionary learning
M.A. Schmitz, M. Heitz, N. Bonneel, F. Ngole, D. Coeurjolly, M. Cuturi, G. Peyré, and J.-L. Starck · 2018
Closest in time.
Distributed computation of Wasserstein barycenters over networks
C. A. Uribe, D. Dvinskikh, P. Dvurechensky, A. Gasnikov, and A. Nedić · 2018
Closest in time.
On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
L. Chen, X. Li, D. F. Sun, and K.-C. Toh · 2019
Closest in time.
Computational optimal transport
G. Peyré and M. Cuturi · 2019
Closest in time.
Stabilized sparse scaling algorithms for entropy regularized transport problems
B. Schmitzer · 2019
Closest in time.
An LP-based, strongly polynomial 2-approximation algorithm for sparse Wasserstein barycenters
S. Borgwardt · 2020
Closest in time.
Improved linear programs for discrete barycenters
S. Borgwardt and S. Patterson · 2020
Closest in time.
A fast proximal point method for computing exact Wasserstein distance
Y. Xie, X. Wang, R. Wang, and H. Zha · 2020
Closest in time.