English

Optimal transportation for a quadratic cost with convex constraints and applications

Optimization and Control 2011-10-17 v1

Abstract

We prove existence of an optimal transport map in the Monge-Kantorovich problem associated to a cost c(x,y)c(x,y) which is not finite everywhere, but coincides with xy2|x-y|^2 if the displacement yxy-x belongs to a given convex set CC and it is ++\infty otherwise. The result is proven for CC satisfying some technical assumptions allowing any convex body in R2\R^2 and any convex polyhedron in Rd\R^d, d>2d>2. The tools are inspired by the recent Champion-DePascale-Juutinen technique. Their idea, based on density points and avoiding disintegrations and dual formulations, allowed to deal with LL^\infty problems and, later on, with the Monge problem for arbitrary norms.

Keywords

Cite

@article{arxiv.1110.3237,
  title  = {Optimal transportation for a quadratic cost with convex constraints and applications},
  author = {Chloé Jimenez and Filippo Santambrogio},
  journal= {arXiv preprint arXiv:1110.3237},
  year   = {2011}
}