Cyclic algorithms for split feasibility problems in Hilbert spaces期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Cyclic algorithms for split feasibility problems in Hilbert spaces

Authors:	Fenghui Wang

Affiliation:	^a Department of Mathematics, Luoyang Normal University, Luoyang 471022, China ^b Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung 80424, Taiwan ^c Department of Mathematics, College of Science, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia

Abstract:	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.

Keywords:	47J25 47N10 65J15 90C25
本文献已被 ScienceDirect 等数据库收录！