Back to Search
Start Over
Algorithms for constrained optimal transport
- Publication Year :
- 2024
-
Abstract
- We derive iterative scaling algorithms of the Sinkhorn-Knopp (SK) type for constrained optimal transport. The constraints are in the form of prior-imposed zeroes in the transport plan. Based on classical Bregman arguments, we prove asymptotic convergence of our algorithms to a unique optimal solution. New insights obtained from the convergence proof are highlighted. An example from electrical vehicle charging in a smart city context is outlined, in which the prior zero-constraints prevent energy from being transported from some providers to some vehicles.<br />Comment: Submitted for publication
- Subjects :
- Mathematics - Optimization and Control
Mathematics - Dynamical Systems
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2404.00003
- Document Type :
- Working Paper