Full Text: PDF
Volume 5, Issue 4, 1 August 2021, Pages 549-559
Abstract. In this paper, we study the inertial relaxed CQ algorithm for solving a split feasibility problem in Hilbert spaces. For this algorithm, we establish two convergence theorems under two different conditions. The first condition is weaker than the existing condition, and the second condition is completely different from the existing one. Moreover the preliminary numerical experiment indicates that our proposed algorithms converge faster than the existing algorithms.
How to Cite this Article:
Haiying Li, Fenghui Wang, Hai Yu, On the inertial relaxed CQ algorithm in Hilbert spaces, J. Nonlinear Var. Anal. 5 (2021), 549-559.