Language:   Search:   Contact
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 1243.49040
Dang, Yazheng; Gao, Yan
An extrapolated iterative algorithm for multiple-set split feasibility problem.
(English)
[J] Abstr. Appl. Anal. 2012, Article ID 149508, 12 p. (2012). ISSN 1085-3375; ISSN 1687-0409/e

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 {\it 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.
MSC 2000:
*49M30 Methods of successive approximation, not based on necessary cond.
90C25 Convex programming

Keywords: multiple-set split feasibility problem (MSSFP)

Highlights
Master Server