























Abstract:This paper shows that the semi-dual formulation of the optimal transport problem has a degenerate saddle-point structure, and that its numerical solution is equivalent to solving a constrained optimization problem. We derive necessary and sufficient conditions for the convergence of Monge maps without requiring optimality of the dual potential. This analysis helps explain why, in practice, numerical algorithms often require more iterations to update the transport map than the potential.
| Subjects: | Optimization and Control (math.OC); Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.05569 [math.OC] |
| (or arXiv:2605.05569v1 [math.OC] for this version) | |
| https://doi.org/10.48550/arXiv.2605.05569 arXiv-issued DOI via DataCite (pending registration) |
From: Anton Selitskiy [view email]
[v1]
Thu, 7 May 2026 01:22:20 UTC (3,339 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。