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 条
[31]   Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems [J].
Zhongming Wu ;
Ye Song ;
Fan Jiang .
Optimization Letters, 2024, 18 :447-470
[32]   Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems [J].
Wu, Zhongming ;
Song, Ye ;
Jiang, Fan .
OPTIMIZATION LETTERS, 2024, 18 (02) :447-470
[33]   Parallel Alternating Direction Primal-Dual (PADPD) Algorithm for Multi-Block Centralized Optimization [J].
Shaho Alaviani, Seyyed ;
Kelkar, Atul G. .
JOURNAL OF COMPUTING AND INFORMATION SCIENCE IN ENGINEERING, 2023, 23 (05)
[34]   A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming [J].
Shen, Yuan ;
Zuo, Yannian ;
Zhang, Xiayang .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2021, 393
[35]   Randomized Neural Networks Based Decentralized Multi-Task Learning via Hybrid Multi-Block ADMM [J].
Ye, Yu ;
Xiao, Ming ;
Skoglund, Mikael .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2021, 69 :2844-2857
[36]   A DISTRIBUTED DOUGLAS-RACHFORD SPLITTING METHOD FOR SOLVING LINEAR CONSTRAINED MULTI-BLOCK WEAKLY CONVEX PROBLEMS [J].
Hu, Leyu ;
Xie, Jiaxin ;
Cai, Xingju ;
Han, Deren .
INVERSE PROBLEMS AND IMAGING, 2025, 19 (04) :632-659
[37]   A distributed Douglas-Rachford splitting method for multi-block convex minimization problems [J].
He, Hongjin ;
Han, Deren .
ADVANCES IN COMPUTATIONAL MATHEMATICS, 2016, 42 (01) :27-53
[38]   Distributed Multi-block Partially Symmetric Bregman ADMM for Nonconvex and Nonsmooth Sharing Problem [J].
Cui, Tian-Tian ;
Dang, Ya-Zheng ;
Gao, Yan .
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2025,
[39]   Inexact Alternating-Direction-Based Contraction Methods for Separable Linearly Constrained Convex Optimization [J].
Guoyong Gu ;
Bingsheng He ;
Junfeng Yang .
Journal of Optimization Theory and Applications, 2014, 163 :105-129
[40]   Inexact Alternating-Direction-Based Contraction Methods for Separable Linearly Constrained Convex Optimization [J].
Gu, Guoyong ;
He, Bingsheng ;
Yang, Junfeng .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2014, 163 (01) :105-129