17-08-2019 | Original Paper | Issue 3/2020
On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- Journal:
- Numerical Algorithms > Issue 3/2020
Important notes
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Abstract
In this work, based on the gradient method and the relaxed CQ algorithm introduced by López et al. (Inverse Probl. 28, 085004, 2012), we introduce two gradient-CQ algorithms for solving the split feasibility problem in the framework of Hilbert spaces. The main advantage of the proposed method is not only that the variable stepsizes depending on the information from the current iterate not the operator norm are chosen but also that the metric projection onto half-spaces, which is convenient to be calculated, is taken into account. Then both weak and strong convergence are proved under some mild conditions. Finally, numerical experiments in signal processing reveal that the proposed algorithm is effective and outruns those of Yang, López et al., Gibali et al., and others.
