Quantitative Convergence of a Discretization of Dynamic Optimal Transport Using the Dual Formulation

Abstract We present a discretization of the dynamic optimal transport problem for which we can obtain the convergence rate for the value of the transport cost to its continuous value when the temporal and spatial stepsize vanish. This convergence result does not require any regularity assumption on the measures, though experiments suggest that the rate is not sharp. Via an analysis of the duality gap we also obtain the convergence rates for the gradient of the optimal potentials and the velocity field under mild regularity assumptions. To obtain such rates, we discretize the dual formulation of the dynamic optimal transport problem and use the mature literature related to the error due to discretizing the Hamilton–Jacobi equation.

Authors

Institutions

Publication Details

Journal
Foundations of Computational Mathematics
Published
2024-11-11
DOI
https://doi.org/10.1007/s10208-024-09686-3
Primary Topic
Geometric Analysis and Curvature Flows
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantitative Convergence of a Discretization of Dynamic Optimal Transport Using the Dual Formulation

Sadashige Ishida, Hugo Lavenant
Foundations of Computational Mathematics
Geometric Analysis and Curvature Flows
article

Quantitative Convergence of a Discretization of Dynamic Optimal Transport Using the Dual Formulation

Sadashige Ishida, Hugo Lavenant
article en

Abstract

Abstract We present a discretization of the dynamic optimal transport problem for which we can obtain the convergence rate for the value of the transport cost to its continuous value when the temporal and spatial stepsize vanish. This convergence result does not require any regularity assumption on the measures, though experiments suggest that the rate is not sharp. Via an analysis of the duality gap we also obtain the convergence rates for the gradient of the optimal potentials and the velocity field under mild regularity assumptions. To obtain such rates, we discretize the dual formulation of the dynamic optimal transport problem and use the mature literature related to the error due to discretizing the Hamilton–Jacobi equation.

Foundations of Computational MathematicsVol. 26(1)
Institute of Science and Technology Austria (AT), Bocconi University (IT)
Institute of Science and Technology Austria
Openalex Percentile: Top 67%
Geometric Analysis and Curvature Flows
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.