Optimal transportation for a quadratic cost with convex constraints and applications
Abstract
We prove existence of an optimal transport map in the Monge-Kantorovich problem associated to a cost c(x,y) which is not finite everywhere, but coincides with |x-y|2 if the displacement y-x belongs to a given convex set C and it is +∞ otherwise. The result is proven for C satisfying some technical assumptions allowing any convex body in 2 and any convex polyhedron in d, d>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 L∞ problems and, later on, with the Monge problem for arbitrary norms.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.