Related papers: A Numerical Method to solve Optimal Transport Prob…
In this article, two methods for solving mean-field type optimal control problems are proposed and investigated. The two methods are iterative methods: at each iteration, a Hamilton-Jacobi-Bellman equation is solved, for a terminal…
We construct Two-Point Flux Approximation (TPFA) finite volume schemes to solve the quadratic optimal transport problem in its dynamic form, namely the problem originally introduced by Benamou and Brenier. We show numerically that these…
This study investigates numerical methods to solve nonlinear transport problems characterized by various sorption isotherms with a focus on the Freundlich type of isotherms. We describe and compare second order accurate numerical schemes,…
An interval transportation problem represents a model for a transportation problem in which the values of supply, demand, and transportation costs are affected by uncertainty and can vary independently within given interval ranges. One of…
Numerical methods for the optimal transport problem is an active area of research. Recent work of Kitagawa and Abedin shows that the solution of a time-dependent equation converges exponentially fast as time goes to infinity to the solution…
In this series of lectures we introduce the Monge-Kantorovich problem of optimally transporting one distribution of mass onto another, where optimality is measured against a cost function c(x,y). Connections to geometry, inequalities, and…
The quadratically regularized optimal transport problem has recently been considered in various applications where the coupling needs to be \emph{sparse}, i.e., the density of the coupling needs to be zero for a large subset of the product…
Optimal transport has been one of the most exciting subjects in mathematics, starting from the 18th century. As a powerful tool to transport between two probability measures, optimal transport methods have been reinvigorated nowadays in a…
We present a self-contained analysis of a particular family of metrics over the set of non-negative integers. We show that these metrics, which are defined through a nested sequence of optimal transport problems, provide tight estimates for…
We analyze continuous optimal transport problems in the so-called Kantorovich form, where we seek a transport plan between two marginals that are probability measures on compact subsets of Euclidean space. We consider the case of…
We propose a discrete time formulation of the semi martingale optimal transport problembased on multi-marginal entropic transport. This approach offers a new way to formulate and solve numerically the calibration problem proposed by Guo et…
Many problems in geometric optics or convex geometry can be recast as optimal transport problems: this includes the far-field reflector problem, Alexandrov's curvature prescription problem, etc. A popular way to solve these problems…
Optimal transport problems pose many challenges when considering their numerical treatment. We investigate the solution of a PDE-constrained optimisation problem subject to a particular transport equation arising from the modelling of image…
We adapt the problem of continuous congested optimal transport to the Heisenberg group, equipped with a sub-Riemannian metric. Originally introduced in the Euclidean setting by Carlier, Jimenez, and Santambrogio as a path-dependent variant…
We investigate the problem of optimal transport in the so-called Kantorovich form, i.e. given two Radon measures on two compact sets, we seek an optimal transport plan which is another Radon measure on the product of the sets that has these…
Let $R$ and $B$ be two point sets in $\mathbb{R}^d$, with $|R|+ |B| = n$ and where $d$ is a constant. Next, let $\lambda : R \cup B \to \mathbb{N}$ such that $\sum_{r \in R } \lambda(r) = \sum_{b \in B} \lambda(b)$ be demand functions over…
The Monge-Kantorovich problem is revisited by means of a variant of the saddle-point method without appealing to $c$-conjugates. A new abstract characterization of the optimal plans is obtained in the case where the cost function takes…
We consider the problem to transport resources/mass while abiding by constraints on the flow through constrictions along their path between specified terminal distributions. Constrictions, conceptualized as toll stations at specified…
We describe an algorithm to solve Bellman optimization that replaces a sum over paths determining the optimal cost-to-go by an analytic method localized in state space. Our approach follows from the established relation between stochastic…
We study the convergence of entropically regularized optimal transport to optimal transport. The main result is concerned with the convergence of the associated optimizers and takes the form of a large deviations principle quantifying the…