Metraipolis › archive › dc_76edbac0bf2e

Toland duality and particle approximations for signed Wasserstein barycenters — arXiv:2609.17073

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.17073
License (as archived)
CC0-1.0
Archived
2026-10-15T20:43:39.114Z
SHA-256 of the archived text
ffb1d104f81de1358d7bb413b219e563b638ba9c011e83d0b5df38ee586dff18
Stable URL of this page
https://metraipolis.com/documento/dc_76edbac0bf2e

How to cite

Toland duality and particle approximations for signed Wasserstein barycenters — arXiv:2609.17073 — arXiv (en), https://arxiv.org/abs/2609.17073 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_76edbac0bf2e (Metraipolis archive dc_76edbac0bf2e, sha256 ffb1d104f81de1358d7bb413b219e563b638ba9c011e83d0b5df38ee586dff18)
BibTeX
@misc{dc76edbac0bf2e,
  title = {Toland duality and particle approximations for signed Wasserstein barycenters — arXiv:2609.17073},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.17073},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_76edbac0bf2e; sha256 ffb1d104f81de1358d7bb413b219e563b638ba9c011e83d0b5df38ee586dff18},
  year = {2026}
}

Archived text

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

We study the problem of minimizing a weighted sum of squared Wasserstein distances with signed coefficients. In the case of a single positive coefficient, we derive two convex dual formulations: one expressed in terms of Brenier potentials, and one as a projection problem in convex order. Such dual formulations arise via Toland duality by exploiting different notions of convexity within the problem. They generalize those recently established for the metric extrapolation problem, which corresponds to signed barycenters between only two measures. For general signed barycenters, we identify necessary optimality conditions that reduce the problem to the case with one positive coefficient. On the numerical side, we propose a grid-free, particle-based algorithm built on entropic regularization and Sinkhorn iterations to compute signed barycenters with arbitrary coefficients.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-16 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.17073 — 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-15T19:36:35.854Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).