The Double Regularization Method for Capacity Constrained Optimal Transport
Tianhao Wu, Qihao Cheng, Zihao Wang, Chaorui Zhang, Bo Bai, Zhongyi, Huang, Hao Wu

TL;DR
This paper introduces a novel regularization approach for capacity constrained optimal transport, enabling more efficient and accurate solutions by simplifying the duality analysis and reducing computational complexity.
Contribution
It proposes a new regularization method that simplifies solving capacity constrained optimal transport problems and improves computational efficiency over existing algorithms.
Findings
The method satisfies capacity constraints naturally.
It converts the problem into solving single-variable equations.
Numerical experiments show superior accuracy and efficiency.
Abstract
Capacity constrained optimal transport is a variant of optimal transport, which adds extra constraints on the set of feasible couplings in the original optimal transport problem to limit the mass transported between each pair of source and sink. Based on this setting, constrained optimal transport has numerous applications, e.g., finance, network flow. However, due to the large number of constraints in this problem, existing algorithms are both time-consuming and space-consuming. In this paper, inspired by entropic regularization for the classical optimal transport problem, we introduce a novel regularization term for capacity constrained optimal transport. The regularized problem naturally satisfies the capacity constraints and consequently makes it possible to analyze the duality. Unlike the matrix-vector multiplication in the alternate iteration scheme for solving classical optimal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Mathematical Programming
