Related papers: Polynomial-Time Solvers for the Discrete $\infty$-…
In this work we present a numerical method for the Optimal Mass Transportation problem. Optimal Mass Transportation (OT) is an active research field in mathematics.It has recently led to significant theoretical results as well as…
We propose new variational principles for traffic assignment problems. So to find equillibrium we have to solve large-scale convex optimization problem of special type. We propose some kind of "algebra" on different models and corresponding…
We study the discretization, convergence, and numerical implementation of recent reformulations of the quadratic porous medium equation (multidimensional and anisotropic) and Burgers' equation (one-dimensional, with optional viscosity), as…
We propose an extension of the computational fluid mechanics approach to the Monge-Kantorovich mass transfer problem, which was developed by Benamou-Brenier. Our extension allows optimal transfer of unnormalized and unequal masses. We…
In this paper, we give a new characterization of the cut locus of a point on a compact Riemannian manifold as the zero set of the optimal transport density solution of the Monge-Kantorovich equations, a PDE formulation of the optimal…
We consider the entropic regularization of discretized optimal transport and propose to solve its optimality conditions via a logarithmic Newton iteration. We show a quadratic convergence rate and validate numerically that the method…
We consider the multidimensional Monge-Kantrovich transport problem in an abstract setting. Our main results state that if a cost function and marginal measures are invariant by a family of transformations, then a solution of the Kantrovich…
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…
The aim of this article is to show that the Monge-Kantorovich problem is the limit of a sequence of entropy minimization problems when a fluctuation parameter tends down to zero. We prove the convergence of the entropic values to the…
We propose two deep neural network-based methods for solving semi-martingale optimal transport problems. The first method is based on a relaxation/penalization of the terminal constraint, and is solved using deep neural networks. The second…
Optimal transportation problem seeks for a coupling $\pi$ of two probability measures $\mu$ and $\nu$ which minimize the total cost $\int c d\pi$, which is linear in $\pi$. In this paper, we introduce a variation of optimal transportation…
We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…
Adapted optimal transport (AOT) problems are optimal transport problems for distributions of a time series where couplings are constrained to have a temporal causal structure. In this paper, we develop computational tools for solving AOT…
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…
We consider probability measures on $\mathbb{R}^{\infty}$ and study optimal transportation mappings for the case of infinite Kantorovich distance. Our examples include 1) quasi-product measures, 2) measures with certain symmetric…
The martingale optimal transport aims to optimally transfer a probability measure to another along the class of martingales. This problem is mainly motivated by the robust superhedging of exotic derivatives in financial mathematics, which…
We introduce a Benamou-Brenier formulation for the continuous-time martingale optimal transport problem as a weak length relaxation of its discrete-time counterpart. By the correspondence between classical martingale problems and…
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 present a homotopic approach to solving challenging, optimization-based motion planning problems. The approach uses Homotopy Optimization, which, unlike standard continuation methods for solving homotopy problems, solves a sequence of…
Optimal transport has been used extensively in resource matching to promote the efficiency of resources usages by matching sources to targets. However, it requires a significant amount of computations and storage spaces for large-scale…