A Newton algorithm for semi-discrete optimal transport

  title={A Newton algorithm for semi-discrete optimal transport},
  author={Jun Kitagawa and Quentin M{\'e}rigot and Boris Thibert},
Many problems in geometric optics or convex geometry can be recast as optimal transport problems: this includes the far-field reflector problem, Alexandrov's curvature prescription problem, etc. A popular way to solve these problems numerically is to assume that the source probability measure is absolutely continuous while the target measure is finitely supported. We refer to this setting as semi-discrete optimal transport. Among the several algorithms proposed to solve semi-discrete optimal… 

Figures from this paper

A stochastic Gauss-Newton algorithm for regularized semi-discrete optimal transport
A new second order stochastic algorithm to estimate the entropically regularized optimal transport cost between two probability measures that is adaptive to the geometry of the underlying convex optimization problem with no important hyperparameter to be accurately tuned is introduced.
Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution
It is proved that computing the Wasserstein distance between a discrete probability measure supported on two points and the Lebesgue measure on the standard hypercube is already #P-hard, and it is shown that smoothing the dual objective function is equivalent to regularizing the primal objective function.
Semi-discrete optimal transport - the case p=1
This article presents an algorithm for computing the optimal transport plan, similar to the approach for p=2 by Aurenhammer, Hoffmann and Aronov, and shows the necessary results to make the approach work for the Euclidean cost, evaluate its performance on a set of test cases, and give a number of applications.
A fast semi-discrete optimal transport algorithm for a unique reconstruction of the early Universe
We leverage powerful mathematical tools stemming from optimal transport theory and transform them into an efficient algorithm to reconstruct the fluctuations of the primordial density field, built on
Optimal Transport on Discrete Domains
Advances in numerical optimal transport are discussed that leverage understanding of both discrete and smooth aspects of the problem, and state-of-the-art techniques in discrete optimal transportation combine insight from partial differential equations with convex analysis to reformulate, discretize, and optimize transportation problems.
Spherical optimal transportation
Asymptotic analysis of domain decomposition for optimal transport
This article derives, via Γ-convergence, an asymptotic description of the algorithm in the limit of infinitely fine partition cells, and provides insights about the efficiency of the domain decomposition algorithm at finite resolutions and in combination with coarse-to-fine schemes.
Higher-dimensional power diagrams for semi-discrete optimal transport
It is demonstrated that the power diagrams can be used to solve optimal quantization and semi-discrete optimal transport problems, whereby a prescribed mass of each power cell is achieved by computing an optimized power diagram.
Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
This article presents an algorithm for computing the optimal transport plan, which is similar to the approach for the squared Euclidean cost, and shows the necessary results to make the approach work for the Euclideans cost, evaluates its performance on a set of test cases, and gives a number of applications.


A Numerical Algorithm for L2 Semi-Discrete Optimal Transport in 3D
This paper introduces a numerical algorithm to compute the L2 optimal transport map between two measures µ and ν, where µ derives from a density ρ defined as a piecewise linear function (supported by
Convergence of Entropic Schemes for Optimal Transport and Gradient Flows
The first contribution of this article is the proof of the $\Gamma$-convergence of the entropic regularized optimal transport problem towards the Monge-Kantorovich problem for the squared Euclidean norm cost function.
An algorithm for optimal transport between a simplex soup and a point cloud
The convergence with linear speed of a damped Newton's algorithm is proved to solve the optimal transport problem as the resolution of a non-linear system where one wants to prescribe the quantity of mass in each cell of the so-called Laguerre diagram.
An efficient numerical algorithm for the L2 optimal transport problem with periodic densities
An extension of the numerical method of Loeper and Rapetti (2005) for the Monge–Ampere equation by a Newton’s algorithm that converges for sufficiently large damping coefficients and is used to solve the optimal transport problem with quadratic cost.
On the regularity of solutions of optimal transportation problems
We give a necessary and sufficient condition on the cost function so that the map solution of Monge’s optimal transportation problem is continuous for arbitrary smooth positive data. This condition
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
This paper demonstrates that general optimal transport distances can be approximated in near-linear time by Cuturi's Sinkhorn Distances, and directly suggests a new greedy coordinate descent algorithm, Greenkhorn, with the same theoretical guarantees.
Regularity of Optimal Maps on the Sphere: the Quadratic Cost and the Reflector Antenna
Building on the results of Ma et al. (in Arch. Rational Mech. Anal. 177(2), 151–183 (2005)), and of the author Loeper (in Acta Math., to appear), we study two problems of optimal transportation on
Convergent Finite Difference Solvers for Viscosity Solutions of the Elliptic Monge-Ampère Equation in Dimensions Two and Higher
This article builds a wide stencil finite difference discretization for the Monge-Ampere equation and proves convergence of Newton's method and provides a systematic method to determine a starting point for the Newton iteration.
A Multiscale Approach to Optimal Transport
An improvement of an algorithm of Aurenhammer, Hoffmann and Aronov to find a least square matching between a probability density and finite set of sites with mass constraints, in the Euclidean plane is proposed.