A strategy for non-strictly convex transport costs and the example of \(\|x-y\|^p\) in \(\mathbb R^2\)

DOI10.4310/CMS.2010.v8.n4.a8zbMath1226.49039arXiv0909.2804OpenAlexW2101859292WikidataQ103924795 ScholiaQ103924795MaRDI QIDQ622313

Filippo Santambrogio, Luigi De Pascale, Guillaume Carlier

Publication date: 31 January 2011

Published in: Communications in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.2804

zbMATH Keywords

optimal transportMonge-Kantorovich problemexistence of optimal mapsgeneral norms

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20) Methods involving semicontinuity and convergence; relaxation (49J45) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)

Related Items (6)

The directional optimal transport ⋮ The optimal mass transport problem for relativistic costs ⋮ Optimal transportation for a quadratic cost with convex constraints and applications ⋮ On one-dimensionality of metric measure spaces ⋮ On Sudakov’s type decomposition of transference plans with norm costs ⋮ Optimal transportation in \(\mathbb R^n\) for a distance cost with a convex constraint

This page was built for publication: A strategy for non-strictly convex transport costs and the example of \(\|x-y\|^p\) in \(\mathbb R^2\)