Iterative Bregman Projections for Regularized Transportation Problems - Archive ouverte HAL Access content directly
Journal Articles SIAM Journal on Scientific Computing Year : 2015

Iterative Bregman Projections for Regularized Transportation Problems


This article details a general numerical framework to approximate so-lutions to linear programs related to optimal transport. The general idea is to introduce an entropic regularization of the initial linear program. This regularized problem corresponds to a Kullback-Leibler Bregman di-vergence projection of a vector (representing some initial joint distribu-tion) on the polytope of constraints. We show that for many problems related to optimal transport, the set of linear constraints can be split in an intersection of a few simple constraints, for which the projections can be computed in closed form. This allows us to make use of iterative Bregman projections (when there are only equality constraints) or more generally Bregman-Dykstra iterations (when inequality constraints are in-volved). We illustrate the usefulness of this approach to several variational problems related to optimal transport: barycenters for the optimal trans-port metric, tomographic reconstruction, multi-marginal optimal trans-port and in particular its application to Brenier's relaxed solutions of in-compressible Euler equations, partial un-balanced optimal transport and optimal transport with capacity constraints.
Fichier principal
Vignette du fichier
KL-Projections.pdf (944.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01096124 , version 1 (16-12-2014)



Jean-David Benamou, Guillaume Carlier, Marco Cuturi, Luca Nenna, Gabriel Peyré. Iterative Bregman Projections for Regularized Transportation Problems. SIAM Journal on Scientific Computing, 2015, 2 (37), pp.A1111-A1138. ⟨10.1137/141000439⟩. ⟨hal-01096124⟩
1646 View
4306 Download



Gmail Facebook X LinkedIn More