Related papers: Geometric linearisation for optimal transport with…
This paper settles the existence question for a rather general class of convex optimal design problems with a volume constraint. In low dimensions, we prove the existence of an optimal configuration for general convex minimization problems…
We consider maps $T$ solving the optimal transport problem with a cost $c(x-y)$ modeled on the $p$-cost. For H\"older continuous marginals, we prove a $C^{1,\alpha}$-partial regularity result for $T $in the set $\{|T(x)-x|>0\}$.
We consider so-called branched transport and variants thereof in two space dimensions. In these models one seeks an optimal transportation network for a given mass transportation task. In two space dimensions, they are closely connected to…
Three results in p-convex geometry are established. First is the analogue of the Levi problem in several complex variables, namely: local p-convexity implies global p-convexity. The second asserts that the support of a minimal p-dimensional…
We investigate finding a map $g$ within a function class $G$ that minimises an Optimal Transport (OT) cost between a target measure $\nu$ and the image by $g$ of a source measure $\mu$. This is relevant when an OT map from $\mu$ to $\nu$…
This paper focuses on martingale optimal transport problems when the martingales are assumed to have bounded quadratic variation. First, we give a result that characterizes the existence of a probability measure satisfying some convex…
In this work, we study the well-posedness of certain sparse regularized linear regression problems, i.e., the existence, uniqueness and continuity of the solution map with respect to the data. We focus on regularization functions that are…
We study a generalization of the multi-marginal optimal transport problem, which has no fixed number of marginals $N$ and is inspired of statistical mechanics. It consists in optimizing a linear combination of the costs for all the possible…
We consider the $L^\infty$-optimal mass transportation problem \[ \min_{\Pi(\mu, \nu)} \gamma-\mathrm{ess\,sup\,} c(x,y), \] for a new class of costs $c(x,y)$ for which we introduce a tentative notion of twist condition. In particular we…
We prove that if $\Omega\subset \mathbb{R}^{n+1}$ is a (not necessarily strictly) convex, $C^1$ domain, and $\mu$ and $\bar{\mu}$ are probability measures absolutely continuous with respect to surface measure on $\partial \Omega$, with…
We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…
The inverse optimal transport problem is to find the underlying cost function from the knowledge of optimal transport plans. While this amounts to solving a linear inverse problem, in this work we will be concerned with the nonlinear…
In its most general form, the optimal transport problem is an infinite-dimensional optimization problem, yet certain notable instances admit closed-form solutions. We identify the common source of this tractability as \textit{symmetry} and…
A probabilistic method for solving the Monge-Kantorovich mass transport problem on $R^d$ is introduced. A system of empirical measures of independent particles is built in such a way that it obeys a doubly indexed large deviation principle…
In this paper, we introduce methods from convex optimization to solve the multimarginal transport type problems arise in the context of density functional theory. Convex relaxations are used to provide outer approximation to the set of…
We propose a general convex optimization problem for computing regularized geodesic distances. We show that under mild conditions on the regularizer the problem is well posed. We propose three different regularizers and provide analytical…
The discretization of optimal transport problems often leads to large linear programs with sparse solutions. We derive error estimates for the approximation of the problem using convex combinations of Dirac measures and devise an active-set…
We provide a framework to approximate the 2-Wasserstein distance and the optimal transport map, amenable to efficient training as well as statistical and geometric analysis. With the quadratic cost and considering the Kantorovich dual form…
This article introduces a representation of dynamic meshes, adapted to some numerical simulations that require controlling the volume of objects with free boundaries, such as incompressible fluid simulation, some astrophysical simulations…
The Gromov--Wasserstein problem is a non-convex optimization problem over the polytope of transportation plans between two probability measures supported on two spaces, each equipped with a cost function evaluating similarities between…