趋同(经济学)
最优化问题
收敛速度
正多边形
增广拉格朗日法
应用数学
算法
凸函数
缩小
作者
Yuan Shen,Qianming Gao,Xue Yin
标识
DOI:10.1016/j.apnum.2021.09.011
摘要
Abstract The alternating direction method of multipliers (ADMM) has been proved to be effective for solving two-block convex minimization model subject to linear constraints. However, the convergence of multiple-block convex minimization model with linear constraints may not be guaranteed without additional assumptions. Recently, some parallel multi-block ADMM algorithms which solve the subproblems in a parallel way have been proposed. This paper is a further study on this method with the purpose of improving the parallel multi-block ADMM algorithm by introducing more parameters. We propose two multi-parameter parallel ADMM algorithms with proximal point terms attached to all subproblems. Comparing with some popular parallel ADMM-based algorithms, the parameter conditions of the new algorithms are relaxed. Experiments on both real and synthetic problems are conducted to justify the effectiveness of the proposed algorithms compared to several efficient ADMM-based algorithms for multi-block problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI