A column generation approach to the discrete barycenter problem

DOI10.1016/j.disopt.2021.100674OpenAlexW3215245749MaRDI QIDQ2691196

Steffen Borgwardt, Stephan Patterson

Publication date: 29 March 2023

Published in: Discrete Optimization (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingcolumn generationoptimal transportdiscrete barycenter

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80) Decomposition methods (49M27) Optimal transportation (49Q22)

Related Items (1)

Simple approximative algorithms for free-support Wasserstein barycenters

Cites Work

• Unnamed Item
• Discrete Wasserstein barycenters: optimal transport for discrete data
• An inexact PAM method for computing Wasserstein barycenter with unknown supports
• On the computational complexity of finding a sparse Wasserstein barycenter
• Ground metric learning on graphs
• Barycenters in the Wasserstein Space
• Decomposition Principle for Linear Programs
• Numerical methods for matching for teams and Wasserstein barycenters
• Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning
• Fast Entropic Regularized Optimal Transport Using Semidiscrete Cost Approximation
• Wasserstein Barycenters Are NP-Hard to Compute
• Iterative Bregman Projections for Regularized Transportation Problems
• A Primer in Column Generation
• Optimal Transport

This page was built for publication: A column generation approach to the discrete barycenter problem