English
Related papers

Related papers: Kantorovich's Mass Transport Problem for Capacitie…

200 papers

The goal of the present work is three-fold. The first goal is to set foundational results on optimal transport in Lorentzian (pre-)length spaces, including cyclical monotonicity, stability of optimal couplings and Kantorovich duality…

Metric Geometry · Mathematics 2025-03-14 Fabio Cavalletti , Andrea Mondino

We consider the Monge-Kantorovich transport problem in a purely measure theoretic setting, i.e. without imposing continuity assumptions on the cost function. It is known that transport plans which are concentrated on c-monotone sets are…

Optimization and Control · Mathematics 2009-01-19 Mathias Beiglböck , Martin Goldstern , Gabriel Maresch , Walter Schachermayer

In this work, we show the intrinsic relations between optimal transportation and convex geometry, especially the variational approach to solve Alexandrov problem: constructing a convex polytope with prescribed face normals and volumes. This…

Machine Learning · Computer Science 2017-12-20 Na Lei , Kehua Su , Li Cui , Shing-Tung Yau , David Xianfeng Gu

A variant of the classical optimal transportation problem is: among all joint measures with fixed marginals and which are dominated by a given density, find the optimal one. Existence and uniqueness of solutions to this variant were…

Optimization and Control · Mathematics 2018-01-23 Jonathan Korman , Robert J. McCann

The fundamental theorem of classical optimal transport establishes strong duality and characterizes optimizers through a complementary slackness condition. Milestones such as Brenier's theorem and the Kantorovich-Rubinstein formula are…

Probability · Mathematics 2025-01-28 Mathias Beiglböck , Gudmund Pammer , Lorenz Riess , Stefan Schrott

We consider the original strategy proposed by Sudakov for solving the Monge transportation problem with norm cost $|\cdot|_{D^*}$ \[ \min \bigg\{\int |\mathtt T(x) - x|_{D^*} d\mu(x), \ \mathtt T : \mathbb R^d \to \mathbb R^d, \ \nu =…

Classical Analysis and ODEs · Mathematics 2014-01-08 Stefano Bianchini , Sara Daneri

Inspired by the matching of supply to demand in logistical problems, the optimal transport (or Monge--Kantorovich) problem involves the matching of probability distributions defined over a geometric domain such as a surface or manifold. In…

Optimization and Control · Mathematics 2018-05-02 Justin Solomon

We analyze optimal transport problems with additional entropic cost evaluated along curves in the Wasserstein space which join two probability measures $m_0,m_1$. The effect of the additional entropy functional results into an elliptic…

Analysis of PDEs · Mathematics 2022-11-18 Alessio Porretta

Energy bounds for Kantorovich transport distances are developed for convex cost functions. The main results extend estimates due to M. Ledoux for the Kantorovich distances $W_p$.

Functional Analysis · Mathematics 2025-12-23 Sergey Bobkov , Friedrich Götze

We develop a full theory for the new class of Optimal Entropy-Transport problems between nonnegative and finite Radon measures in general topological spaces. They arise quite naturally by relaxing the marginal constraints typical of Optimal…

Optimization and Control · Mathematics 2018-10-16 Matthias Liero , Alexander Mielke , Giuseppe Savaré

It is well-known that duality in the Monge-Kantorovich transport problem holds true provided that the cost function $c:X\times Y\to [0,\infty]$ is lower semi-continuous or finitely valued, but it may fail otherwise. We present a suitable…

Optimization and Control · Mathematics 2010-09-10 Mathias Beiglboeck , Aldo Pratelli

This is an overview of the quasidifferential calculus for the mappings that arrive at Kantorovich spaces. The necessary optimality conditions are also derived for multiple criteria optimization problems with quasidifferentiable data.

Functional Analysis · Mathematics 2016-10-05 E. K. Basaeva , A. G. Kusraev , S. S. Kutateladze

The Monge-Kantorovich mass-transportation problem has been shown to be fundamental for various basic problems in analysis and geometry in recent years. Shen and Zheng (2010) proposed a probability method to transform the celebrated…

Optimization and Control · Mathematics 2022-01-07 Zuo Quan Xu , Jia-An Yan

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…

Analysis of PDEs · Mathematics 2010-11-15 Nestor Guillen , Robert McCann

Weak optimal transport generalizes the classical theory of optimal transportation to nonlinear cost functions and covers a range of problems that lie beyond the traditional theory - including entropic transport, martingale transport, and…

Probability · Mathematics 2025-07-16 Filip Pramenković

By investigating model-independent bounds for exotic options in financial mathematics, a martingale version of the Monge-Kantorovich mass transport problem was introduced in \cite{BeiglbockHenry…

Computational Finance · Quantitative Finance 2013-04-10 Pierre Henry-Labordere , Nizar Touzi

Suppose that $c(x,y)$ is the cost of transporting a unit of mass from $x\in X$ to $y\in Y$ and suppose that a mass distribution $\mu$ on $X$ is transported optimally (so that the total cost of transportation is minimal) to the mass…

Functional Analysis · Mathematics 2014-05-20 Sedi Bartz , Simeon Reich

An analogue of the quadratic Wasserstein (or Monge-Kantorovich) distance between Borel probability measures on $\mathbf{R}^d$ has been defined in [F. Golse, C. Mouhot, T. Paul: Commun. Math. Phys. 343 (2015), 165-205] for density operators…

Mathematical Physics · Physics 2021-02-10 Emanuele Caglioti , François Golse , Thierry Paul

We prove a conjecture regarding the asymptotic behavior at infinity of the Kantorovich potential for the Multimarginal Optimal Transport with Coulomb and Riesz costs.

Mathematical Physics · Physics 2025-11-18 Rodrigue Lelotte

In Optimal Transport (OT) on a finite metric space, one defines a distance on the probability simplex that extends the distance on the ground space. The distance is the value of a Linear Programming (LP) problem on the set of…

Methodology · Statistics 2021-01-14 Giovanni Pistone , Fabio Rapallo , Maria Piera Rogantin