The decomposition of optimal transportation problems with convex cost
Stefano Bianchini, Mauro Bardelloni

TL;DR
This paper extends the decomposition results for optimal transportation problems with norm costs to convex cost functions, providing a detailed partition of space that facilitates the existence of optimal transport maps.
Contribution
It generalizes the Sudakov decomposition from norm costs to convex costs, establishing a partition of space with properties that ensure the existence of optimal transport maps.
Findings
Existence of a partition of space into cyclically connected sets.
Extension of regularity estimates to convex costs.
Proof of existence of optimal transport maps for convex costs.
Abstract
Given a positive l.s.c. convex function and an optimal transference plane for the transportation problem \begin{equation*} \int \mathtt c(x'-x) \pi(dxdx'), \end{equation*} we show how the results of \cite{biadan} on the existence of a \emph{Sudakov decomposition} for norm cost can be extended to this case. More precisely, we prove that there exists a partition of into a family of disjoint sets together with the projection on of proper extremal faces of , and , such that - is relatively open in its affine span, and has affine dimension ; \item has affine dimension …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Optimization and Mathematical Programming · Aerospace Engineering and Control Systems
