On Sudakov's type decomposition of transference plans with norm costs

From MaRDI portal
Publication:4645797

DOI10.1090/MEMO/1197zbMATH Open1454.49002arXiv1311.1918OpenAlexW1643365973MaRDI QIDQ4645797FDOQ4645797


Authors: Stefano Bianchini, Sara Daneri Edit this on Wikidata


Publication date: 11 January 2019

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

Abstract: We consider the original strategy proposed by Sudakov for solving the Monge transportation problem with norm cost |cdot|D [ min �igg{int |mathtt T(x) - x|_{D^*} dmu(x), mathtt T : mathbb R^d o mathbb R^d, u = mathtt T_# mu �igg}, ] with mu, u probability measures in mathbbRd and mu absolutely continuous w.r.t. mathcalLd. The key idea in this approach is to decompose (via disintegration of measures) the Kantorovich optimal transportation problem into a family of transportation problems in ZmathfrakaimesmathbbRd, where ZmathfrakamathfrakainmathfrakAsubsetmathbbRd are disjoint regions such that the construction of an optimal map mathttTmathfraka:ZmathfrakaomathbbRd is simpler than in the original problem, and then to obtain mathttT by piecing together the maps mathttTmathfraka. In this paper we show how the original idea of Sudakov can be successfully implemented. The results yield a complete characterization of the Kantorovich optimal transportation problem, whose straightforward corollary is the solution of the Monge problem in each set Zmathfraka and then in mathbbRd. The strategy is sufficiently powerful to be applied to other optimal transportation problems.


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




Recommendations




Cites Work


Cited In (9)





This page was built for publication: On Sudakov's type decomposition of transference plans with norm costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645797)