Optimal transportation for a quadratic cost with convex constraints and applications

Details Optimal transportation for a quadratic cost with convex constraints and applications Optimal transportation for a quadratic cost with convex constraints and applications

2011-10-14

arxiv.org/abs/1110.3237v1

Mathematics

Optimization and Control

Scientific paper

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 $+\infty$ otherwise. The result is proven for $C$ satisfying some technical assumptions allowing any convex body in $\R^2$ and any convex polyhedron in $\R^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^\infty$ problems and, later on, with the Monge problem for arbitrary norms.

Affiliated with

Also associated with

No associations

Rating

Optimal transportation for a quadratic cost with convex constraints and applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal transportation for a quadratic cost with convex constraints and applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal transportation for a quadratic cost with convex constraints and applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-523433