Efficient and exact multimarginal optimal transport with pairwise costs
From MaRDI portal
Publication:6571369
Recommendations
- Low-Rank Tensor Approximations for Solving Multimarginal Optimal Transport Problems
- Polynomial-time algorithms for multimarginal optimal transport problems with structure
- Multi-marginal optimal transport: theory and applications
- Genetic column generation: fast computation of high-dimensional multimarginal optimal transport problems
- Hardness results for multimarginal optimal transport problems
Cites work
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- A fast approach to optimal transport: the back-and-forth method
- A parallel method for earth mover's distance
- A variational model of irrigation patterns
- Barycenters in the Wasserstein space
- Concerning nonnegative matrices and doubly stochastic matrices
- Convergence of a Newton algorithm for semi-discrete optimal transport
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Duality theorems for marginal problems
- Faster than the fast Legendre transform, the linear-time Legendre transform
- Generalized solutions and hydrostatic approximation of the Euler equations
- Genetic column generation: fast computation of high-dimensional multimarginal optimal transport problems
- Gradient flows in metric spaces and in the space of probability measures
- Hardness results for multimarginal optimal transport problems
- Invariance principles in probability for triangular arrays of B-valued random vectors and some applications
- Iterative Bregman projections for regularized transportation problems
- Lectures on optimal transport
- Minimal Geodesics Along Volume-Preserving Maps, Through Semidiscrete Optimal Transport
- Multi-Marginal Optimal Transport and Probabilistic Graphical Models
- Multi-marginal optimal transport: theory and applications
- Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem
- Numerical solution of the optimal transportation problem using the Monge-Ampère equation
- OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
- Optimal maps for the multidimensional Monge-Kantorovich problem
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Optimal transport for particle image velocimetry: real data and postprocessing algorithms
- Optimal transport with proximal splitting
- Optimal transportation for the determinant
- Optimal transportation theory with repulsive costs
- Partial localization, lipid bilayers, and the elastica functional
- Polar factorization and monotone rearrangement of vector‐valued functions
- Polynomial-time algorithms for multimarginal optimal transport problems with structure
- Regularized optimal transport and the rot mover's distance
- Semidefinite relaxation of multimarginal optimal transport for strictly correlated electrons in second quantization
- Semidual regularized optimal transport
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- The Least Action Principle and the Related Concept of Generalized Flows for Incompressible Perfect Fluids
- The back-and-forth method for Wasserstein gradient flows
- The existence of minimizers for an isoperimetric problem with Wasserstein penalty term in unbounded domains
- The geometry of optimal transportation
- The structure of branched transportation networks
- Uniqueness and Monge solutions in the multimarginal optimal transportation problem
This page was built for publication: Efficient and exact multimarginal optimal transport with pairwise costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571369)