Convergence of a Newton algorithm for semi-discrete optimal transport
From MaRDI portal
Publication:2327700
DOI10.4171/JEMS/889zbMath1439.49053arXiv1603.05579OpenAlexW2963160215WikidataQ127969800 ScholiaQ127969800MaRDI QIDQ2327700
Quentin Mérigot, Jun Kitagawa, Boris Thibert
Publication date: 15 October 2019
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.05579
Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Transportation, logistics and supply chain management (90B06) Trade models (91B60) Discrete approximations in optimal control (49M25) Optimal transportation (49Q22)
Related Items (43)
Optimal transportation, modelling and numerical simulation ⋮ Applications of optimal transportation in the natural sciences. Abstracts from the workshop held February 21--27, 2021 (online meeting) ⋮ Multivariate ranks and quantiles using optimal transport: consistency, rates and nonparametric testing ⋮ Monotone discretization of the Monge–Ampère equation of optimal transport ⋮ Convergence of a Lagrangian Discretization for Barotropic Fluids and Porous Media Flow ⋮ Lagrangian Discretization of Variational Mean Field Games ⋮ A new implementation of the geometric method for solving the Eady slice equations ⋮ The second boundary value problem for a discrete Monge-Ampère equation ⋮ Superconvergence of the effective Cauchy stress in computational homogenization of inelastic materials ⋮ The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations ⋮ Sensitivity analysis and tailored design of minimization diagrams ⋮ Optimal Transport Approximation of 2-Dimensional Measures ⋮ Central limit theorems for semi-discrete Wasserstein distances ⋮ Quantitative stability of barycenters in the Wasserstein space ⋮ Asymptotic analysis of domain decomposition for optimal transport ⋮ Lagrangian Discretization of Crowd Motion and Linear Diffusion ⋮ Crowd motion and evolution PDEs under density constraints ⋮ Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case ⋮ Convergence Rate Estimates for Aleksandrov's Solution to the Monge--Ampère Equation ⋮ Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure ⋮ Convergence rates for discretized Monge-Ampère equations and quantitative stability of optimal transport ⋮ A Lagrangian scheme à la Brenier for the incompressible Euler equations ⋮ 3/4-Discrete Optimal Transport ⋮ Optimal transport: discretization and algorithms ⋮ Lagrangian schemes for Wasserstein gradient flows ⋮ Fast methods for computing centroidal Laguerre tessellations for prescribed volume fractions with applications to microstructure generation of polycrystalline materials ⋮ Entropic-Wasserstein Barycenters: PDE Characterization, Regularity, and CLT ⋮ A Newton Algorithm for Semidiscrete Optimal Transport with Storage Fees ⋮ \{Euclidean, metric, and Wasserstein\} gradient flows: an overview ⋮ A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer ⋮ Computational semi-discrete optimal transport with general storage fees ⋮ Asymptotic distribution and convergence rates of stochastic algorithms for entropic optimal transportation between probability measures ⋮ Multivariate goodness-of-fit tests based on Wasserstein distance ⋮ An overview of mathematical modeling of geometric optics problems involving refraction ⋮ Domain decomposition for entropy regularized optimal transport ⋮ A Texture Synthesis Model Based on Semi-Discrete Optimal Transport in Patch Space ⋮ Semi-discrete optimal transport methods for the semi-geostrophic equations ⋮ Mirrors, lenses and Monge-Ampère equations ⋮ Minimal convex extensions and finite difference discretisation of the quadratic Monge–Kantorovich problem ⋮ Metasurfaces and optimal transport ⋮ Data-driven gradient flows ⋮ Tackling algorithmic bias in neural-network classifiers using Wasserstein-2 regularization ⋮ A damped Newton algorithm for generated Jacobian equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical solution of the optimal transportation problem using the Monge-Ampère equation
- Hölder continuity and injectivity of optimal maps
- An iterative scheme for solving the optimal transportation problem
- On the local geometry of maps with c-convex potentials
- On the regularity of solutions of optimal transportation problems
- Regularity of optimal maps on the sphere: the quadratic cost and the reflector antenna
- Continuity, curvature, and the general covariance of optimal transportation
- On the numerical solution of the equation \(\frac{\partial ^ 2z\partial ^ 2z}{\partial x^ 2\partial y^ 2}-(\frac{\partial ^ 2z}{\partial x\partial y})^ 2=f\) and its discretizations. I
- The geometry of optimal transportation
- Minkowski-type theorems and least-squares clustering
- Numerical solution of the Monge--Ampère equation by a Newton's algorithm
- Regularity of potential functions of the optimal transportation problem
- Power particles
- On the Degeneracy of Optimal Transportation
- Variational Analysis in Sobolev and BV Spaces
- From Knothe's Transport to Brenier's Map and a Continuation Method for Optimal Transport
- On Cheeger-type inequalities for weighted graphs
- Discretization of the 3d monge−ampere operator, between wide stencils and power diagrams
- A Numerical Algorithm forL2Semi-Discrete Optimal Transport in 3D
- On the second boundary value problem for Monge-Ampère type equations and optimal transportation
- The Regularity of Mappings with a Convex Potential
- Generalized curvature measures and singularities of sets with positive reach
- An optimal Poincaré inequality in $L^1$ for convex domains
- Intersection of paraboloids and application to Minkowski-type problems
- An efficient numerical algorithm for the L2 optimal transport problem with periodic densities
- Convex Analysis
- Optimal Transport
This page was built for publication: Convergence of a Newton algorithm for semi-discrete optimal transport
