非凸两分块优化问题的一类惯性对称正则化交替方向乘子法

展开
  • 1. 重庆师范大学数学科学学院, 重庆 401331
彭建文, E-mail: jwpeng168@hotmail.com

收稿日期: 2021-04-21

  网络出版日期: 2023-09-14

基金资助

国家自然科学基金重大项目(11991024);国家自然科学基金面上项目(12271071);重庆英才·创新创业领军人才·创新创业示范团队项目(CQYC20210309536);重庆市高校创新研究群体项目(CXQT20014);重庆市自然科学基金(cstc2021jcyj-msxmX0300)

A class of inertial symmetric regularization alternating direction method of multipliers for nonconvex two-block optimization

Expand
  • 1. College of Mathematical Sciences, Chongqing Normal University, Chongqing 401331, China

Received date: 2021-04-21

  Online published: 2023-09-14

摘要

交替方向乘子法(ADMM)是一个求解可分离凸优化问题的的有效方法,然而,当目标函数存在非凸函数时,ADMM或许不收敛。本文提出一类带线性等式约束的非凸两分块优化问题的惯性对称正则化交替方向乘子法。在适当的假设条件下,建立了算法的全局收敛性。其次,在效益函数满足Kurdyka-Łojasiewicz (KL)性质时,建立了算法的强收敛性。最后,对算法进行了数值实验,结果说明算法是一种有效的方法。

本文引用格式

彭建文, 雷宏旺 . 非凸两分块优化问题的一类惯性对称正则化交替方向乘子法[J]. 运筹学学报, 2023 , 27(3) : 37 -52 . DOI: 10.15960/j.cnki.issn.1007-6093.2023.03.003

Abstract

The alternating direction method of multipliers(ADMM) is an valid method for solving separable convex optimization problems, nevertheless, when the objective function has a nonconvex function, ADMM may not converge. This paper proposes an inertial symmetric regularization alternating direction method of multipliers for nonconvex two-block optimization problem with linear equality constraints. Under the appropriate hypothesis conditions, the global convergence of the algorithm is established. Secondly, When the benefit function satisfies the Kurdyka-Łojasiewicz(KL) property, the strong convergence of the algorithm is established. Finally, numerical experiments are performed on the algorithm, and the results show that the algorithm is an effective method.

参考文献

1 AlexanderG J,RachfordH H.On the numerical solution of the heat conduction problem in 2 and 3 space variables[J].Transations of the American Mathematical Society,1956,82(2):421-439.
2 ChaoM T,ChenC Z,ZhangH B.A linearized alternating direction method of multipliers with substitution procedure[J].Asia Pacific Journal of Operational Research,2015,32(3):1550011.
3 GlowinskiR.Numerical Methods for Nonlinear Variational Problems[M].New York:Springer-Verlag,1984.
4 Gu Y, Jiang B, Han D R. A semi-proximal-based strictly contractive Peaceman-Rachford splitting method[J]. 2015, arXiv: 1506.02221.
5 HanD R,YuanX M.A not on the alternating direction method of multipliers[J].SIAM Journal on Numerical Analysis,2013,51(6):3446-3457.
6 HeB S,MaF,YuanX M.Convergence study on the symmetric version of ADMM with larger step sizes[J].SIAM Journal on Imaging Sciences,2016,9(3):1467-1501.
7 YangW H,HanD R.Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems[J].SIAM Journal on Numerical Analysis,2016,54(2):625-640.
8 LionP,MercierB.Splitting algorithms for the sum of two nonlinear operators[J].SIAM Journal on Numerical Analysis,1979,16(6):964-979.
9 PeacemanD W,RachfordH H.The numerical solution of parabolic and elliptic differential equations[J].Journal of the Society for Industrial and Applied Mathematics,1955,3(1):28-41.
10 Bai J C, Liang J L, Guo K, et al. Accelerated symmetric ADMM and its applications in signal processing[J]. 2019, arXiv: 1906.12015.
11 GuoK,HanD R,WuT T.Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints[J].International Journal of Computer Mathematics,2017,94(8):1653-1669.
12 Wang F, Xu Z B, Xu H K. Convergence of Bregman alternating direction method with multipliers for nonconvex composite problems[J]. 2014, arXiv: 1410.8625.
13 LiuM X,JianJ B.An ADMM-based SQP method for separably smooth nonconvex optimization[J].Journal of Inequalities and Applications,2020,2020(1):1-17.
14 JianJ B,ZhangY,ChaoM T.A regularized alternating direction method of multiplier for a class of nonconvex problems[J].Journal of Inequalities and Applications,2019,2019(1):1-16.
15 BotR I,NguyenD K.The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates[J].Mathematics of Operation Research,2018,45(2):1-13.
16 WuZ M,LiM,WangD,et al.A symmetric alternating direction method of multipliers for separable nonconvex minimization problems[J].Asia Pacific Journal of Operational Research,2017,34(6):1750030.
17 WangY,YinW T,ZengJ S.Global convergence of ADMM in nonconvex nonsmooth optimization[J].Journal of Scientific Computing,2018,2018,1-35.
18 简金宝,刘鹏杰,江羡珍.非凸多分块优化部分对称正则化交替方向乘子法[J].数学学报,2021,64(6):1005-1026.
19 BotR I,CsetnekE R,LaszloS C.An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions[J].Euro Journal on Computational Optimization,2016,4(1):3-25.
20 AlvarezF.Weak convergence of a relaxed and inertial hybrid projection-proximal point algorithm for maximal monotone operators in Hilbert space[J].SIAM Journal on Optimization,2004,14(3):773-782.
21 MoudafiA,ElizabethE.Approximate inertial proximal methods using the enlargement of maximal monotone operators[J].International Journal of Pure and Applied Mathematics,2003,5(3):283-299.
22 WuZ M,LiC,LiM.Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems[J].Journal of Global Optimization,2020,2020(6):1-28.
23 ChaoM T,ZhangY,JianJ B.An inertial proximal alternating direction method of multipliers for nonconvex optimization[J].International Journal of Computer Mathematics,2021,98(6):1199-1217.
24 AlvarezF.On the minimizing property of a second order dissipative system in Hilbert space[J].SIAM Journal on Control and Optimization,2000,38(4):1102-1119.
25 XuZ B,ChangX,XuF,et al.$l$-$1/2$ regularization: a thresholding representation theory and a fast solver[J].IEEE Transactions on Neural Networks and Learning Systems,2012,23(7):1013-1027.
26 ZengJ,FangJ,XuZ B.Sparse SAR imaging based on $l$-$1/2$ regularization[J].Science China Information Sciences,2012,55(8):39-59.
27 Arunachalam S, Saranya R, Sangeetha N. Hybrid artificial bee colony algorithm and simulated annealing algorithm for combined economic and emission dispatch including valve point effect[C]// International Conference on Swarm, Evolutionary, and Memetic Computing, 2013: 1-32.
28 RockafellarR T,WetsR J B.Variational Analysis[M].Berlin:Springer Science and Business Media,2009.
29 AttouchH,BolteJ,SvaiterB F.Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting and regularized Gauss-Seidel methods[J].Mathematical Programming,2013,137(1/2):91-129.
30 WangF H,CaoW F,XuZ B.Convergence of multi-block Bregman ADMM for nonconvex composite problems[J].Science China Information Sciences,2018,61(12):1-12.
31 NesterovY.Introductory Lectures on Convex Optimization: A Basic Course[M].New York:Springer,2004.
文章导航

/