Multiple-set split feasibility problems for total asymptotically strict pseudocontractions mappings

Abstract

The purpose of this article is to propose and investigate an algorithm for solving the multiple-set split feasibility problems for total asymptotically strict pseu-docontractions mappings in infinite-dimensional Hilbert spaces. The results presented in this article improve and extend some recent results of A.

Strong Convergence Algorithms of the Split Common Fixed Point Problem for Total Quasi-Asymptotically Pseudocontractive Operators

“…Abstract and Applied Analysis 7 Remark 12. Algorithm (7) and Theorems 10 and 11 improve and extend the corresponding results of Censor and Segal [2], Moudafi [3,4], Mohammed [5,6], Chang et al [11,13], Yang et al [12], and others.…”

“…Furthermore, for several different strong convergence recursions with nonexpansive operators for solving the SCFPP see [9,10]. For the purpose of generalization, papers [11][12][13] discussed the total asymptotically strictly pseudocontractive mappings and asymptotically strict pseudocontractive mappings for solving (2) and multiple-set fixed point problem (MSSFP) by the following iteration:…”

Iterative methods for convex proximal split feasibility problems and fixed point problems

“…In all our results in this paper, our iterative scheme is proposed with a way of selecting the step-size such that the implementation of our algorithm does not need any prior information about the operator norm ||A|| because the calculation or at least an estimate of the operator norm ||A|| is very difficult, if not an impossible task. Therefore, improved on the results of Chang et al [6], Yang et al [22], Cholamjiak and Shehu [7] and other related works. 4.…”

Strong Convergence Theorems for Split Common Fixed Point Problem of Bregman Generalized Asymptotically Nonexpansive Mappings in Banach Spaces

“…In 2004, Yang [5] presented a relaxed CQ-algorithm for solving the SFP, where at n-th iteration, the projections onto C and Q were replaced with the halfspaces C n and Q n , respectively.…”