Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces

摘要

In this paper, for the multiple-sets split feasibility problem, that is to find a point closest to a family of closed convex subsets in one space such that its image under a linear bounded mapping will be closest to another family of closed convex subsets in the image space, we study several iterative methods for finding a solution, which solves a certain variational inequality. We show that particular cases of our algorithms are some improvements for existing ones in literature. We also give two numerical examples for illustrating our algorithms.