Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation
Ishida S, Lavenant H. 2024. Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation. Foundations of Computational Mathematics.
Download (ext.)
https://doi.org/10.1007/s10208-024-09686-3
[Published Version]
Journal Article
| Epub ahead of print
| English
Scopus indexed
Author
Ishida, SadashigeISTA;
Lavenant, Hugo
Corresponding author has ISTA affiliation
Department
Grant
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.
Publishing Year
Date Published
2024-11-11
Journal Title
Foundations of Computational Mathematics
Publisher
Springer Nature
Acknowledgement
The authors would like to thank Chris Wojtan for his continuous support and several interesting discussions. Part of this research was performed during two visits: one of SI to the BIDSA research center at Bocconi University, and one of HL to the Institute of Science and Technology Austria. Both host institutions are warmly acknowledged for the hospitality. HL is partially supported by the MUR-Prin 2022-202244A7YL “Gradient Flows and Non-Smooth Geometric Structures with Applications to Optimization and Machine Learning”, funded by the European Union - Next Generation EU. SI is supported in part by ERC Consolidator Grant 101045083 “CoDiNA” funded by the European Research Council.
ISSN
eISSN
IST-REx-ID
Cite this
Ishida S, Lavenant H. Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation. Foundations of Computational Mathematics. 2024. doi:10.1007/s10208-024-09686-3
Ishida, S., & Lavenant, H. (2024). Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation. Foundations of Computational Mathematics. Springer Nature. https://doi.org/10.1007/s10208-024-09686-3
Ishida, Sadashige, and Hugo Lavenant. “Quantitative Convergence of a Discretization of Dynamic Optimal Transport Using the Dual Formulation.” Foundations of Computational Mathematics. Springer Nature, 2024. https://doi.org/10.1007/s10208-024-09686-3.
S. Ishida and H. Lavenant, “Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation,” Foundations of Computational Mathematics. Springer Nature, 2024.
Ishida S, Lavenant H. 2024. Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation. Foundations of Computational Mathematics.
Ishida, Sadashige, and Hugo Lavenant. “Quantitative Convergence of a Discretization of Dynamic Optimal Transport Using the Dual Formulation.” Foundations of Computational Mathematics, Springer Nature, 2024, doi:10.1007/s10208-024-09686-3.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Link(s) to Main File(s)
Access Level
Open Access
Export
Marked PublicationsOpen Data ISTA Research Explorer
Sources
arXiv 2312.12213