A sparse algorithm for dense optimal transport

DOI10.1007/978-3-319-18461-6_50MaRDI QIDQ3300344zbMATH OpenOpenAlexFDO

Authors Bernhard Schmitzer

Publication date 28 July 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18461-6_50

zbMATH Keywords

dense problemdual constraintoptimal transportsparse problem

Mathematics Subject Classification ID

Optimal transportation (49Q22) Numerical optimization and variational techniques (65K10)

Recommendations

• A sparse multiscale algorithm for dense optimal transport
• A fast approach to optimal transport: the back-and-forth method
• Discrete optimal transport: complexity, geometry and applications
• Quadratically regularized optimal transport
• Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case

Cites work

• A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
• A linear optimal transportation framework for quantifying and visualizing variations in sets of images
• Finding Minimum-Cost Circulations by Successive Approximation
• From Knothe's Transport to Brenier's Map and a Continuation Method for Optimal Transport
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• Optimal mass transport for registration and warping
• Optimal Transport
• Perspectives of Monge properties in optimization
• The earth mover's distance as a metric for image retrieval

Cited in

(10)

• An efficient algorithm for matrix-valued and vector-valued optimal mass transport
• A transportation \(L^p\) distance for signal analysis
• A multiscale semi-smooth Newton method for optimal transport
• Sparse approximation of triangular transports. II: The infinite-dimensional case
• Transport between RGB images motivated by dynamic optimal transport
• A sparse multiscale algorithm for dense optimal transport
• Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
• Minimal Geodesics Along Volume-Preserving Maps, Through Semidiscrete Optimal Transport
• A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost
• An Interior Point–Inspired Algorithm for Linear Programs Arising in Discrete Optimal Transport

Describes a project that uses

Uses Software

• EMD
• LEMON

This page was built for publication: A sparse algorithm for dense optimal transport

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