A Newton Algorithm for Semidiscrete Optimal Transport with Storage Fees

DOI10.1137/20M1357226zbMath1476.49055arXiv1908.11533OpenAlexW3210949808MaRDI QIDQ5162652

Jun Kitagawa, Mohit Bansil

Publication date: 5 November 2021

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.11533

zbMATH Keywords

calculus of variationsnumerical analysisoptimal transportdamped Newton algorithm

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Discrete approximations in optimal control (49M25) Optimal transportation (49Q22)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Computational Optimal Transport: With Applications to Data Science
• Numerical solution of the optimal transportation problem using the Monge-Ampère equation
• An iterative scheme for solving the optimal transportation problem
• Optimal transport and a bilevel location-allocation problem
• Fast finite difference solvers for singular solutions of the elliptic Monge-Ampère equation
• On the regularity of solutions of optimal transportation problems
• Wide stencil finite difference schemes for the elliptic Monge-Ampère equation and functions of the eigenvalues of the Hessian
• 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
• Minkowski-type theorems and least-squares clustering
• A new optimal transport distance on the space of finite Radon measures
• Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures
• An interpolating distance between optimal transport and Fisher-Rao metrics
• Unbalanced optimal transport: dynamic and Kantorovich formulations
• Pointwise rates of convergence for the Oliker-Prussner method for the Monge-Ampère equation
• Numerical solution of the Monge--Ampère equation by a Newton's algorithm
• Uniformly convex and uniformly smooth convex functions
• On the design of a reflector antenna. II
• Convergence of a Newton algorithm for semi-discrete optimal transport
• Regularity of potential functions of the optimal transportation problem
• An iterative method for generated Jacobian equations
• Optimal monopoly pricing with congestion and random utility via partial mass transport
• Capacitated facility location problem with general setup cost
• Optimal Transport in Competition with Reaction: The Hellinger--Kantorovich Distance and Geodesic Curves
• Convergent Finite Difference Solvers for Viscosity Solutions of the Elliptic Monge–Ampère Equation in Dimensions Two and Higher
• Discretization of the 3d monge−ampere operator, between wide stencils and power diagrams
• A Numerical Algorithm forL₂Semi-Discrete Optimal Transport in 3D
• On the second boundary value problem for Monge-Ampère type equations and optimal transportation
• Polar factorization and monotone rearrangement of vector‐valued functions
• The Regularity of Mappings with a Convex Potential
• Convex Polyhedra
• An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud
• An efficient numerical algorithm for the L2 optimal transport problem with periodic densities
• Optimum and equilibrium in a transport problem with queue penalization effect
• Convergence of Entropic Schemes for Optimal Transport and Gradient Flows
• Optimal Transport

This page was built for publication: A Newton Algorithm for Semidiscrete Optimal Transport with Storage Fees