A Novel Relaxed Projective Method for Split Feasibility Problems

Teerapon Saelii, Suparat Kesornprom, Prasit Cholamjiak

Abstract

In this paper, we propose the modified projection algorithms for solving the split feasibilityproblem in Euclidean a spaces. A new stepsize is introduced by using the self-adaptive technique.Convergence analysis is discussed under suitable conditions. Numerical experiments show thatthe proposed methods are more efficient than other projective algorithms in comparison.