Approximating optimal transport with linear programs

DOI10.4230/OASICS.SOSA.2019.6MaRDI QIDQ6593561zbMATH OpenFDO

Authors Kent Quanrud

Publication date 26 August 2024

Full work available at URL https://doi.org/10.4230/OASICS.SOSA.2019.6

zbMATH Keywords

fast approximationslinear programmingoptimal transport

Mathematics Subject Classification ID

Approximation algorithms (68W25) Linear programming (90C05)

Recommendations

• Iterative Bregman projections for regularized transportation problems
• Optimal transport: fast probabilistic approximation with exact solvers
• Solution of Optimal Transportation Problems Using a Multigrid Linear Programming Approach
• A fast approach to optimal transport: the back-and-forth method
• Entropic approximation of \(\infty \)-optimal transport problems

Cited in

(2)

• Towards optimal running timesfor optimal transport
• Fast computation of optimal transport via entropy-regularized extragradient methods

This page was built for publication: Approximating optimal transport with linear programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593561)