Algorithms for Euclidean-regularised optimal transport

DOI10.1007/978-3-031-47859-8_7MaRDI QIDQ6588733zbMATH OpenFDO

Authors D. A. Pasechnyuk, Michael Persiianov, Pavel Dvurechensky, A. V. Gasnikov

Publication date 16 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-47859-8_7

zbMATH Keywords

alternating optimisationEuclidean regularisationoptimal transportprimal-dual algorithmSinkhorn algorithm

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Fast entropic regularized optimal transport using semidiscrete cost approximation
• Algorithms for optimal transport and Wasserstein distances
• Coupling matrix manifolds assisted optimization for optimal transport problems
• Convergence of a Newton algorithm for semi-discrete optimal transport
• Convolutional Wasserstein distances: efficient optimal transportation on geometric domains

Cites work

• Alternating minimization methods for strongly convex optimization
• Computational optimal transport. With applications to data sciences
• Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
• scientific article; zbMATH DE number 3099866 (Why is no real title available?)
• Introductory lectures on convex optimization. A basic course.
• Optimal Transport
• Quadratically regularized optimal transport
• Quadratically regularized optimal transport on graphs

This page was built for publication: Algorithms for Euclidean-regularised optimal transport

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