Self-adaptive CQ-type algorithms for the split feasibility problem involving two bounded linear operators in Hilbert spaces.

In this article, we consider and investigate a split convex feasibility problem involving two bounded linear operators in Hilbert spaces. We introduce a self-adaptive CQ-type algorithm by selecting the stepsize which is independent of the operator norms and establish a strong convergence result of the proposed algorithm under some mild control conditions. Moreover, we propose a self-adaptive relaxed CQ-type algorithm for solving the problem constrained by sub-level sets of convex functions. A numerical example and an application in compressed sensing are also given to illustrate the convergence behaviour of our proposed algorithms. Our results in this paper improve and generalize some existing results in the literature. [ABSTRACT FROM AUTHOR]