Strong convergence of alternated inertial \(CQ\) relaxed method with application in signal recovery

DOI10.1007/s40314-021-01567-7zbMath1499.65213OpenAlexW3215719832MaRDI QIDQ2064964

Guash Haile Taddele, Abdulkarim Hassan Ibrahim, Poom Kumam, Kanokwan Sitthithakerngkiet, Jamilu Abubakar

Publication date: 6 January 2022

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-021-01567-7

zbMATH Keywords

strong convergenceinverse problemcompressed sensingsplit feasibility problemhalf-spaceinertial technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52)

Related Items

Approximation methods with inertial term for large-scale nonlinear monotone equations ⋮ Relaxed viscosity-type iterative methods with application to compressed sensing ⋮ A unified scheme for solving split inclusions with applications ⋮ An inertial Halpern-type algorithm involving monotone operators on real Banach spaces with application to image recovery problems

Cites Work

• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• Weak and strong convergence theorems for nonspreading-type mappings in Hilbert spaces
• Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
• Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces
• An inertial forward-backward algorithm for monotone inclusions
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• A multiprojection algorithm using Bregman projections in a product space
• A new self-adaptive CQ algorithm with an application to the LASSO problem
• \(l_1\)-\(l_2\) regularization of split feasibility problems
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
• A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
• New inertial relaxed method for solving split feasibilities
• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• Three new iterative methods for solving inclusion problems and related problems
• A new CQ algorithm for solving split feasibility problems in Hilbert spaces
• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• Inertial accelerated algorithms for solving a split feasibility problem
• Solving the split feasibility problem without prior knowledge of matrix norms
• The multiple-sets split feasibility problem and its applications for inverse problems
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• A First-Order Primal-Dual Algorithm with Linesearch
• The Split Common Null Point Problem
• Some methods of speeding up the convergence of iteration methods
• Convex analysis and monotone operator theory in Hilbert spaces