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

10/23/2019
by   Mohit Bansil, et al.
0

In this paper we present a two-stage algorithm to solve the semi-discrete Optimal Transport Problem in the case where the support of the source measure is disconnected. We establish global linear convergence and local superlinear convergence. We also find convergence of the associated Laguerre cells in the vein of <cit.>.

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
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
06/09/2022

Symmetrized semi-discrete optimal transport

Interpolating between measures supported by polygonal or polyhedral doma...
research
11/11/2019

Optimal partitions and Semi-discrete optimal transport

In the current book I suggest an off-road path to the subject of optimal...
research
03/30/2023

On the convergence of continuous and discrete unbalanced optimal transport models

We consider a Beckmann formulation of an unbalanced optimal transport (U...

Please sign up or login with your details

Forgot password? Click here to reset