Randomized Methods for Computing Optimal Transport Without Regularization and Their Convergence Analysis

The optimal transport (OT) problem can be reduced to a linear programming (LP) problem through discretization. In this paper, we introduced the random block coordinate descent (RBCD) methods to directly solve this LP problem. Our approach involves restricting the potentially large-scale optimization...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of scientific computing Jg. 100; H. 2; S. 37
Hauptverfasser: Xie, Yue, Wang, Zhongjian, Zhang, Zhiwen
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.08.2024
Springer Nature B.V
Schlagworte:
Algorithms
Computational Mathematics and Numerical Analysis
Convergence
Data science
Efficiency
Entropy
Experiments
Linear programming
Linear systems
Mathematical and Computational Engineering
Mathematical and Computational Physics
Mathematics
Mathematics and Statistics
Methods
Optimization
Partial differential equations
Performance evaluation
Regularization
Theoretical
Deep particle method
68W20
65C35
Convex optimization
90C25
Random block coordinate descent
Optimal transport
90C08
Convergence analysis
ISSN:0885-7474, 1573-7691
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The optimal transport (OT) problem can be reduced to a linear programming (LP) problem through discretization. In this paper, we introduced the random block coordinate descent (RBCD) methods to directly solve this LP problem. Our approach involves restricting the potentially large-scale optimization problem to small LP subproblems constructed via randomly chosen working sets. By using a random Gauss-Southwell- q rule to select these working sets, we equip the vanilla version of ( RBCD 0 ) with almost sure convergence and a linear convergence rate to solve general standard LP problems. To further improve the efficiency of the ( RBCD 0 ) method, we explore the special structure of constraints in the OT problems and leverage the theory of linear systems to propose several approaches for refining the random working set selection and accelerating the vanilla method. Inexact versions of the RBCD methods are also discussed. Our preliminary numerical experiments demonstrate that the accelerated random block coordinate descent ( ARBCD ) method compares well with other solvers including stabilized Sinkhorn’s algorithm when seeking solutions with relatively high accuracy, and offers the advantage of saving memory.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0885-7474
1573-7691
DOI:10.1007/s10915-024-02570-w