Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
From MaRDI portal
Publication:2216178
DOI10.1007/S00186-020-00703-ZzbMATH Open1457.65014OpenAlexW3006227152WikidataQ114231223 ScholiaQ114231223MaRDI QIDQ2216178FDOQ2216178
Authors: Valentin Hartmann, Dominic Schuhmacher 
Publication date: 15 December 2020
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-020-00703-z
Recommendations
- Discrete optimal transport: complexity, geometry and applications
- A numerical algorithm for \(L_2\) semi-discrete optimal transport in 3D
- The boundary method for semi-discrete optimal transport partitions and Wasserstein distance computation
- A fast approach to optimal transport: the back-and-forth method
- Semi-discrete optimal transport: hardness, regularization and numerical solution
Optimal transportation (49Q22) Euclidean analytic geometry (51N20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Numerical Optimization
- Computational optimal transport. With applications to data sciences
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- A comparison of algorithms for the multivariate \(L_1\)-median
- Updating Quasi-Newton Matrices with Limited Storage
- Wasserstein dictionary learning: optimal transport-based unsupervised nonlinear dictionary learning
- Optimal Transport
- Linear and nonlinear programming.
- Wasserstein discriminant analysis
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- A Nonmonotone Line Search Technique for Newton’s Method
- Title not available (Why is that?)
- Minkowski-type theorems and least-squares clustering
- Minimization of functions having Lipschitz continuous first partial derivatives
- Existence and uniqueness of monotone measure-preserving maps
- Limit laws of the empirical Wasserstein distance: Gaussian distributions
- On the Continuous Fermat-Weber Problem
- Title not available (Why is that?)
- The computational geometry algorithms library CGAL
- A sparse multiscale algorithm for dense optimal transport
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- The Transportation-Location Problem
- On the equality between Monge's infimum and Kantorovich's minimum in optimal mass transportation
- On semi-discrete Monge-Kantorovich and generalized partitions
- Optimum and equilibrium in a transport problem with queue penalization effect
- Convergence of a Newton algorithm for semi-discrete optimal transport
- A Continuous Model of Transportation
- Earth mover's distances on discrete surfaces
- Title not available (Why is that?)
- On location-allocation problems for dimensional facilities
- Central limit theorems for empirical transportation cost in general dimension
- Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure
- Inference for empirical Wasserstein distances on finite spaces
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- A framework for Wasserstein-1-type metrics
Cited In (16)
- 3/4-discrete optimal transport
- The boundary method for semi-discrete optimal transport partitions and Wasserstein distance computation
- Asymptotic distribution and convergence rates of stochastic algorithms for entropic optimal transportation between probability measures
- A sparse algorithm for dense optimal transport
- A unifying approach to distributional limits for empirical optimal transport
- Optimal 1-Wasserstein distance for WGANs
- A numerical algorithm for \(L_2\) semi-discrete optimal transport in 3D
- On the structure of optimal transportation plans between discrete measures
- Empirical optimal transport between different measures adapts to lower complexity
- Quantitative stability and error estimates for optimal transport plans
- Central limit theorems for semi-discrete Wasserstein distances
- Computational semi-discrete optimal transport with general storage fees
- Empirical optimal transport under estimated costs: distributional limits and statistical applications
- Semi-discrete optimal transport methods for the semi-geostrophic equations
- Multivariate goodness-of-fit tests based on Wasserstein distance
- A Newton algorithm for semidiscrete optimal transport with storage fees
Uses Software
This page was built for publication: Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2216178)
