A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization

被引:10
作者
Shen, Yuan [1 ]
Gao, Qianming [1 ]
Yin, Xue [1 ]
机构
[1] Nanjing Univ Finance & Econ, Sch Appl Math, Nanjing 210023, Peoples R China
关键词
Multi-block; Convex optimization; Parallel computing; Proximal point algorithm; Alternating direction method of multipliers; JACOBIAN DECOMPOSITION; MINIMIZATION;
D O I
10.1016/j.apnum.2021.09.011
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. (C) 2021 IMACS. Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:369 / 388
页数:20
相关论文
共 50 条
[21]   Iteration Complexity Analysis of Multi-block ADMM for a Family of Convex Minimization Without Strong Convexity [J].
Lin, Tianyi ;
Ma, Shiqian ;
Zhang, Shuzhong .
JOURNAL OF SCIENTIFIC COMPUTING, 2016, 69 (01) :52-81
[22]   Iteration Complexity Analysis of Multi-block ADMM for a Family of Convex Minimization Without Strong Convexity [J].
Tianyi Lin ;
Shiqian Ma ;
Shuzhong Zhang .
Journal of Scientific Computing, 2016, 69 :52-81
[23]   A MODIFIED STRICTLY CONTRACTIVE PEACEMAN-RACHFORD SPLITTING METHOD FOR MULTI-BLOCK SEPARABLE CONVEX PROGRAMMING [J].
Jiang, Su-Hong ;
Li, Min .
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2018, 14 (01) :397-412
[24]   A Homotopy Alternating Direction Method of Multipliers for Linearly Constrained Separable Convex Optimization [J].
Yang J. ;
Dai Y.-Q. ;
Peng Z. ;
Zhuang J.-P. ;
Zhu W.-X. .
Journal of the Operations Research Society of China, 2017, 5 (02) :271-290
[25]   Convergence of multi-block Bregman ADMM for nonconvex composite problems [J].
Wang, Fenghui ;
Cao, Wenfei ;
Xu, Zongben .
SCIENCE CHINA-INFORMATION SCIENCES, 2018, 61 (12)
[26]   A MAJORIZED ADMM WITH INDEFINITE PROXIMAL TERMS FOR LINEARLY CONSTRAINED CONVEX COMPOSITE OPTIMIZATION [J].
Li, Min ;
Sun, Defeng ;
Toh, Kim-Chuan .
SIAM JOURNAL ON OPTIMIZATION, 2016, 26 (02) :922-950
[27]   Convergence analysis of generalized ADMM with majorization for linearly constrained composite convex optimization [J].
Hongwu Li ;
Haibin Zhang ;
Yunhai Xiao ;
Peili Li .
Optimization Letters, 2024, 18 :1173-1200
[28]   A linear algebra perspective on the random multi-block ADMM: the QP case [J].
Cipolla, Stefano ;
Gondzio, Jacek .
CALCOLO, 2023, 60 (04)
[29]   A linear algebra perspective on the random multi-block ADMM: the QP case [J].
Stefano Cipolla ;
Jacek Gondzio .
Calcolo, 2023, 60
[30]   A proximal Peaceman-Rachford splitting method for solving the multi-block separable convex minimization problems [J].
Wu, Zhongming ;
Liu, Foxiang ;
Li, Min .
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2019, 96 (04) :708-728