Three-Step Projective Methods for Solving the Split Feasibility Problems

Abstract

In this paper, we focus on studying the split feasibility problem (SFP) in Hilbert spaces. Based on the CQ algorithm involving the self-adaptive technique, we introduce a three-step iteration process for approximating the solution of SFP. Then, the convergence results are established under mild conditions. Numerical experiments are provided to show the efficiency in signal processing. Some comparisons to various methods are also provided in this paper.