The boundary method for semi-discrete optimal transport partitions and Wasserstein distance computation
From MaRDI portal
Publication:2423519
DOI10.1016/j.cam.2018.12.034zbMath1432.65080arXiv1702.03517OpenAlexW2603593094MaRDI QIDQ2423519
Publication date: 20 June 2019
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.03517
Numerical optimization and variational techniques (65K10) Discrete approximations in optimal control (49M25) Monge-Ampère equations (35J96)
Related Items (3)
A Continuation Multiple Shooting Method for Wasserstein Geodesic Equation ⋮ Techniques for continuous optimal transport problem ⋮ Semi-discrete optimal transport methods for the semi-geostrophic equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sparse multiscale algorithm for dense optimal transport
- Numerical solution of the optimal transportation problem using the Monge-Ampère equation
- An iterative scheme for solving the optimal transportation problem
- Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness
- On the equality between Monge's infimum and Kantorovich's minimum in optimal mass transportation
- On the numerical solution of the equation \(\frac{\partial ^ 2z\partial ^ 2z}{\partial x^ 2\partial y^ 2}-(\frac{\partial ^ 2z}{\partial x\partial y})^ 2=f\) and its discretizations. I
- A characterization for the solution of the Monge--Kantorovich mass transference problem
- A generic auction algorithm for the minimum cost network flow problem
- The geometry of optimal transportation
- Minkowski-type theorems and least-squares clustering
- Solution of a model Boltzmann equation via steepest descent in the 2-Wasserstein metric
- Regularity of potential functions of the optimal transportation problem
- Monge-Kantorovich transportation problem and optimal couplings
- Minimum-cost flow algorithms: an experimental evaluation
- A Numerical Algorithm forL2Semi-Discrete Optimal Transport in 3D
- Mathématiques/Mathematics Shape optimization solutions via Monge-Kantorovich equation
- The Variational Formulation of the Fokker--Planck Equation
- Multi‐to One‐Dimensional Optimal Transport
- Power Diagrams: Properties, Algorithms and Applications
- Iterative Bregman Projections for Regularized Transportation Problems
- A Comparison of Two Dual Methods for Discrete Optimal Transport
- A Mixed Formulation of the Monge-Kantorovich Equations
- Convergent Difference Schemes for Degenerate Elliptic and Parabolic Equations: Hamilton--Jacobi Equations and Free Boundary Problems
- A general existence result for the principal-agent problem with adverse selection
- Numerical and analytical results for the transportation problem of Monge-Kantorovich
This page was built for publication: The boundary method for semi-discrete optimal transport partitions and Wasserstein distance computation
