相关论文: The five gradients inequality for non quadratic co…

The branched transport problem, a popular recent variant of optimal transport, is a non-convex and non-smooth variational problem on Radon measures. The so-called urban planning problem, on the contrary, is a shape optimization problem that…

We consider the optimal transport problem between a set of $n$ red points and a set of $n$ blue points subject to a concave cost function such as $c(x,y) = \|x-y\|^{p}$ for $0< p < 1$. Our focus is on a particularly simple matching…

This note reviews the studies of the last decades emphasizing a common principle based on entropy, logarithmic Sobolev inequality and hypercontractivity, behind four most celebrated inequalities by M. Talagrand: the convex distance…

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…

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.

We study the notion of debiasability for cost functions arising in optimal transport. We call a symmetric cost function $c:\mathscr{X}\times\mathscr{X}\to\mathbb{R}\cup\{+\infty\}$ debiasable if it satisfies $c(x,y)\ge…

We revisit the duality theorem for multimarginal optimal transportation problems. In particular, we focus on the Coulomb cost. We use a discrete approximation to prove equality of the extremal values and some careful estimates of the…

In this note, we present a unified approach to the problem of existence of a potential for the optimal transport problem with respect to non-traditional cost functions, that is, costs that assume infinite values. We establish a new method…

We focus on Optimal Transport PDE on the unit sphere $\mathbb{S}^2$ with a particular type of cost function $c(x,y) = F(x \cdot y, x \cdot \hat{e}, y \cdot \hat{e})$ which we call cost functions with preferential direction, where $\hat{e}…

We present an iterative method to efficiently solve the optimal transportation problem for a class of strictly convex costs which includes quadratic and p-power costs. Given two probability measures supported on a discrete grid with n…

The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…

We investigate the computation of the gradient of the value function in parametric convex optimization problems. We derive general expression for the gradient of the value function in terms of the cost function, constraints and Lagrange…

A wide range of optimization problems can often be written in terms of generalized convex functions (GCFs). When this structure is present, it can convert certain nested bilevel objectives into single-level problems amenable to standard…

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…

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 present a simple proof of the entropy-power inequality using an optimal transportation argument which takes the form of a simple change of variables. The same argument yields a reverse inequality involving a conditional differential…

In this note, we introduce a class of indicators that enable to compute efficiently optimal transport plans associated to arbitrary distributions of $N$ demands and $N$ supplies in $\mathbf{R}$ in the case where the cost function is…

We are interested in the cost-convex potentials in optimal mass transport theory, and we show by direct and geometric arguments the equivalence between cost-subdifferentials and ordinary subdifferentials of cost-convex functions, under the…

We exhibit a surprising relationship between elliptic gradient systems of PDEs, multi-marginal Monge-Kantorovich optimal transport problem, and multivariable Hardy-Littlewood inequalities. We show that the notion of an orientable elliptic…

This article generalizes the study of ramified optimal transport with capacity constraint in transport multi-paths by generalizing the $\mathbf{M}_{\alpha}$ cost to $\mathbf{M}_{\alpha,c}$, which incorporates capacity constraints into the…