Outer reflected forward-backward splitting algorithm with inertial extrapolation step

被引:0
|
作者
Shehu, Yekini [1 ]
Jolaoso, Lateef O. [2 ,3 ]
Okeke, C. C. [4 ]
Xu, Renqi [5 ]
机构
[1] Zhejiang Normal Univ, Sch Math Sci, Jinhua, Peoples R China
[2] Univ Southampton, Sch Math Sci, Southampton, England
[3] Sefako Makgatho Hlth Sci Univ, Dept Math & Appl Math, Pretoria, South Africa
[4] Univ Witwatersrand, Sch Math, Johannesburg, South Africa
[5] Zhejiang Normal Univ, Sch Math Sci, Jinhua, Peoples R China
关键词
Three operator splitting; inertial extrapolation step; weak and strong convergence; non-asymptotic convergence rate; MONOTONE INCLUSIONS; THRESHOLDING ALGORITHM; CONVERGENCE; SHRINKAGE; SUM;
D O I
10.1080/02331934.2024.2391004
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper studies an outer reflected forward-backward splitting algorithm with an inertial step to find a zero of the sum of three monotone operators composing the maximal monotone operator, Lipschitz monotone operator, and a cocoercive operator in real Hilbert spaces. One of the interesting features of the proposed method is that both the Lipschitz monotone operator and the cocoercive operator are computed explicitly each with one evaluation per iteration. We obtain weak and strong convergence results under some easy-to-verify assumptions. We also obtain a non-asymptotic $ O(1/n) $ O(1/n) convergence rate of our proposed algorithm in a non-ergodic sense. We finally give some numerical illustrations arising from compressed sensing and image processing and show that our proposed method is effective and competitive with other related methods in the literature.
引用
收藏
页数:24
相关论文
共 50 条