Convergence of a Newton algorithm for semi-discrete optimal transport (Q2327700)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7117718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence of a Newton algorithm for semi-discrete optimal transport |
scientific article; zbMATH DE number 7117718 |
Statements
Convergence of a Newton algorithm for semi-discrete optimal transport (English)
0 references
15 October 2019
0 references
The paper studies numerical solutions to semi-discrete optimal transport problems in the setting that the source probability measure is absolutely continuous while the target measure is finitely supported. The authors introduce the damped Newton algorithm and give global linear convergence under the assumption of regularity and strong monotonicity of the gradient of the Kantorovich functional. The results are detailed and self-contained.
0 references
optimal transport
0 references
Ma-Trudinger-Wang condition
0 references
Laguerre tessellation
0 references
0 references
0 references
0 references
0 references
0 references
0.8199155926704407
0 references
0.8112613558769226
0 references
0.7907568216323853
0 references
0.7863494753837585
0 references
