Pages that link to "Item:Q262303"
From MaRDI portal
The following pages link to Discrete optimal transport: complexity, geometry and applications (Q262303):
Displaying 19 items.
- An algorithm to approximate the optimal expected inner product of two vectors with given marginals (Q136014) (← links)
- Variational principles for Minkowski type problems, discrete optimal transport, and discrete Monge-Ampère equations (Q281845) (← links)
- A sparse multiscale algorithm for dense optimal transport (Q334276) (← links)
- Discrete Wasserstein barycenters: optimal transport for discrete data (Q343818) (← links)
- An iterative scheme for solving the optimal transportation problem (Q406682) (← links)
- A particle-evolving method for approximating the optimal transport plan (Q2117959) (← links)
- Optimal transport problems regularized by generic convex functions: a geometric and algorithmic approach (Q2154656) (← links)
- The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations (Q2194042) (← links)
- Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case (Q2216178) (← links)
- Quantization and clustering on Riemannian manifolds with an application to air traffic analysis (Q2274972) (← links)
- On the structure of optimal transportation plans between discrete measures (Q2674441) (← links)
- A Numerical Algorithm for<i>L</i><sub>2</sub>Semi-Discrete Optimal Transport in 3D (Q3460393) (← links)
- An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud (Q4689764) (← links)
- Error Bounds for Discretized Optimal Transport and Its Reliable Efficient Numerical Solution (Q5051766) (← links)
- Quantitative Stability in the Geometry of Semi-discrete Optimal Transport (Q5082271) (← links)
- A Geometric Approach to the Transport of Discontinuous Densities (Q5119637) (← links)
- Optimal Transport via a Monge--Ampère Optimization Problem (Q5349442) (← links)
- Semi-discrete optimal transport: hardness, regularization and numerical solution (Q6038666) (← links)
- Discrete Optimal Transport with Independent Marginals is #P-Hard (Q6155882) (← links)
