Three-Step Projective Methods for Solving the Split Feasibility Problems
Open Access
- 6 August 2019
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 7 (8) , 712
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.Keywords
This publication has 23 references indexed in Scilit:
- On the rate of convergence of Mann, Ishikawa, Noor and SP-iterations for continuous functions on an arbitrary intervalJournal of Computational and Applied Mathematics, 2011
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problemInverse Problems, 2010
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spacesInverse Problems, 2010
- Approximating Curve and Strong Convergence of the CQ Algorithm for the Split Feasibility ProblemJournal of Inequalities and Applications, 2010
- Three-step iterations for variational inequalities and nonexpansive mappingsApplied Mathematics and Computation, 2007
- An efficient three-step iterative method with sixth-order convergence for solving nonlinear equationsInternational Journal of Computer Mathematics, 2007
- A note on the CQ algorithm for the split feasibility problemInverse Problems, 2005
- The relaxed CQ algorithm solving the split feasibility problemInverse Problems, 2004
- A unified treatment of some iterative algorithms in signal processing and image reconstructionInverse Problems, 2003
- Iterative oblique projection onto convex sets and the split feasibility problemInverse Problems, 2002