Some subgradient extragradient type algorithms for solving split feasibility and fixed point problems

摘要

In this paper, we consider the split feasibility problem (SFP) in infinite-dimensional Hilbert spaces and propose some subgradient extragradient-type algorithms for finding a common element of the fixed-point set of a strict pseudocontraction mapping and the solution set of a split feasibility problem by adopting Armijo-like stepsize rule. We derive convergence results under mild assumptions. Our results improve some known results from the literature. Copyright (C) 2016 John Wiley & Sons, Ltd.