Article contents
Two dimensional optimal transportation problem for a distance cost with a convex constraint∗
Published online by Cambridge University Press: 04 July 2013
Abstract
We first prove existence and uniqueness of optimal transportation maps for the Monge’s problem associated to a cost function with a strictly convex constraint in the Euclidean plane ℝ2. The cost function coincides with the Euclidean distance if the displacement y − x belongs to a given strictly convex set, and it is infinite otherwise. Secondly, we give a sufficient condition for existence and uniqueness of optimal transportation maps for the original Monge’s problem in ℝ2. Finally, we get existence of optimal transportation maps for a cost function with a convex constraint, i.e. y − x belongs to a given convex set with at most countable flat parts.
- Type
- Research Article
- Information
- ESAIM: Control, Optimisation and Calculus of Variations , Volume 19 , Issue 4 , October 2013 , pp. 1064 - 1075
- Copyright
- © EDP Sciences, SMAI, 2013
References
- 5
- Cited by