Towards optimal running timesfor optimal transport

DOI10.1016/J.ORL.2023.11.007MaRDI QIDQ6556151FDOQ6556151

Authors Jose Blanchet, Arun Jambulapati, Carson Kent, Aaron Sidford

Publication date 17 June 2024

Published in Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

optimal transportWasserstein distanceKantorovich problemmatrix balancingpacking LPmaximum cardinality bipartite matching

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• scientific article; zbMATH DE number 1775454 (Why is no real title available?)
• Amplitude and phase variation of point processes
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• Approximating optimal transport with linear programs
• Approximation algorithms for bipartite matching with metric and geometric costs
• Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
• Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
• Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
• Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication
• Nearly-linear time positive LP solver with faster convergence rate
• On the translocation of masses
• Parallel algorithms for geometric graph problems

Cited in

(2)

• On entropy martingale optimal transport theory
• Stability and sample complexity of divergence regularized optimal transport

This page was built for publication: Towards optimal running timesfor optimal transport

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