[. References and . Altschuler, Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration, 2015.

, Iterative Bregman projections for regularized transportation problems, SIAM Journal on Scientific Computing, vol.37, issue.2, pp.1111-1138

L. M. Bregman, The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming, USSR computational mathematics and mathematical physics, vol.7, issue.3, pp.200-217, 1967.

L. Chizat, Unbalanced optimal transport: models, numerical methods, applications, 2017.
URL : https://hal.archives-ouvertes.fr/tel-01881166

[. Chizat, Introductionà l'analyse numérique matricielle età l'optimisation, 1982.

M. Cuturi-;-cuturi, Sinkhorn distances: Lightspeed computation of optimal transport, Advances in Neural Information Processing Systems (NIPS'13), pp.2292-2300, 2013.

. Dessein, Regularized Optimal Transport and the Rot Mover's Distance, 2016.

[. Frogner, Learning with a Wasserstein Loss. ArXiv e-prints, 2015.

[. Ghadimi, On the optimization of the classical iterative schemes for the solution of complex singular linear systems, SIAM Journal on Algebraic Discrete Methods, vol.6, issue.4, pp.555-566, 1985.

P. A. Knight, The Sinkhorn-Knopp algorithm: convergence and applications, SIAM Journal on Matrix Analysis and Applications, vol.30, issue.1, pp.261-275, 2008.

. Montavon, Wasserstein training of restricted boltzmann machines, Advances in Neural Information Processing Systems, vol.29, pp.3718-3726, 2016.

P. Ochs-;-ochs, Local Convergence of the Heavy-ball Method and iPiano for Nonconvex Optimization, 2016.

[. Peyré, Quantum optimal transport for tensor field processing, 2016.

B. Polyak-;-polyak, Some methods of speeding up the convergence of iteration methods, USSR Computational Mathematics and Mathematical Physics, vol.4, issue.5, pp.1-17, 1964.

J. Rabin and N. Papadakis, Non-convex relaxation of optimal transport for color transfer between images, NIPS Workshop on Optimal Transport for Machine Learning (OTML'14), 2014.
URL : https://hal.archives-ouvertes.fr/hal-01689687

[. Rolet, Fast dictionary learning with a smoothed Wasserstein loss, International Conference on Artificial Intelligence and Statistics (AISTATS), volume 51 of JMLR Workshop and Conference Proceedings, pp.630-638, 2016.

[. Rubner, The Earth Mover's Distance as a metric for image retrieval, International Journal of Computer Vision, vol.40, issue.2, pp.99-121, 2000.

. Schmitz, Wasserstein Dictionary Learning: Optimal Transport-based unsupervised non-linear dictionary learning, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01717943

C. Seguy, V. Seguy, and M. Cuturi, Principal geodesic analysis for probability measures under the optimal transport metric, Advances in Neural Information Processing Systems, pp.3312-3320, 2015.

R. Sinkhorn, A relationship between arbitrary positive matrices and doubly stochastic matrices. The annals of mathematical statistics, vol.35, pp.876-879, 1964.

. Solomon, Convolutional Wasserstein distances: Efficient optimal transportation on geometric domains, ACM Transactions on Graphics, vol.34, issue.4, p.11, 2015.

D. M. Young, S. K. Zavriev, and F. V. Kostyuk, Heavy-ball method in nonconvex optimization problems, Computational Mathematics and Modeling, vol.4, issue.4, pp.336-341, 1993.