A Newton algorithm for semi-discrete optimal transport with storage fees and quantitative convergence of cells

by   Mohit Bansil, et al.

In this paper we will continue analysis of the semi-discrete optimal transport problem with storage fees, previously introduced by the authors, by proving convergence of a damped Newton algorithm for a specific choice of storage fee function, along with quantitative convergence of the associated Laguerre cells under limits of various parameters associated with the problem. A convergence result for cells in measure is proven without the additional assumption of a Poincarè-Wirtinger inequality on the source measure, while convergence in Hausdorff metric is shown when assuming such an inequality. These convergence results also yield approximations to the classical semi-discrete optimal transport problem.



page 1

page 2

page 3

page 4


Two Stage Algorithm for Semi-Discrete Optimal Transport on Disconnected Domains

In this paper we present a two-stage algorithm to solve the semi-discret...

Computational Semi-Discrete Optimal Transport with General Storage Fees

We propose and analyze a modified damped Newton algorithm to solve the s...

Distributed Function Minimization in Apache Spark

We report on an open-source implementation for distributed function mini...

Metasurfaces and Optimal transport

This paper provides a theoretical and numerical approach to show existen...

A Sinkhorn-Newton method for entropic optimal transport

We consider the entropic regularization of discretized optimal transport...

Optimal partitions and Semi-discrete optimal transport

In the current book I suggest an off-road path to the subject of optimal...

Partial Optimal Transport for a Constant-Volume Lagrangian Mesh with Free Boundaries

This article introduces a representation of dynamic meshes, adapted to s...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.