Related papers: Mass transportation with LQ cost functions
We investigate the minimum cost of a wide class of combinatorial optimization problems over random bipartite geometric graphs in $\mathbb{R}^d$ where the edge cost between two points is given by a $p$-th power of their Euclidean distance.…
In this paper we study a variant of the branched transportation problem, that we call multi-material transport problem. This is a transportation problem, where distinct commodities are transported simultaneously along a network. The cost of…
We develop an $\e$-regularity theory at the boundary for a general class of Monge-Amp\`ere type equations arising in optimal transportation. As a corollary we deduce that optimal transport maps between H\"older densities supported on $C^2$…
The traveling salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We characterize the optimal cycle for every convex and increasing…
Optimal transport has recently started to be successfully employed to define misfit or loss functions in inverse problems. However, it is a problem intrinsically defined for positive (probability) measures and therefore strategies are…
Optimal transport has become part of the standard quantitative economics toolbox. It is the framework of choice to describe models of matching with transfers, but beyond that, it allows to: extend quantile regression; identify discrete…
We establish several quantitative stability estimates for optimal transport maps between non-degenerate densities on uniformly convex domains for the quadratic cost. Under H\"older regularity assumptions, we prove Lipschitz $L^2$…
We give sufficient conditions on initial and target measures supported on the sphere $\S^n$ to ensure the solution to the optimal transport problem with the cost $|x-y|^2/2$ is a diffeomorphism.
This paper deals with a variant of the optimal transportation problem. Given f $\in$ L 1 (R d , [0, 1]) and a cost function c $\in$ C(R d x R d) of the form c(x, y) = k(y -- x), we minimise $\int$ c d$\gamma$ among transport plans $\gamma$…
We introduce a new variant of the weak optimal transport problem where mass is distributed from one space to the other through unnormalized kernels. We give sufficient conditions for primal attainment and prove a dual formula for this…
In this note, we extend the regularity theory for monotone measure-preserving maps, also known as optimal transports for the quadratic cost optimal transport problem, to the case when the support of the target measure is an arbitrary convex…
We study optimal transportation of measures on compact manifolds for costs defined from convex Lagrangians. We prove that optimal transportation can be interpolated by measured Lipschitz laminations, or geometric currents. The methods are…
This article details a general numerical framework to approximate so-lutions to linear programs related to optimal transport. The general idea is to introduce an entropic regularization of the initial linear program. This regularized…
We show that a certain entropy-like function is convex, under an optimal transport problem that is adapted to Ricci flow. We use this to reprove the monotonicity of Perelman's reduced volume.
In order to circumvent the difficulties in solving numerically the discrete optimal transport problem, in which one minimizes the linear target function $P\mapsto\langle C,P\rangle:=\sum_{i,j}C_{ij}P_{ij}$, Cuturi introduced a variant of…
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…
This paper investigates the optimal transport problem within the framework of Linear Quadratic optimal control systems. We establish the well-posedness of the Monge problem and analyze the regularity of the resulting optimal transport map,…
We consider an optimal transport problem with backward martingale constraint. The objective function is given by the scalar product of a pseudo-Euclidean space $S$. We show that the supremums over maps and plans coincide, provided that the…
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…
We study an entropic optimal transport problem in which the transport plan is penalized by a nonlinear convex functional acting on the coupling. We establish existence, uniqueness, and uniform a priori bounds for minimizers, and we show…