We establish basic properties of a variant of the semi-discrete optimal transport problem in a relatively general setting. In this problem, one is given an absolutely continuous source measure and cost function, along with a finite set which will be the support of the target measure, and a “storage fee” function. The goal is to find a map for which the total transport cost plus the storage fee evaluated on the masses of the pushforward of the source measure is minimized. We prove existence and uniqueness for the problem, derive a dual problem for which strong duality holds, and give a characterization of dual maximizers and primal minimizers. Additionally, we find some stability results for minimizers and a Γ-convergence result as the target set becomes denser and denser in a continuum domain.
more »
« less
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
-
null (Ed.)Abstract We show quantitative stability results for the geometric “cells” arising in semi-discrete optimal transport problems. We first show stability of the associated Laguerre cells in measure, without any connectedness or regularity assumptions on the source measure. Next we show quantitative invertibility of the map taking dual variables to the measures of Laguerre cells, under a Poincarè-Wirtinger inequality. Combined with a regularity assumption equivalent to the Ma–Trudinger–Wang conditions of regularity in Monge-Ampère, this invertibility leads to stability of Laguerre cells in Hausdorff measure and also stability in the uniform norm of the dual potential functions, all stability results come with explicit quantitative bounds. Our methods utilize a combination of graph theory, convex geometry, and Monge-Ampère regularity theory.more » « less
