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

Peaceman-Rachford分裂方法在求解凸优化问题时遍历收敛

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems

Kaihuang Chen, Defeng Sun, Yancheng Yuan, Guojun Zhang, Xinyuan Zhao

AI总结:

该研究证明带半邻近项的Peaceman-Rachford分裂方法的遍历序列对凸优化问题收敛,实验显示带重启策略的该方法遍历序列性能优于Douglas-Rachford分裂方法的对应序列,更适合求解大规模凸优化问题。

摘要:

本文证明了带半邻近项的Peaceman-Rachford(PR)分裂方法生成的遍历序列对凸优化问题(COPs)具有收敛性。在线性规划基准数据集上的数值实验进一步表明,采用重启策略时,带半邻近项的PR分裂方法的遍历序列性能始终优于Douglas-Rachford(DR)分裂方法的逐点序列和遍历序列。这些发现表明,与DR类方法相比,重启的遍历PR分裂方法是求解大规模凸优化问题的更有效选择。

英文摘要:

In this paper, we prove that the ergodic sequence generated by the Peaceman-Rachford (PR) splitting method with semi-proximal terms converges for convex optimization problems (COPs). Numerical experiments on the linear programming benchmark dataset further demonstrate that, with a restart strategy, the ergodic sequence of the PR splitting method with semi-proximal terms consistently outperforms both the point-wise and ergodic sequences of the Douglas-Rachford (DR) splitting method. These findings indicate that the restarted ergodic PR splitting method is a more effective choice for tackling large-scale COPs compared to its DR counterparts.

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

↑