Two Relaxed CQ Methods for the Split Feasibility Problem with Multiple Output Sets

In this paper, two relaxed CQ algorithms with non-inertial and inertial steps are proposed for solving the split feasibility problems with multiple output sets (SFPMOS) in infinite-dimensional real Hilbert spaces. The step size is determined dynamically without requiring prior information about the operator norm. Furthermore, the proposed algorithms are proven to converge strongly to the minimum-norm solution of the SFPMOS. Some applications of our main results regarding the solution of the split feasibility problem are presented. Finally, we give two numerical examples to illustrate the efficiency and implementation of our algorithms in comparison with existing algorithms in the literature.