Journal of the Operations Research Society of China ›› 2024, Vol. 12 ›› Issue (2): 298-340.doi: 10.1007/s40305-023-00535-8

Previous Articles     Next Articles

A Bregman-Style Improved ADMM and its Linearized Version in the Nonconvex Setting: Convergence and Rate Analyses

Peng-Jie Liu1,2,3, Jin-Bao Jian2, Hu Shao1, Xiao-Quan Wang1, Jia-Wei Xu4, Xiao-Yu Wu1   

  1. 1 School of Mathematics, Jiangsu Center for Applied Mathematics, China University of Mining and Technology, Xuzhou 221116, Jiangsu, China;
    2 School of Mathematics and Physics, Center for Applied Mathematics of Guangxi, Guangxi Minzu University, Nanning 530006, Guangxi, China;
    3 Department of Civil and Environmental Engineering, The Hong Kong Polytechnic University, Hong Kong, China;
    4 School of Mathematics and Computational Science, Xiangtan University, Xiangtan 411105, Hunan, China
  • Received:2022-09-09 Revised:2023-07-06 Online:2024-06-30 Published:2024-06-12
  • Contact: Jin-Bao Jian, Peng-Jie Liu, Hu Shao, Xiao-Quan Wang, Jia-Wei Xu, Xiao-Yu Wu E-mail:jianjb@gxu.edu.cn;liupengjie2019@163.com;shaohu@cumt.edu.cn;wxq4869@163.com;1906301035@st.gxu.edu.cn;xiaoyuwu0218@163.com
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (Nos. 12171106 and 72071202), the Natural Science Foundation of Guangxi Province (No. 2020GXNSFDA238017) and Key Laboratory of Mathematics and Engineering Applications, Ministry of Education.

Abstract: This work explores a family of two-block nonconvex optimization problems subject to linear constraints. We first introduce a simple but universal Bregman-style improved alternating direction method of multipliers (ADMM) based on the iteration framework of ADMM and the Bregman distance. Then, we utilize the smooth performance of one of the components to develop a linearized version of it. Compared to the traditional ADMM, both proposed methods integrate a convex combination strategy into the multiplier update step. For each proposed method, we demonstrate the convergence of the entire iteration sequence to a unique critical point of the augmented Lagrangian function utilizing the powerful Kurdyka–Łojasiewicz property, and we also derive convergence rates for both the sequence of merit function values and the iteration sequence. Finally, some numerical results show that the proposedmethods are effective and encouraging for the Lasso model.

Key words: Nonconvex optimization, Alternating direction method of multipliers, Kurdyka–Łojasiewicz property, Convergence rate

CLC Number: