A new flow-based algorithm solves the data-driven Monge optimal transport barycenter problem by recasting the independence constraint as a singular-value penalty, yielding linear per-iteration cost and a closed-form map inverse.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Monge optimal transport barycenter problem
A new flow-based algorithm solves the data-driven Monge optimal transport barycenter problem by recasting the independence constraint as a singular-value penalty, yielding linear per-iteration cost and a closed-form map inverse.