Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems
From MaRDI portal
Publication:5084524
DOI10.1137/21M140732XMaRDI QIDQ5084524
Daniela Vögler, Andreas S. Schulz, Gero Friesecke
Publication date: 24 June 2022
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.12624
Large-scale problems in mathematical programming (90C06) Numerical optimization and variational techniques (65K10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
The GenCol Algorithm for High-Dimensional Optimal Transport: General Formulation and Application to Barycenters and Wasserstein Splines ⋮ Universal diagonal estimates for minimizers of the Levy-Lieb functional ⋮ A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost ⋮ A finite element configuration interaction method for Wigner localization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational Optimal Transport: With Applications to Data Science
- A sparse multiscale algorithm for dense optimal transport
- Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Generalized incompressible flows, multi-marginal transport and Sinkhorn algorithm
- Smoothing of transport plans with fixed marginals and rigorous semiclassical limit of the Hohenberg-Kohn functional
- Domain decomposition for entropy regularized optimal transport
- Hardness results for multimarginal optimal transport problems
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Barycenters in the Wasserstein Space
- Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces
- Decomposition Principle for Linear Programs
- The Decomposition Algorithm for Linear Programs
- Numerical methods for matching for teams and Wasserstein barycenters
- The Least Action Principle and the Related Concept of Generalized Flows for Incompressible Perfect Fluids
- Polar factorization and monotone rearrangement of vector‐valued functions
- Optimal maps for the multidimensional Monge-Kantorovich problem
- Density Functional Theory and Optimal Transportation with Coulomb Cost
- Multimarginal Optimal Transport Maps for One–dimensional Repulsive Costs
- Constrained overdamped Langevin dynamics for symmetric multimarginal optimal transportation
- Approximation of optimal transport problems with marginal moments constraints
- Convex Relaxation Approaches for Strictly Correlated Density Functional Theory
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- A Simple Counterexample to the Monge Ansatz in Multimarginal Optimal Transport, Convex Geometry of the Set of Kantorovich Plans, and the Frenkel--Kontorova Model
- Selected Topics in Column Generation
- A Numerical Method to Solve Multi-Marginal Optimal Transport Problems with Coulomb Cost
- Letter to the Editor—The Multidimensional Assignment Problem
- Optimal Transport
This page was built for publication: Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems
