Related papers: Homogeneous optimal transport maps between oblique…
The optimal transport problem with quadratic regularization is useful when sparse couplings are desired. The density of the optimal coupling is described by two functions called potentials; equivalently, potentials can be defined as a…
We consider a class of convex optimization problems modelling temporal mass transport and mass change between two given mass distributions (the so-called dynamic formulation of unbalanced transport), where we focus on those models for which…
What is the optimal way to deform a projective hypersurface into another one? In this paper we will answer this question adopting the point of view of measure theory, introducing the optimal transport problem between complex algebraic…
We show that a class of Poincar\'e-Wirtinger inequalities on bounded convex sets can be obtained by means of the dynamical formulation of Optimal Transport. This is a consequence of a more general result valid for convex sets, possibly…
We disprove a conjecture in Density Functional Theory, relative to multimarginal optimal transport maps with Coulomb cost. We also provide examples of maps satisfying optimality conditions for special classes of data.
This paper shows that the semi-dual formulation of the optimal transport problem has a degenerate saddle-point structure, and that its numerical solution is equivalent to solving a constrained optimization problem. We derive necessary and…
A key inequality which underpins the regularity theory of optimal transport for costs satisfying the Ma--Trudinger--Wang condition is the Pogorelov second derivative bound. This translates to an apriori interior $C^1$ estimate for smooth…
We consider the Monge problem of optimal transport between a compactly supported source measure and a target probability measure with unbounded support. We consider the convergence of optimal maps and potential functions when the target…
Estimating optimal transport (OT) maps (a.k.a. Monge maps) between two measures $P$ and $Q$ is a problem fraught with computational and statistical challenges. A promising approach lies in using the dual potential functions obtained when…
We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear…
We study the entropic regularization of the optimal transport problem in dimension 1 when the cost function is the distance c(x, y) = |y -- x|. The selected plan at the limit is, among those which are optimal for the non-penalized problem,…
Regularising the primal formulation of optimal transport (OT) with a strictly convex term leads to enhanced numerical complexity and a denser transport plan. Many formulations impose a global constraint on the transport plan, for instance…
We characterise equality cases in matrix H\"older's inequality and develop a divergence formulation of optimal transport of vector measures. As an application, we reprove the representation formula for measures in the polar cone to monotone…
Up-to-date information wirelessly communicated among vehicles can be used to select the optimal route between a given origin and destination. To elucidate how to make use of such information, simulations are performed for autonomous…
We consider linear problems in the worst case setting. That is, given a linear operator and a pool of admissible linear measurements, we want to approximate the values of the operator uniformly on a convex and balanced set by means of…
We consider an optimal transport problem between laws of random probability measures: given a base cost function, we build the associated OT cost between probability measures that in turn we use to define the OT cost between probability…
It is well-known that the optimal transport problem on the real line for the classical distance cost may not have a unique solution. In this paper we recover uniqueness by considering the transport problems where the costs are a power…
We study the Lagrangian formulation of a class of the Monge-Kantorovich optimal transportation problem. It can be considered a stochastic optimal transportation problem for absolutely continuous stochastic processes. A cost function and…
This paper studies optimal spatial layout of transshipment facilities and the corresponding service regions on an infinite homogeneous plane $\mathbb{R}^2$ that minimize the total cost for facility set-up, outbound delivery and inbound…
In this short note, we consider the problem of prescribing the Gauss curvature and image of the Gauss map for the graph of a function over a domain in Euclidean space. The prescription of the image of the Gauss map turns this into a second…