An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality Problem

The multiple-sets split equality problem (MSSEP) requires finding a point x is an element of boolean AND C-N(i=1)i, y is an element of boolean AND(M)(j=1)Q(j) such that Ax = By, where N and M are positive integers, {C-1, C-2, ... ,C-N} and {Q(1), Q(2), ... , Q(M)} are closed convex subsets of Hilbert spaces. H-1, H-2, respectively, and A : H-1 -> H-3, B : H-2 -> H-3 are two bounded linear operators. When N = M = 1, the MSSEP is called the split equality problem (SEP). If B = I, then the MSSEP and SEP reduce to the well-known multiple-sets split feasibility problem (MSSFP) and split feasibility problem (SFP), respectively. One of the purposes of this paper is to introduce an iterative algorithm to solve the SEP and MSSEP in the framework of infinite-dimensional Hilbert spaces under some more mild conditions for the iterative coefficient.