4.6 Article

Cyclic algorithms for split feasibility problems in Hilbert spaces

期刊

出版社

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

关键词

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

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据