arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.6680math.OC
收藏

分布式二次规划ADMM算法的最优尺度

Optimal scaling of the ADMM algorithm for distributed quadratic programming

André Teixeira, Euhanna Ghadimi, Iman Shames, Henrik Sandberg, Mikael Johansson

摘要:

研究了求解一类分布式二次规划问题的交替方向乘子法(ADMM)算法的最优尺度问题。缩放对应于ADMM步长和松弛因子,以及底层通信图的边权重。我们优化这些参数,以产生最小的收敛因子的算法。明确的表达式推导出的步长和松弛因子,以及相应的收敛因子。数值模拟证明了我们的结果,并强调了最佳缩放ADMM算法的好处。

英文摘要:

This paper presents optimal scaling of the alternating directions method of multipliers (ADMM) algorithm for a class of distributed quadratic programming problems. The scaling corresponds to the ADMM step-size and relaxation parameter, as well as the edge-weights of the underlying communication graph. We optimize these parameters to yield the smallest convergence factor of the algorithm. Explicit expressions are derived for the step-size and relaxation parameter, as well as for the corresponding convergence factor. Numerical simulations justify our results and highlight the benefits of optimally scaling the ADMM algorithm.

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

↑