2000 character limit reached
The entropic regularization of the Monge problem on the real line (1703.10457v4)
Published 30 Mar 2017 in math.OC
Abstract: 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.