Two iterative algorithms for solving the split common fixed point problems

Abstract

The purpose of this paper is to study the split common fixed point problems (SCFP) involved in nonexpansive mappings in real Hilbert space. We introduce two iterative algorithms for finding a solution of the SCFP involved in nonexpansive mappings, where one is a Mann-type iterative algorithm and another is a Halpern-type iterative algorithm.