2000 character limit reached
The split feasibility and fixed point equality problems for quasi-nonexpansive mappings in Hilbert spaces
Published 7 Oct 2016 in math.FA | (1610.02133v1)
Abstract: In this paper, we introduce a new problem called the split feasibility and fixed point equality problems (SFFPEP) and propose a new iterative algorithm for solving the problem (SFFPEP) for the class of quasi-nonexpansive mappings in Hilbert spaces. Furthermore, we study the convergence of the proposed algorithm. At the end, we give numerical example that illustrate our theoretical result. The SFFPEP is a generalization of the split feasibility problem (SFP), split feasibility and fixed point problems (SFFPP) and split equality fixed point problem (SEFPP).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.