Iterative Bregman Projections for Regularized Transportation Problems
Publication:5254485
DOI10.1137/141000439zbMath1319.49073arXiv1412.5154OpenAlexW2036996178MaRDI QIDQ5254485
Luca Nenna, Gabriel Peyré, Marco Cuturi, Guillaume Carlier, Jean-David Benamou
Publication date: 9 June 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5154
convex optimizationincompressible Euler equationsoptimal transportWasserstein barycenterentropy regularizationiterative Bregman projections
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Variational problems in a geometric measure-theoretic setting (49Q20) Existence theories for optimal control problems involving partial differential equations (49J20) Euler equations (35Q31)
Related Items (only showing first 100 items - show all)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical solution of the optimal transportation problem using the Monge-Ampère equation
- A survey of the Schrödinger problem and some of its connections with optimal transport
- Tomographic reconstruction from a few views: a multi-marginal optimal transport approach
- On the local structure of optimal measures in the multi-marginal optimal transportation problem
- The dual least action problem for an ideal, incompressible fluid
- Matching for teams
- Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness
- The optimal partial transport problem
- Generalized solutions and hydrostatic approximation of the Euler equations
- Free boundaries in optimal transport and Monge-Ampère obstacle problems
- Geodesics in the space of measure-preserving maps and plans
- On pairs of multidimensional matrices
- An iterative procedure for obtaining I-projections onto the intersection of convex sets
- On the scaling of multidimensional matrices
- D//\(1AD_ 2 \)theorems for multidimensional matrices
- I-divergence geometry of probability distributions and minimization problems
- Asymptotic analysis of the exponential penalty trajectory in linear programming
- Numerical solution of the Monge--Ampère equation by a Newton's algorithm
- The earth mover's distance as a metric for image retrieval
- Convergence of the iterative proportional fitting procedure
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- An iterative procedure for general probability measures to obtain \(I\)-projections onto intersections of convex sets
- Concerning nonnegative matrices and doubly stochastic matrices
- Dykstras algorithm with bregman projections: A convergence proof
- Optimal Transport with Proximal Splitting
- Synthesizing and Mixing Stationary Gaussian Texture Models
- A Mumford–Shah-Like Method for Limited Data Tomography with an Application to Electron Tomography
- Uniqueness and Monge Solutions in the Multimarginal Optimal Transportation Problem
- Barycenters in the Wasserstein Space
- An Algorithm for Restricted Least Squares Regression
- THE MULTI-MARGINAL OPTIMAL PARTIAL TRANSPORT PROBLEM
- Numerical methods for matching for teams and Wasserstein barycenters
- The Least Action Principle and the Related Concept of Generalized Flows for Incompressible Perfect Fluids
- Assignment Problems
- Minimal geodesics on groups of volume-preserving maps and generalized solutions of the Euler equations
- Optimal maps for the multidimensional Monge-Kantorovich problem
- Density Functional Theory and Optimal Transportation with Coulomb Cost
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Optimal transportation with capacity constraints
- Estimating Nonnegative Matrices from Marginal Data
- Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
- On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
This page was built for publication: Iterative Bregman Projections for Regularized Transportation Problems