A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost
From MaRDI portal
Publication:6098523
Abstract: In this work, we construct a novel numerical method for solving the multi-marginal optimal transport problems with Coulomb cost. This type of optimal transport problems arises in quantum physics and plays an important role in understanding the strongly correlated quantum systems. With a Monge-like ansatz, the orginal high-dimensional problems are transferred into mathematical programmings with generalized complementarity constraints, and thus the curse of dimensionality is surmounted. However, the latter ones are themselves hard to deal with from both theoretical and practical perspective. Moreover in the presence of nonconvexity, brute-force searching for global solutions becomes prohibitive as the problem size grows large. To this end, we propose a global optimization approach for solving the nonconvex optimization problems, by exploiting an efficient proximal block coordinate descent local solver and an initialization subroutine based on hierarchical grid refinements. We provide numerical simulations on some typical physical systems to show the efficiency of our approach. The results match well with both theoretical predictions and physical intuitions, and give the first visualization of optimal transport maps for some two dimensional systems.
Recommendations
- A numerical method to solve multi-marginal optimal transport problems with Coulomb cost
- On deterministic solutions for multi-marginal optimal transport with Coulomb cost
- Genetic column generation: fast computation of high-dimensional multimarginal optimal transport problems
- Optimal transport with Coulomb cost. Approximation and duality
- Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A Modeling Language for Mathematical Programming
- A modified relaxation scheme for mathematical programs with complementarity constraints
- A numerical method to solve multi-marginal optimal transport problems with Coulomb cost
- A smoothing method for mathematical programs with equilibrium constraints
- A sparse algorithm for dense optimal transport
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- Approximation of optimal transport problems with marginal moments constraints
- Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces
- Constrained overdamped Langevin dynamics for symmetric multimarginal optimal transportation
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Convex relaxation approaches for strictly correlated density functional theory
- Density functional theory and optimal transportation with Coulomb cost
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Genetic column generation: fast computation of high-dimensional multimarginal optimal transport problems
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- Infinite-body optimal transport with Coulomb cost
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Multimarginal Optimal Transport Maps for One–dimensional Repulsive Costs
- Multiscale strategies for computing optimal transport
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- New development in freefem++
- Nonlinear programming without a penalty function.
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- On the Guignard constraint qualification for mathematical programs with equilibrium constraints
- Optimal Transport
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Pair densities in density functional theory
- Quadratic programming with one negative eigenvalue is NP-hard
- Semidefinite relaxation of multimarginal optimal transport for strictly correlated electrons in second quantization
- Solving mathematical programs with complementarity constraints as nonlinear programs
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
Cited in
(6)- On deterministic solutions for multi-marginal optimal transport with Coulomb cost
- Genetic column generation: fast computation of high-dimensional multimarginal optimal transport problems
- A numerical method to solve multi-marginal optimal transport problems with Coulomb cost
- The convergence properties of infeasible inexact proximal alternating linearized minimization
- Sampling-based methods for multi-block optimization problems over transport polytopes
- Sparse approximation of the Lieb functional with moment constraints
This page was built for publication: A Global Optimization Approach for Multimarginal 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 Q6098523)
