An alternated inertial algorithm with weak and linear convergence for solving monotone inclusions

被引:0
|
作者
Tan, Bing [1 ,2 ]
Qin, Xiaolong [3 ]
机构
[1] Southwest Petr Univ, Sch Sci, Chengdu 610500, Peoples R China
[2] Univ British Columbia, Dept Math, Kelowna, BC V1V 1V7, Canada
[3] Hangzhou Normal Univ, Dept Math, Hangzhou 311121, Peoples R China
关键词
Inclusion problems; alternated inertial; forward-backward method; Tseng's method; projection and contraction method; linear convergence; PROJECTION; SUM;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Inertial-based methods have the drawback of not preserving the Fejer monotonicity of iterative sequences, which may result in slower convergence compared to their corresponding non-inertial versions. To overcome this issue, Mu and Peng [Stat. Optim. Inf. Com-put. 3 (2015), 241-248; MR3393305] suggested an alternating inertial method that can recover the Fejer monotonicity of even sub-sequences. In this paper, we propose a modified version of the forward-backward algorithm with alternating inertial and relaxation effects to solve an inclusion problem in real Hilbert spaces. The weak and linear convergence of the presented algorithm is established under suitable and mild conditions on the involved operators and parameters. Furthermore, the Fejer monotonicity of even subsequences generated by the proposed algorithm with respect to the solution set is recovered. Finally, our tests on image restoration problems demonstrate the superiority of the proposed algorithm over some related results.
引用
收藏
页码:321 / 345
页数:25
相关论文
共 50 条