Metraipolis › archive › dc_3570d2b50ca3

Capacity-Constrained Wasserstein Barycenters: Existence, Duality, and Entropic Regularization — arXiv:2609.19054

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.19054
License (as archived)
CC0-1.0
Archived
2026-10-15T15:40:27.350Z
SHA-256 of the archived text
9ed9c095d4b6bd440d9f3c2863e9ef53f2238091504195310c9829c61b198481
Stable URL of this page
https://metraipolis.com/documento/dc_3570d2b50ca3

How to cite

Capacity-Constrained Wasserstein Barycenters: Existence, Duality, and Entropic Regularization — arXiv:2609.19054 — arXiv (en), https://arxiv.org/abs/2609.19054 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3570d2b50ca3 (Metraipolis archive dc_3570d2b50ca3, sha256 9ed9c095d4b6bd440d9f3c2863e9ef53f2238091504195310c9829c61b198481)
BibTeX
@misc{dc3570d2b50ca3,
  title = {Capacity-Constrained Wasserstein Barycenters: Existence, Duality, and Entropic Regularization — arXiv:2609.19054},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.19054},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3570d2b50ca3; sha256 9ed9c095d4b6bd440d9f3c2863e9ef53f2238091504195310c9829c61b198481},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19054. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We introduce a capacity-constrained Wasserstein barycenter problem in which each transport plan from an input measure to the barycenter is bounded by a prescribed capacity measure. On compact domains, we prove existence of capacity-constrained barycenters and establish a strong duality formula. We then study an entropy-regularized version under bounded capacity-density assumptions. The regularized problem has a unique optimal tuple of transport plans and a unique barycenter, while its dual involves an explicit capped-exponential penalty. Whenever dual maximizers exist, the optimal densities satisfy a capacity-clipped Gibbs formula. Finally, we prove an $O(\epsilon)$ estimate for the optimal values and show that the regularized plans converge to the minimum-entropy optimal solution of the unregularized problem.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.19054 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T15:08:22.609Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).