arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.00728math.OC
收藏

重启PDHG方法在解线性规划问题中的高概率多项式时间复杂度

High-Probability Polynomial-Time Complexity of Restarted PDHG for Linear Programming

Northwestern University(西北大学)

Zikai Xiong

AI总结:

本文证明了在高斯分布假设下,重启PDHG方法在解线性规划问题时具有高概率多项式时间复杂度,并提供了实验验证。

摘要:

重启对偶混合梯度法(rPDHG)是一种一阶方法,近年来因其在求解线性规划(LP)问题中的计算效率而受到广泛关注。尽管其在实际应用中表现出色,但rPDHG的理论迭代界可能呈指数级恶化。为了缩小理论与实践之间的差距,我们展示了在数据实例生成概率分布的假设下,rPDHG在高概率意义上实现多项式时间复杂度。我们不仅考虑高斯分布模型,还考虑亚高斯分布模型。对于具有m个线性约束和n个决策变量的标准形式LP实例,我们证明rPDHG在$\widetilde{O}\left(\tfrac{n^{2.5}m^{0.5}}δ\right)$次迭代中收敛到最优基,随后在$O\left(\frac{n^{0.5}m^{0.5}}δ\ln\big(\tfrac{1}{\varepsilon}\big)\right)$次迭代中计算一个$\varepsilon$-最优解。这些界在概率至少为$1-δ$的情况下成立,其中$δ$不是指数级小的。第一阶段的界在高斯分布模型下进一步改进到$\widetilde{O}\left(\frac{n^{2.5}}δ\right)$。实验结果验证了迭代次数的尾部行为和对问题维度的多项式依赖性。作为我们概率分析的应用,我们探讨了最优解各分量之间的差异对rPDHG性能的影响,并提供了生成具有挑战性的LP测试实例的指导方针。

英文摘要:

The restarted primal-dual hybrid gradient method (rPDHG) is a first-order method recently known for its computational effectiveness in solving linear programming (LP) problems. Despite its impressive practical performance, the theoretical iteration bounds for rPDHG can be exponentially poor. To investigate this gap from a probabilistic perspective, we show that rPDHG achieves polynomial-time complexity in a high-probability sense, under assumptions on the probability distribution from which the data instance is generated. We consider both Gaussian and more general sub-Gaussian distribution models. For standard-form LP instances with $m$ constraints and $n$ variables, our bounds take a particularly simple form when $m$ is not too close to $n$: rPDHG iterates settle on the optimal basis in $\widetilde{O}\left(\tfrac{n^{2.5}m^{0.5}}δ\right)$ iterations, followed by $O\left(\frac{n^{0.5}m^{0.5}}δ\ln\big(\tfrac{1}{\varepsilon}\big)\right)$ iterations to compute an $\varepsilon $-optimal solution, with probability at least $1-δ$ for $δ$ that is not exponentially small. The Stage-I bound further improves to $\widetilde{O}\left(\frac{n^{2.5}}δ\right)$ in the Gaussian distribution model. Experimental results confirm the tail behavior and the polynomial-time dependence on problem dimensions of the iteration counts. As an application of our probabilistic analysis, we explore how the disparity among the components of the optimal solution bears on the performance of rPDHG, and we provide guidelines for generating challenging LP instances.

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

↑