arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.03307cs.DCcs.DMmath.OC
收藏

基于图的线性规划乘性权重更新方法的高效并行实现

Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs

Caleb Ju, Serif Yesil, Mengyuan Sun, Chandra Chekuri, Edgar Solomonik

AI总结:

本文实现并测试了一种高效并行算法用于求解正线性规划松弛,通过新步长搜索启发式和稀疏线性代数优化加速,在多项图问题上比通用求解器更快,部分情况优于专用并行图算法。

摘要:

正线性规划(LPs)对许多图和运筹学问题进行建模。通过乘性权重更新(MWU)方法的变体,可以在多对数深度和近线性工作量内,对任意选定的$ε$求解正线性规划的$(1+ε)$-近似解。尽管数十年来对这些算法进行了广泛的理论研究,但它们的实际性能尚不清楚。在这项工作中,我们实现并测试了一种用于求解正线性规划松弛的高效并行算法,并将其应用于诸如图的最密子图、二分匹配、顶点覆盖和支配集等图问题。我们通过一种新的步长搜索启发式方法加速了该算法。我们的实现使用了稀疏线性代数优化技术,例如向量操作的融合和稀疏格式的使用。此外,我们为图关联约束设计了一种隐式表示。我们通过在Stampede2超级计算机上使用线程OpenMP和MPI展示了并行可扩展性。我们将此实现与精确库以及针对上述问题的专用库进行比较,以评估MWU在其他方法中的准确性和性能方面的实际地位。我们的结果表明,在所有实验中,该实现比通用LP求解器(IBM CPLEX、Gurobi)更快,并且在某些情况下,优于最先进的专用并行图算法。

英文摘要:

Positive linear programs (LPs) model many graph and operations research problems. One can solve for a $(1+ε)$-approximation for positive LPs, for any selected $ε$, in polylogarithmic depth and near-linear work via variations of the multiplicative weight update (MWU) method. Despite extensive theoretical work on these algorithms through the decades, their empirical performance is not well understood. In this work, we implement and test an efficient parallel algorithm for solving positive LP relaxations, and apply it to graph problems such as densest subgraph, bipartite matching, vertex cover and dominating set. We accelerate the algorithm via a new step size search heuristic. Our implementation uses sparse linear algebra optimization techniques such as fusion of vector operations and use of sparse format. Furthermore, we devise an implicit representation for graph incidence constraints. We demonstrate the parallel scalability with the use of threading OpenMP and MPI on the Stampede2 supercomputer. We compare this implementation with exact libraries and specialized libraries for the above problems in order to evaluate MWU's practical standing for both accuracy and performance among other methods. Our results show this implementation is faster than general purpose LP solvers (IBM CPLEX, Gurobi) in all of our experiments, and in some instances, outperforms state-of-the-art specialized parallel graph algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑