An extrapolated iterative algorithm for multiple-set split feasibility problem (Q437508)

Summary: The Multiple-Set Split Feasibility problem (MSSFP), as a generalization of the split feasibility problem, is to find a point in the intersection of a family of closed convex sets in one space such that its image under a linear transformation will be in the intersection of another family of closed convex sets in the image space. In \textit{Y. Censor} et al {''The multiple-sets split feasibility problem and its applications for inverse problems, Inverse Probl. 21, No. 6, 2071-2084 (2005; Zbl 1089.65046)] a method is proposed for solving the MSSFP, whose efficiency depends heavily on the step size, a fixed constant related to the Lipschitz constant of \(\nabla p(x)\) which may be slow. In this paper, we present an accelerated algorithm by introducing an extrapolated factor to solve the multiple-set split feasibility problem. The framework encompasses the algorithm presented by Censor [loc. cit.]. The convergence of the method is investigated, and numerical experiments are provided to illustrate the benefits of the extrapolation.}