Quadratically Regularized Optimal Transport on Graphs
From MaRDI portal
Publication:3174762
DOI10.1137/17M1132665zbMath1394.65041arXiv1704.08200OpenAlexW2962792820MaRDI QIDQ3174762
Justin Solomon, Montacer Essid
Publication date: 18 July 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.08200
Programming involving graphs or networks (90C35) Numerical optimization and variational techniques (65K10) Transportation, logistics and supply chain management (90B06) Flows in graphs (05C21)
Related Items (16)
Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems ⋮ Quantitative Stability of Regularized Optimal Transport and Convergence of Sinkhorn's Algorithm ⋮ Optimal transport problems regularized by generic convex functions: a geometric and algorithmic approach ⋮ Approximate Wasserstein attraction flows for dynamic mass transport over networks ⋮ Semi-discrete optimal transport: hardness, regularization and numerical solution ⋮ The dynamical Schrödinger problem in abstract metric spaces ⋮ Unnamed Item ⋮ Discrete Optimal Transport with Independent Marginals is #P-Hard ⋮ Geometry of Graph Partitions via Optimal Transport ⋮ Multilevel Optimal Transport: A Fast Approximation of Wasserstein-1 Distances ⋮ A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-Quadratic Regularized Optimal Transport Problems ⋮ Computation of optimal transport on discrete metric measure spaces ⋮ Quadratically regularized optimal transport ⋮ Coupling matrix manifolds assisted optimization for optimal transport problems ⋮ Fast Iterative Solution of the Optimal Transport Problem on Graphs ⋮ Empirical Regularized Optimal Transport: Statistical Theory and Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gradient flows of the entropy for finite Markov chains
- Absolute continuity and summability of transport densities: simpler proofs and new estimates
- A polynomial time primal network simplex algorithm for minimum cost flows
- Computations of optimal transport distance with Fisher information regularization
- A parallel method for earth mover's distance
- The earth mover's distance as a metric for image retrieval
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Concerning nonnegative matrices and doubly stochastic matrices
- Monge’s transport problem on a Riemannian manifold
- Incremental Computation of Pseudo-Inverse of Laplacian
- Algorithm 915, SuiteSparseQR
- Analysis and Generalizations of the Linearized Bregman Method
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract)
- Generalized Preconditioning and Undirected Minimum-Cost Flow
- Earth mover's distances on discrete surfaces
- Faster approximation schemes for fractional multicommodity flow problems
- Iterative Bregman Projections for Regularized Transportation Problems
- Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- A Note on Asymptotic Joint Normality
- Computing and Combinatorics
- On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- A Continuous Model of Transportation
This page was built for publication: Quadratically Regularized Optimal Transport on Graphs
