Simone Di Marino, Jean Louet
Published 2017-03-30Version 1
We study the entropic regularization of the optimal transport problem in dimension 1 when the cost function is the distance c(x, y) = |y -- x|. The selected plan at the limit is, among those which are optimal for the non-penalized problem, the most "diffuse" one on the zones where it may have a density.
HOT: An Efficient Halpern Accelerating Algorithm for Optimal Transport Problems
Polynomial-Time Solvers for the Discrete $\infty$-Optimal Transport Problems
Entropic regularization of continuous optimal transport problems
![QR code for arXiv:1703.10457 [math.OC]](http://oss.arxitics.com/images/favicon.svg)