A numerical method to solve multi-marginal optimal transport problems with Coulomb cost

DOI10.1007/978-3-319-41589-5_17MaRDI QIDQ5350489zbMATH OpenOpenAlexFDO

Authors Guillaume Carlier, Luca Nenna, Jean-David Benamou

Publication date 1 September 2017

Published in Splitting Methods in Communication, Imaging, Science, and Engineering (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1505.01136, https://hal.inria.fr/hal-01148954

zbMATH Keywords

Kullback-Leibler distancenumerical examplesoptimal transport problemCoulomb costentropic regularizationKantorovich formulationiterative Bregman projections

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Existence theories for optimal control problems involving partial differential equations (49J20) Discrete approximations in optimal control (49M25)

Abstract: In this paper, we present a numerical method, based on iterative Bregman projections, to solve the optimal transport problem with Coulomb cost. This is related to the strong interaction limit of Density Functional Theory. The first idea is to introduce an entropic regularization of the Kantorovich formulation of the Optimal Transport problem. The regularized problem then corresponds to the projection of a vector on the intersection of the constraints with respect to the Kullback-Leibler distance. Iterative Bregman projections on each marginal constraint are explicit which enables us to approximate the optimal transport plan. We validate the numerical method against analytical test cases.

Recommendations

• A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost
• On deterministic solutions for multi-marginal optimal transport with Coulomb cost
• Equality between Monge and Kantorovich multimarginal problems with Coulomb cost
• Optimal transport with Coulomb cost. Approximation and duality
• Multi-marginal optimal transport: theory and applications

Cited in

(22)

• A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost
• Low-Rank Tensor Approximations for Solving Multimarginal Optimal Transport Problems
• Optimal transport: discretization and algorithms
• Polynomial-time algorithms for multimarginal optimal transport problems with structure
• Wasserstein Barycenters Are NP-Hard to Compute
• Approximation of optimal transport problems with marginal moments constraints
• On deterministic solutions for multi-marginal optimal transport with Coulomb cost
• Moment-SoS methods for optimal transport problems
• Second-order models for optimal transport and cubic splines on the Wasserstein Space
• Genetic column generation: fast computation of high-dimensional multimarginal optimal transport problems
• Convex relaxation approaches for strictly correlated density functional theory
• An external dual charge approach to the multimarginal optimal transport with Coulomb cost
• Semidefinite relaxation of multimarginal optimal transport for strictly correlated electrons in second quantization
• Optimal transportation, modelling and numerical simulation
• Multi-marginal entropy-transport with repulsive cost
• Unbalanced multi-marginal optimal transport
• An entropy minimization approach to second-order variational mean-field games
• Universal diagonal estimates for minimizers of the Levy-Lieb functional
• The dynamical Schrödinger problem in abstract metric spaces
• Hardness results for multimarginal optimal transport problems
• A family of pairwise multi-marginal optimal transports that define a generalized metric
• Constrained overdamped Langevin dynamics for symmetric multimarginal optimal transportation

This page was built for publication: A numerical method to solve multi-marginal optimal transport problems with Coulomb cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5350489)