Convergence of a Newton algorithm for semi-discrete optimal transport (Q2327700): Difference between revisions

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.