On Sudakov's type decomposition of transference plans with norm costs
From MaRDI portal
Publication:4645797
Abstract: We consider the original strategy proposed by Sudakov for solving the Monge transportation problem with norm cost [ 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 , probability measures in and absolutely continuous w.r.t. . 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 , where are disjoint regions such that the construction of an optimal map is simpler than in the original problem, and then to obtain by piecing together the maps . 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 and then in . The strategy is sufficiently powerful to be applied to other optimal transportation problems.
Recommendations
Cites work
- scientific article; zbMATH DE number 5501715 (Why is no real title available?)
- scientific article; zbMATH DE number 3636997 (Why is no real title available?)
- scientific article; zbMATH DE number 1166155 (Why is no real title available?)
- scientific article; zbMATH DE number 1975241 (Why is no real title available?)
- scientific article; zbMATH DE number 1984440 (Why is no real title available?)
- scientific article; zbMATH DE number 1444745 (Why is no real title available?)
- A proof of Monge problem in \(\mathbb{R}^n\) by stability
- A proof of Sudakov theorem with strictly convex norms
- A strategy for non-strictly convex transport costs and the example of \(\|x-y\|^p\) in \(\mathbb R^2\)
- An Estimate on the Flow Generated by Monotone Operators
- Constructing optimal maps for Monge's transport problem as a limit of strictly convex costs
- Duality theorems for marginal problems
- Existence of optimal transport maps for crystalline norms
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Measure theory. Vol. 3. Measure algebras
- On the Euler-Lagrange equation for a variational problem: The general case. II
- On the Monge mass transfer problem
- On the Validity of the Maximum Principle and of the Euler--Lagrange Equation for a Minimum Problem Depending on the Gradient
- On the extremality, uniqueness and optimality of transference plans
- Optimal Transport
- Optimal and better transport plans
- Optimal transportation for a quadratic cost with convex constraints and applications
- Polar factorization and monotone rearrangement of vector‐valued functions
- The Monge problem for strictly convex norms in \(\mathbb R^d\)
- The Monge problem in R^d
- The disintegration of the Lebesgue measure on the faces of a convex function
Cited in
(9)- Optimal transport of vector measures
- General construction and classes of explicit \(L^1\)-optimal couplings
- Exact periodic stripes for minimizers of a local/nonlocal interaction functional in general dimension
- A characterization for solutions of the Monge-Kantorovich mass transport problem
- Existence and uniqueness of optimal transport maps obtained by the secondary variational method
- On the structure of weak solutions to scalar conservation laws with finite entropy production
- On the equality of values in the Monge and Kantorovich problems
- Rectifiability of entropy defect measures in a micromagnetics model
- The decomposition of optimal transportation problems with convex cost
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)