Related papers: Dual potentials for capacity constrained optimal t…
We consider an optimal transport problem on the unit simplex whose solutions are given by gradients of exponentially concave functions and prove two main results. First, we show that the optimal transport is the large deviation limit of a…
Given the single-letter capacity formula and the converse proof of a channel without constraints, we provide a simple approach to extend the results for the same channel but with constraints. The resulting capacity formula is the minimum of…
We introduce and study the class of linear transfers between probability distributions and the dual class of Kantorovich operators between function spaces. Linear transfers can be seen as an extension of convex lower semi-continuous…
We present generalized versions of Monge's and Kantorovich's optimal transport problems with the probabilities being transported replaced by lower probabilities. We show that, when the lower probabilities are the lower envelopes of…
Classic optimal transport theory is formulated through minimizing the expected transport cost between two given distributions. We propose the framework of distorted optimal transport by minimizing a distorted expected cost, which is the…
We present a primal--dual memory efficient algorithm for solving a relaxed version of the general transportation problem. Our approach approximates the original cost function with a differentiable one that is solved as a sequence of…
This paper is concerned with an optimization problem governed by the Kantorovich optimal transportation problem. This gives rise to a bilevel optimization problem, which can be reformulated as a mathematical problem with complementarity…
This note establishes a limiting formula for the conic Lagrangian dual of a convex infinite optimization problem, correcting the classical version of Karney [Math. Programming 27 (1983) 75-82] for convex semi-infinite programs. A…
We consider optimal transport problems where the cost for transporting a given probability measure $\mu_0$ to another one $\mu_1$ consists of two parts: the first one measures the transportation from $\mu_0$ to an intermediate (pivot)…
Let $M,N$ be two smooth compact hypersurfaces of $\mathbb{R}^n$ which bound strictly convex domains equipped with two absolutely continuous measures $\mu$ and $\nu$ (with respect to the volume measures of $M$ and $N$). We consider the…
Linear transfers between probability distributions were introduced in [5,6] in order to extend the theory of optimal mass transportation while preserving the important duality established by Kantorovich. It is shown here that $\{0,…
The basic problem of optimal transportation consists in minimizing the expected costs $\mathbb {E}[c(X_1,X_2)]$ by varying the joint distribution $(X_1,X_2)$ where the marginal distributions of the random variables $X_1$ and $X_2$ are…
Let $X,Y$ be two finite sets of points having $\#X = m$ and $\#Y = n$ points with $\mu = (1/m) \sum_{i=1}^{m} \delta_{x_i}$ and $\nu = (1/n) \sum_{j=1}^{n} \delta_{y_j}$ being the associated uniform probability measures. A result of…
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 present a new kind of Lagrangian duality theory for set-valued convex optimization problems whose objective and constraint maps are defined between preordered normed spaces. The theory is accomplished by introducing a new set-valued…
In this paper we present a new Lagrange dual problem associated to a primal DC optimization problem under the additivity condition (AC). As usual for DC programming, even weak duality is not guaranteed for free and, due to this issue, we…
In this note, we propose polynomial-time algorithms solving the Monge and Kantorovich formulations of the $\infty$-optimal transport problem in the discrete and finite setting. It is the first time, to the best of our knowledge, that…
We introduce graphs associated to transport problems between discrete marginals, that allow to characterize the set of all optimizers given one primal optimizer. In particular, we establish that connectivity of those graphs is a necessary…
We consider the problem of optimal transportation with quadratic cost between a empirical measure and a general target probability on R d , with d $\ge$ 1. We provide new results on the uniqueness and stability of the associated optimal…
These notes constitute a sort of Crash Course in Optimal Transport Theory. The different features of the problem of Monge-Kantorovitch are treated, starting from convex duality issues. The main properties of space of probability measures…