Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure

This paper aims at determining under which conditions the semi-discrete optimal transport is twice differentiable with respect to the parameters of the discrete measure and exhibits numerical applications. The discussion focuses on minimal conditions on the background measure to ensure differentiability. We provide numerical illustrations in stippling and blue noise problems.

• Publication year

  2018

• Venue

  Numerische Mathematik

• Publication date

  2018-03-02

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00211-018-1000-4arXiv 1803.00827
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

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

  2017cited by this paper
• Convergence of a Newton algorithm for semi-discrete optimal transport

  2016influential reference
• Wasserstein discriminant analysis

  2016cited by this paper
• Geometric Discretization through Primal-Dual Meshes

  2014influential reference
• A Numerical Algorithm for L2 Semi-Discrete Optimal Transport in 3D

  2014cited by this paper
• Wasserstein Propagation for Semi-Supervised Learning

  2014cited by this paper
• A Comparison of Two Dual Methods for Discrete Optimal Transport

  2013cited by this paper
• Blue noise through optimal transport

  2012cited by this paper
• A Linear Optimal Transportation Framework for Quantifying and Visualizing Variations in Sets of Images

  2012cited by this paper
• Optimal Delaunay and Voronoi Quantization Schemes for Pricing American Style Options

  2012cited by this paper
• Lp Centroidal Voronoi Tessellation and its applications

  2010cited by this paper
• The Collected Mathematical Papers: On Monge's “Mémoire sur la théorie des déblais et des remblais”

  2009cited by this paper
• On centroidal voronoi tessellation—energy smoothness and fast computation

  2009influential reference
• Computational geometry algorithms library

  2008cited by this paper
• Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations

  2006influential reference
• On a Problem of Monge

  2006cited by this paper
• Variation et optimisation de formes : une analyse géométrique

  2005cited by this paper
• Optimum Quantization and Its Applications

  2004cited by this paper
• Iterative methods for sparse linear systems

  2003cited by this paper
• Topics in Optimal Transportation

  2003influential reference
• Grid generation and optimization based on centroidal Voronoi tessellations

  2002cited by this paper
• Foundations of Quantization for Probability Distributions

  2000cited by this paper
• The Earth Mover's Distance as a Metric for Image Retrieval

  2000cited by this paper
• Centroidal Voronoi Tessellations: Applications and Algorithms

  1999cited by this paper
• Minkowski-Type Theorems and Least-Squares Clustering

  1998cited by this paper
• THE VARIATIONAL FORMULATION OF THE FOKKER-PLANCK EQUATION

  1996cited by this paper
• Nonlinear Programming

  1995cited by this paper
• Power Diagrams: Properties, Algorithms and Applications

  1987cited by this paper
• A fast Voronoi-diagram algorithm with applications to geographical optimization problems

  1984cited by this paper
• Analyse fonctionnelle : théorie et applications

  1983cited by this paper
• Least squares quantization in PCM

  1982cited by this paper

• Wasserstein Gradient Flows of semi-discret energies: evolution of urban areas anduniform quantization

  2026influential citation
• Semi-discrete optimal transport techniques for the compressible semi-geostrophic equations

  2025cites this paper
• Scalable and consistent embedding of probability measures into Hilbert spaces via measure quantization

  2025influential citation
• On the Sequential Convergence of Lloyd’s Algorithms

  2024cites this paper
• Inverting Laguerre tessellations: recovering tessellations from the volumes and centroids of their cells using optimal transport

  2024cites this paper
• Solving semi-discrete optimal transport problems: star shapedeness and Newton’s method

  2023influential citation
• Solving Semi-Discrete Optimal Transport Problems: star shapedeness and Newton's method

  2023influential citation
• A new implementation of the geometric method for solving the Eady slice equations

  2022cites this paper
• Geometric modelling of polycrystalline materials: Laguerre tessellations and periodic semi-discrete optimal transport

  2022cites this paper
• Задача Канторовича оптимальной транспортировки мер: новые направления исследований

  2022cites this paper
• Semi-discrete optimal transport methods for the semi-geostrophic equations

  2022cites this paper
• MongeNet: Efficient Sampler for Geometric Deep Learning

  2021cites this paper
• Partial Optimal Transport for a Constant-Volume Lagrangian Mesh with Free Boundaries

  2021cites this paper
• A discrete method for the initialization of semi-discrete optimal transport problem

  2021cites this paper
• Sensitivity analysis and tailored design of minimization diagrams

  2021cites this paper
• On the dynamical system of principal curves in

  2021cites this paper
• Curve Based Approximation of Measures on Manifolds by Discrepancy Minimization

  2021cites this paper
• Semi-discrete optimal transport methods for the semi-geostrophic equations

  2020cites this paper
• Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case

  2020cites this paper
• Optimal transport: discretization and algorithms

  2020cites this paper
• Lagrangian Discretization of Variational Mean Field Games

  2020cites this paper
• Existence for the Semi-Geostrophic Equations in Geostrophic Coordinates via Semi-Discrete Optimal Transport

  2020cites this paper
• Optimal Transport Approximation of 2-Dimensional Measures

  2019influential citation
• Curve Based Approximation of Measures on Manifolds by Discrepancy Minimization

  2019cites this paper
• 3/4-Discrete Optimal Transport

  2018cites this paper