Computational Semi-Discrete Optimal Transport with General Storage Fees

07/08/2020
by   Mohit Bansil, et al.
0

We propose and analyze a modified damped Newton algorithm to solve the semi-discrete optimal transport with storage fees. We prove global linear convergence for a wide range of storage fee functions, the main assumption being that each warehouse's storage costs are independent. We show that if F is an arbitrary storage fee function that satisfies this independence condition then F can be perturbed into a new storage fee function so that our algorithm converges. We also show that the optimizers are stable under these perturbations. Furthermore, our results come with quantitative rates.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2019

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

In this paper we will continue analysis of the semi-discrete optimal tra...
research
03/02/2020

Optimal transport: discretization and algorithms

This chapter describes techniques for the numerical resolution of optima...
research
04/11/2020

Quantitative Stability and Error Estimates for Optimal Transport Plans

Optimal transport maps and plans between two absolutely continuous measu...
research
04/12/2021

Metasurfaces and Optimal transport

This paper provides a theoretical and numerical approach to show existen...
research
07/05/2017

An algorithm for optimal transport between a simplex soup and a point cloud

We propose a numerical method to find the optimal transport map between ...
research
10/18/2017

A Sinkhorn-Newton method for entropic optimal transport

We consider the entropic regularization of discretized optimal transport...
research
12/16/2020

A fast semi-discrete optimal transport algorithm for a unique reconstruction of the early Universe

We leverage powerful mathematical tools stemming from optimal transport ...

Please sign up or login with your details

Forgot password? Click here to reset