Unconditional convergence for discretizations of dynamical optimal transport

09/19/2019
by   Hugo Lavenant, et al.
0

The dynamical formulation of optimal transport, also known as Benamou-Brenier formulation or Computational Fluid Dynamic formulation, amounts to write the optimal transport problem as the optimization of a convex functional under a PDE constraint, and can handle a priori a vast class of cost functions and geometries. Several disretizations of this problem have been proposed, leading to computations on flat spaces as well as Riemannian manifolds, with extensions to mean field games and gradient flows in the Wasserstein space. In this article, we provide a framework which guarantees convergence under mesh refinement of the solutions of the space-time discretized problems to the one of the infinite-dimensional one for quadratic optimal transport. The convergence holds without condition on the ratio between spatial and temporal step sizes, and can handle arbitrary positive measures as input, while the underlying space can be a Riemannian manifold. Both the finite volume discretization proposed by Gladbach, Kopfer and Maas, as well as the discretization over triangulations of surfaces studied by the present author in collaboration with Claici, Chien and Solomon fit in this framework.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2021

Computing the Cut Locus of a Riemannian Manifold via Optimal Transport

In this paper, we give a new characterization of the cut locus of a poin...
research
09/19/2018

Dynamical Optimal Transport on Discrete Surfaces

We propose a technique for interpolating between probability distributio...
research
06/01/2021

Optimizing Functionals on the Space of Probabilities with Input Convex Neural Networks

Gradient flows are a powerful tool for optimizing functionals in general...
research
02/09/2022

Online Learning to Transport via the Minimal Selection Principle

Motivated by robust dynamic resource allocation in operations research, ...
research
11/11/2020

On a general matrix valued unbalanced optimal transport and its fully discretization: dynamic formulation and convergence framework

In this work, we present a rather general class of transport distances o...
research
05/16/2022

A scalable deep learning approach for solving high-dimensional dynamic optimal transport

The dynamic formulation of optimal transport has attracted growing inter...
research
09/16/2023

On the geometry and dynamical formulation of the Sinkhorn algorithm for optimal transport

The Sinkhorn algorithm is a numerical method for the solution of optimal...

Please sign up or login with your details

Forgot password? Click here to reset