Optimal transport problems regularized by generic convex functions: a geometric and algorithmic approach

DOI10.1007/s41884-021-00062-6zbMath1495.90109arXiv2011.13683OpenAlexW3217042118MaRDI QIDQ2154656

Daiji Tsutsui

Publication date: 20 July 2022

Published in: Information Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.13683

zbMATH Keywords

convex optimizationinformation geometrydiscrete optimal transportWasserstein barycenterentropic regularization

Mathematics Subject Classification ID

Convex programming (90C25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

When optimal transport meets information geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Computational Optimal Transport: With Applications to Data Science
• The geometry of proper scoring rules
• On the scaling of multidimensional matrices
• Information geometry connecting Wasserstein distance and Kullback-Leibler divergence via the entropy-relaxed transportation problem
• Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
• A Smoothed Dual Approach for Variational Wasserstein Problems
• Barycenters in the Wasserstein Space
• Quadratically Regularized Optimal Transport on Graphs
• Iterative Bregman Projections for Regularized Transportation Problems

This page was built for publication: Optimal transport problems regularized by generic convex functions: a geometric and algorithmic approach