Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing

被引:54
作者
Shehu, Yekini [1 ]
Iyiola, Olaniyi S. [2 ]
Ogbuisi, Ferdinard U. [3 ,4 ]
机构
[1] Zhejiang Normal Univ, Dept Math, Jinhua 321004, Zhejiang, Peoples R China
[2] Calif Univ Penn, Dept Math Comp Sci & Informat Syst, California, PA USA
[3] Univ Nigeria, Dept Math, Nsukka, Nigeria
[4] Univ KwaZulu Natal, Sch Math Stat & Comp Sci, Durban, South Africa
基金
新加坡国家研究基金会;
关键词
Halpern-type algorithm; Inertial terms; Nonexpansive mappings; Strong convergence; Hilbert spaces; STRONG-CONVERGENCE THEOREMS; MAXIMAL MONOTONE-OPERATORS; FIXED-POINTS; THRESHOLDING ALGORITHM; ACCRETIVE-OPERATORS; GRADIENT METHODS; PROXIMAL METHOD; APPROXIMATION; SEQUENCES; KRASNOSELSKII;
D O I
10.1007/s11075-019-00727-5
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Our interest in this paper is to introduce a Halpern-type algorithm with both inertial terms and errors for approximating fixed point of a nonexpansive mapping. We obtain strong convergence of the sequence generated by our proposed method in real Hilbert spaces under some reasonable assumptions on the sequence of parameters. As applications, we present some strong convergence results for monotone inclusion, variational inequality problem, linear inverse problem, and LASSO problem in Compressed Sensing. Our result improves the rate of convergence of existing Halpern method for monotone inclusion, variational inequality problem, linear inverse problem and LASSO problem in compressed sensing as illustrated in our numerical examples both in finite and infinite dimensional Hilbert spaces.
引用
收藏
页码:1321 / 1347
页数:27
相关论文
共 69 条
[1]   Weak convergence of a relaxed and inertial hybrid projection-proximal point algorithm for maximal monotone operators in Hilbert space [J].
Alvarez, F .
SIAM JOURNAL ON OPTIMIZATION, 2004, 14 (03) :773-782
[2]   An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping [J].
Alvarez, F ;
Attouch, H .
SET-VALUED ANALYSIS, 2001, 9 (1-2) :3-11
[3]  
[Anonymous], 1973, MATH STUDIES
[4]  
[Anonymous], 2003, SPRINGER SERIES OPER
[5]  
[Anonymous], 2007, SPGL1: A solver for large-scale sparse reconstruction
[6]  
[Anonymous], 1964, COMP MATH MATH PHYS+
[7]  
[Anonymous], 2020, Lectures on modern convex optimization, DOI 10.1137/1.9780898718829.ch6
[8]  
Ansari Q.H., 2018, Vector variational inequalities and vector optimization
[9]   THE RATE OF CONVERGENCE OF NESTEROV'S ACCELERATED FORWARD-BACKWARD METHOD IS ACTUALLY FASTER THAN 1/k2 [J].
Attouch, Hedy ;
Peypouquet, Juan .
SIAM JOURNAL ON OPTIMIZATION, 2016, 26 (03) :1824-1834
[10]  
Aubin JP., 1984, Applied nonlinear analysis