4.6 Article

Cyclic algorithms for split feasibility problems in Hilbert spaces

Journal

NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS
Volume 74, Issue 12, Pages 4105-4111

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.na.2011.03.044

Keywords

Convex feasibility; Split feasibility; Split common fixed point; Nonexpansive mapping; Class-T operator; Iterative algorithm

Ask authors/readers for more resources

The split common fixed point problem (SCFPP) is equivalently converted to a common fixed point problem of a finite family of class-T operators. This enables us to introduce new cyclic algorithms to solve the SCFPP and the multiple-set split feasibility problem. (C) 2011 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available