首页 | 本学科首页   官方微博 | 高级检索  
     

求解三块变量约束凸优化问题的邻近部分平行分裂算法
引用本文:申远,李俊峄. 求解三块变量约束凸优化问题的邻近部分平行分裂算法[J]. 吉林大学学报(理学版), 2023, 61(1): 8-14
作者姓名:申远  李俊峄
作者单位:南京财经大学 应用数学学院, 南京 210023
摘    要:考虑线性约束三块变量的凸优化问题,在部分平行分裂算法中选取不同步长参数的基础上,提出一种邻近部分平行分裂算法,并证明该算法的收敛性.该算法通过在部分平行分裂算法中选取不同步长参数的基础上,在一个子问题的目标函数中加入邻近项,建立新的参数条件.与部分平行分裂算法相比,该算法极大放松了参数条件,使算法更具实用性.数值实验结果表明,与已有算法相比,该算法的迭代次数和计算时间均显著下降.

关 键 词:凸优化  交替方向乘子法  部分平行分裂算法  邻近项
收稿时间:2022-04-10

Proximal Partial Parallel Splitting Algorithm for Solving Three Block Variable Constrained Convex Optimization Problems
SHEN Yuan,LI Junyi. Proximal Partial Parallel Splitting Algorithm for Solving Three Block Variable Constrained Convex Optimization Problems[J]. Journal of Jilin University: Sci Ed, 2023, 61(1): 8-14
Authors:SHEN Yuan  LI Junyi
Affiliation:School of Applied Mathematics, Nanjing University of Finance & Economics, Nanjing 210023, China
Abstract:We considered the 3-block varibles convex optimization problem with linear constraints. In the partial parallel splitting algorithm (APCM), on the basis of selecting different step parameters in the correction step,  we proposed a proximal partial parallel splitting method (PAPCM), and proved the convergence of the proposed  algorithm. On the basis of selecing different step parameters in APCM, adding a proximal term to the objective function of a sub-problem, and a new parameter condition was established. Compared with  APCM, the parameter condition of the proposed algorithm was  greatly relaxed, making the algorithm more practical. Numerical results show that, compared with the existing algorithms, the iteration number and computation time of the proposed algorithm are both significantly reduced.
Keywords:convex optimization  alternating direction multiplier method  partial parallel splitting algorithm  proximal term  
点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息
点击此处可从《吉林大学学报(理学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号