Abstract
We present a generalized Ishikawa iterative algorithm with an error term and a variable generalized Ishikawa iterative algorithm. Leveraging the geometric symmetry inherent in uniformly convex Banach spaces, we establish their respective weak convergence theorems for nonexpansive mappings. As applications, we extend several recent results in the literature related to the proximal point algorithm and the split feasibility problem. Consequently, we propose a hyper-generalized proximal point algorithm and a hyper-generalized perturbation CQ algorithm. Our work not only broadens the application scope of these methods but also highlights the foundational role of symmetric space properties in ensuring algorithmic convergence.
1. Introduction
This paper adopts the following conventional notations: H for a Hilbert space, E for a real Banach space with its dual . for the set of fixed points of an operator T. Furthermore, the symbols ⇀ and → denote weak and strong convergence, respectively, while represents the set of all weak convergence points of the sequence .
Fixed point theory for nonexpansive mappings plays a pivotal role in modern nonlinear analysis and optimization. The seminal contributions by Browder [1] and Kirk [2] paved the way for its rapid development. A particularly fruitful line of inquiry has been the extensive study of iterative methods for locating fixed points of these mappings. Among many algorithms, the KM iterative algorithm is the most commonly used and has a remarkable effect.
The famous KM iteration algorithm was proposed by Krasnosel’skii [3] and Mann [4]. Given some , the iteration format is
Subsequently, Reich [5] changed the coefficient for each iteration to , and proposed a more general iteration format
when is satisfied
A key result regarding the weak convergence of (3) in Banach spaces was provided by Reich.
In 2017, the generalized KM iterative algorithm was introduced by Kanzow and Shehu [6] for nonexpansive mappings T in Hilbert spaces H. satisfy , is error sequence. Given some , the iteration format is
If the following conditions hold: (i) ; (ii) ; (iii) , then the sequence converges weakly to the fixed point of T. The proposed generalized KM iteration algorithm relaxes the convex combination condition satisfied by the original coefficient to allow for the sum of coefficients to be less than or equal to 1, which broadens and enhances the flexibility of coefficient selection.
In 2019, Zhang et al. [7] presented the weak convergence result of the generalized KM iterative algorithm in Banach spaces. Zhang et al. [7] extended this result to Banach spaces by proving the weak convergence of the generalized KM iterative algorithm, building on the findings of the document. They subsequently applied this conclusion to the zero point problem. Furthermore, he also proposed a variable generalized KM iterative algorithm [8] in Banach spaces, the iteration format is
By leveraging the previous research methods, he proved the weak convergence and applied it to the split feasibility problem.
Over time, the KM iteration algorithm has seen continued advancement, the Ishikawa iteration [9], which is more general in form and more applicable in application, is proposed based on the KM iteration. Its iteration format is
where are within two sequences of satisfying certain conditions. Obviously, when , the Ishikawa iteration format degenerates into the KM iteration format. In 1993, the weak convergence of Ishikawa iterations on bounded sets was established by Tan and Xu [10].
In recent years, the primary trajectory of research on the generalized Ishikawa iterative algorithm has evolved from the convergence analysis of its classical form. It has progressively shifted toward constructing more general and applicable algorithmic frameworks by means of relaxed conditions, error terms, extended operators, and expanded spaces, ultimately achieving deep integration with specific applied problems [11,12,13,14,15].
In 2018, Wang [11] proposed the generalized Ishikawa iteration:
When the coefficients satisfy certain conditions, he established the weak convergence of the iterative algorithm in Hilbert spaces, along with its application to variational inequalities.
The objective of this work is the enhancement of algorithm (7) and the investigation into the weak convergence of the modified algorithm in Banach spaces, building on the research of Zhang [7] and Wang [11]. The format of the improved generalized Ishikawa algorithm is
which is called the generalized Ishikawa iterative algorithm with errors term. More precisely, the weak convergence of algorithm (8) will be established for a uniformly convex Banach space E, provided that E satisfies either the Opial property or the KK-property (both of which will be defined later).
The remainder of this paper is structured into the following sections: Section 2 provides a review of fundamental concepts and results that require further analysis. Section 3 is dedicated to analyzing the weak convergence of the generalized Ishikawa iterative algorithm with errors and explores its application to the hyper-generalized proximal point algorithm. Section 4 addresses the weak convergence of the variable generalized Ishikawa iterative algorithm and discusses its application to the hyper-generalized perturbation CQ algorithm. Finally, Section 5 presents the concluding remarks.
2. Preliminaries
For every , there is a number such that if , and , it holds that
then E is termed a uniformly convex space.
We say that E exhibits the KK-property in the case that for any sequence in E, conditions and imply that . On the other hand, Opial’s property is defined by the requirement that for any sequence in E with the condition implies
To conclude, this section presents several necessary lemmas and propositions. This will be beneficial for our subsequent convergence analysis.
Lemma 1
([10]). Let and be sequences of nonnegative real numbers. , the following formula holds
then exists.
Lemma 2
([11]). If and are nonnegative real number columns, and satisfy the following conditions
then
Lemma 3
(Demiclosedness principle [16]). D is a nonempty closed convex subset of E, is a nonexpansive mapping, is called demiclosed if and only if
Remark 1
([16]). Demiclosedness principle naturally holds in uniformly convex Banach spaces.
Analogous to the proof of proposition 3.2 in the reference by Kim [17], the following proposition can be simply proved to be true.
Proposition 1.
Let E be a uniformly convex Banach space, and the sequence is generated by the following iterations:
then
- (i)
- For and , exists;
- (ii)
- If, in addition, the dual space of E has the KK-property, then the weak limit set of , denoted by is a singleton.
3. On the Convergence of the Generalized Ishikawa Iterative Algorithm with Errors Term and Its Applications
3.1. Weak Convergence of Generalized Ishikawa Iterative Algorithm with Errors
This section will establish the weak convergence of the generalized Ishikawa iterative algorithm with errors. The findings not only expand the scope of the generalized Ishikawa iterative algorithm, but also further enhance the applicability and performance of the generalized KM iterative algorithm, resulting in an Ishikawa iterative algorithm with broader application and improved performance.
Theorem 1.
Let E be a uniformly convex Banach space whose dual has the KK property or E itself satisfies the Opial property. Let D be a nonempty closed convex subset of E, and a nonexpansive mapping satisfying condition . The sequence is generated by the following iterative scheme:
where , consistently greater than 0 and , and are error sequences. The following conditions are assumed to hold:
- (i)
- ;
- (ii)
- , ;
- (iii)
- , ;
- (iv)
- .
Then the sequence generated by the iteration (9) converges weakly to the fixed point of T.
Proof.
We divide the proof into four steps.
Step 1 For , we will show exists.
By setting
we know from the definition of and that,
Moreover,
It follows from conditions (ii) and (iii) and Lemma 1applied to (10) with and that exists, whence the sequence is bounded.
Step 2 We now demonstrate that is satisfied.
Set
and
For , we obtain
we know from (11) that
It follows from conditions (ii) and (iii) that This inequality, together with (12), implies that
More precisely, . By an application of Lemma 2 under condition (i), we necessarily obtain
and hence
Step 3 We now prove that . To this end, first observe that
Then we have
We set
It follows from conditions (ii), (iii) and (iv) that .
Setting and , then Formula (14) can be written By applying Lemma 1, we have that exists. Since , this yields .
Step 4 An application of the demiclosedness principle for the operator yields the inequality , where . Therefore, to establish the weak convergence of to a fixed point of T, it suffices to prove that the set of its weak cluster points is a singleton. We proceed by considering two cases.
In the first case, where possesses the KK-property, we conclude that is a singleton by appealing to Proposition 1.
In the second case, E satisfies Opial’s property.
Take , and let and be subsequences of such that and , respectively. If , then
a contradiction. Hence, in both cases, we have shown that is a singleton, which completes the proof. □
Setting in Theorem 1 yields the following corollary.
Corollary 1.
Let E be a uniformly convex Banach space that also possesses either the KK property (in its dual ) or the Opial property. Let D be a nonempty closed convex subset of E, and a nonexpansive mapping satisfying . The sequence is generated by the following iteration:
where , consistently greater than 0 and . Assume the following conditions hold:
- (i)
- ;
- (ii)
- , ;
- (iii)
- .
Then the sequence generated by the iteration (15) converges weakly to the fixed point of T.
If we set , , and , then the following conclusion holds.
Corollary 2.
Let E be a uniformly convex Banach space. Assume, in addition, that either has the KK-property or E satisfies the Opial’s property. D is a nonempty closed convex subset of E. Let be a nonexpansive mapping such that . The sequence is generated by the following iteration:
where , consistently greater than 0. Assume the following conditions hold:
- (i)
- ;
- (ii)
- .
Then the sequence generated by the iteration (16) converges weakly to the fixed point of T.
We next provide a concrete example to demonstrate that the sequence generated by recursion (9) of Theorem 1 converges weakly to a fixed point of T, when , and compare the iterative results with the generalized KM iteration.
Example 1.
Define the mapping by . Then T is nonexpansive and possesses a unique fixed point at .
Proof.
We consider the following iterative scheme:
where . Then we have
Observe that the selections of and adhere to conditions (i)–(iv) in Theorem 1, and . Taking , by the iteration, we get that
We now turn to the generalized KM iterative scheme:
where . Then we have
Taking , by the iteration, we get that , when , . □
Figure 1 compares the convergence behavior of the generalized Ishikawa iteration with errors and the generalized KM iteration. As shown, the generalized Ishikawa algorithm with errors exhibits faster convergence and higher computational accuracy.
Figure 1.
Comparison diagram of convergence rate between generalized Ishikawa iteration with errors and generalized KM iteration.
A subsequent example is provided to compare the convergence rates of the generalized Ishikawa iteration with the generalized Ishikawa iteration with errors.
Example 2.
Define the mapping by , which is readily verified to be nonexpansive.
First, consider the generalized Ishikawa iteration:
where , then we obtain
Setting in the iteration yields Furthermore, a straightforward induction demonstrates that when , it follows that .
Next, consider the generalized Ishikawa iteration with errors:
where , then we obtain
Setting in the iteration yields .
A comparison of the convergence rates between the generalized Ishikawa iteration, with and without errors, is shown in Figure 2.
Figure 2.
Comparison diagram of convergence rate of generalized Ishikawa iteration with errors and generalized Ishikawa iteration.
The comparison of the two figures indicates that the generalized Ishikawa iteration with errors, as proposed in this study, exhibits not only improved convergence speed but also higher accuracy and performance compared to the generalized KM iteration and generalized Ishikawa iteration. The error term serves as a regulatory factor and enhances the efficiency of convergence.
Now, we present a new example addressing the convergence issue under “Rotation Mapping Problem”. For certain special mappings, such as small-angle rotations, standard iterative methods exhibit extremely slow convergence or even fail to converge. To tackle this problem, this paper employs a generalized Ishikawa iteration algorithm with an error term. By introducing a contraction error term, convergence is significantly accelerated. Taking a rotation mapping with an angle of as an example, we demonstrate the superior performance of the algorithm. The experiment is conducted in , with the mapping T defined as a rotation matrix about the origin by radians, and the initial point set as .
Example 3.
The mapping is defined as a rotation about the origin by θ radians: . Here, the rotation matrix R is given by: , with the rotation angle (approximately ). T is a nonexpansive mapping with the origin as its unique fixed point.
For this problem, the generalized KM iteration algorithm cannot be directly applied because it is a single-step iteration (using T only once), whereas the generalized Ishikawa iteration is a two-step iteration (using T twice, i.e., a nested T). For rotation mappings, which exhibit strong directional behavior, algorithms with a two-layer structure can better adjust the direction through the construction of intermediate points, potentially leading to faster convergence. Therefore, in addressing this issue, we directly compare the performance of the generalized Ishikawa iteration algorithm and its variant incorporating an error term.
First, consider the generalized Ishikawa iteration:
where
Next, consider the generalized Ishikawa iteration with errors:
where the parameters are the same as those in the generalized Ishikawa iteration.
Observe that the selections of , and adhere to conditions (i)–(iv) in Theorem 1.
For the rotation mapping problem, the comparison of convergence for the generalized Ishikawa iteration with and without errors is shown in Figure 3.
Figure 3.
Comparison diagram of convergence rate of generalized Ishikawa iteration with errors and generalized Ishikawa iteration (Rotation Mapping Problem).
From Figure 3, it can be observed that the trajectory plot of the error-free generalized Ishikawa iteration shows the iteration points slowly circling on a circle, hardly converging to the fixed point. In contrast, the trajectory plot of the generalized Ishikawa iteration with errors shows the iteration points rapidly contracting toward the fixed point. The norm convergence plot displays the distance from the origin over time, while the norm convergence plot (log scale) more clearly illustrates the difference in convergence rates. A zoomed-in view of the last 50 iterations highlights the differences in convergence accuracy. The performance comparison table quantitatively presents various performance metrics, indicating that the generalized Ishikawa iteration with errors can approach the fixed point in as few as five steps, demonstrating excellent performance.
3.2. Application of Generalized Ishikawa Iterative Algorithm with Errors
This section demonstrates the applicability of Theorem 1 to the Hyper-Generalized Proximal Point Algorithm (HGPPA) for locating zeros of an m-accretive operator, that is,
where is an m-accretive operator on a uniformly convex Banach space E. The solution set of problem (17), denoted by , is taken to be nonempty. The proximal point algorithm (PPA) for solving (17), originating from the seminal work of Browder [16] and Martinet [18], iteratively generates a sequence by the scheme
where the proximal parameter is positive in a real Hilbert space, the resolvent operator is defined as . Consequently, the PPA iteration (18) admits the compact form
The convergence of the PPA (18) was first established in Hilbert spaces by Browder [16]. Kim et al. [17] later generalized this convergence result to the setting of uniformly convex Banach spaces and m-accretive operators. Specifically, they studied an algorithm of the form:
where , being an error sequence in E. Zhang et al. [7] introduced the following Generalized Proximal Point Algorithm (GPPA):
where and are real sequences in satisfying . The GPPA affords greater flexibility in parameter selection and admits a wider application scope than Algorithm (20). Zhang et al. also provided a proof of its weak convergence in uniformly convex Banach spaces.
This paper will further extend the algorithm (21), considering the hyper generalized proximal point algorithm (HGPPA):
where , consistently greater than 0 and , and are error sequences, (22) can be viewed as a generalization of several earlier proximal point algorithms.
Next, we proceed to establish the weak convergence of the HGPPA in uniformly convex Banach spaces.
Theorem 2.
Let E be a uniformly convex Banach space whose dual satisfies the KK property or which itself satisfies the Opial property. Let A be an m-accretive operator in E with . Suppose the sequence is generated by (22), where the parameters satisfy , with consistently greater than 0, and , are error sequences. The following conditions are assumed to hold:
- (i)
- ;
- (ii)
- , ;
- (iii)
- , ;
- (iv)
- .
Then the sequence generated by the iteration (22) converges weakly to the fixed point of .
Proof.
Define the operator for notational convenience. Note that, , then HGPPA (22) can be rewritten as (9).
Since A is m-accretive, it follows from Lopez et al. [19] that T is nonexpansive. The application of Theorem 1 to (9) now yields the weak convergence of to a point in . This concludes the proof. □
4. Convergence of Variable Generalized Ishikawa Iterative Algorithm and Its Application
4.1. Weak Convergence of Variable Generalized Ishikawa Iterative Algorithm
This section focuses on refining the iterative process of the variable generalized KM algorithm and introduces a new variable generalized Ishikawa iterative algorithm, defined as follows:
We proceed to prove that the variable generalized Ishikawa iteration converges weakly.
Theorem 3.
Let E be a uniformly convex Banach space that satisfies the Opial property. Let D be a nonempty closed convex subset of E, and a nonexpansive mapping satisfying condition . Let be a sequence of nonexpansive operators on D. The sequence is generated by (23), where , consistently greater than 0 and . The following conditions are assumed to hold:
- (i)
- ;
- (ii)
- ;
- (iii)
- , ;
- (iv)
- , , wherethen the sequence generated by the iteration (23) converges weakly to the fixed point of T.
Proof.
We structure the proof into four steps for clarity.
Step 1 For , we will show exists.
It follows from conditions (iii) and (iv) and Lemma 1 applied to (24) with and that exists, whence the sequence is bounded.
Step 2 We now demonstrate that is satisfied.
Set
and
For , we have
we know from (25) that
It follows from conditions (iii) and (iv) that This inequality, together with (26), implies that
More precisely, . By an application of Lemma 2 under condition (i), we necessarily obtain
and hence
Step 3 We now prove that . To this end, first observe that
Then we have
We set
It follows from conditions (ii), (iii) and (iv) that .
Setting and , then formula (28) can be written By applying Lemma 1, we have that exists. Since , this yields .
Step 4 An application of the demiclosedness principle for the operator yields the inequality , where . Therefore, to establish the weak convergence of to a fixed point of T, it suffices to prove that the set of its weak cluster points is a singleton.
E satisfies the Opial’s property. Take , and let and be subsequences of such that and , respectively. If , then
a contradiction. Thus, we have shown that is a singleton, which completes the proof. □
By specializing Theorem 3 to a Hilbert space setting, we immediately obtain the following corollary.
Corollary 3.
Let H be a real Hilbert space and C a nonempty closed convex subset of H. Let be a sequence of nonexpansive operators on C, and a nonexpansive mapping. The sequence is generated by (23) with satisfying and consistently greater than 0. The following conditions are assumed to hold
- (i)
- ;
- (ii)
- ;
- (iii)
- , ;
- (iv)
- , , wherethen the sequence generated by the iteration (23) converges weakly to the fixed point of T.
4.2. Application of Variable Generalized Ishikawa Iterative Algorithm
We apply the variable generalized Ishikawa iterative algorithm to the split feasibility problem (SFP) in this section, thereby establishing a more generalized convergence result.
First, let us review what a split feasible problem is [20]. A split feasible problem refers to the process of finding
where C and Q are closed convex subset of the Hilbert space and , respectively, and is a bounded linear operator.
To solve the SFP (29), Byrne [21,22] proposed the CQ algorithm, generating the sequence through the following format:
where and denote the metric projections onto the sets C and Q, , is the largest eigenvalue of , and is the adjoint of A.
Assuming that the SFP (29) is solvable, it is straightforward to observe that is a solution to SFP (29) if and only if it satisfies the following equation:
where is an arbitrary positive constant. Furthermore, in reference [23], it is shown that the operator defined in (31) is nonexpansive for all sufficiently small . The CQ algorithm (30) can be viewed as a special case of the KM iterative. Applying the KM algorithm to the fixed-point operator from (31) yields the following iterative scheme for the sequence :
If satisfies condition (3), then the resulting sequence from iteration (32) is weakly convergent.
Zhao and Yang [24] incorporated perturbations into the closed convex sets C and Q, and investigated the following perturbed CQ algorithm:
where and represent the sequence of sets to which Mosco converges for sets C and Q, and , with being the spectral radius of the matrix .
Zhang [8] studied the following generalized perturbation CQ algorithm in the Hilbert space:
where , and . Here, the -distance function between two closed convex subsets and in the Hilbert space is introduced as follows:
The following conditions are assumed to hold:
() ;
() ;
() .
Then the sequence generated by the generalized perturbation CQ algorithm (34) converges weakly to a solution of the SFP (29).
Based on Zhang’s research, we further extend it and consider the following hyper generalized perturbation CQ algorithm in the Hilbert space:
Next, we will prove the convergence of the hyper generalized perturbation projection algorithm.
Theorem 4.
Let H be a real Hilbert space and C a nonempty closed convex subset of H. Let be a sequence of nonexpansive operators on C, and a nonexpansive mapping. The sequence is generated by iterative scheme (23), where , consistently greater than 0 and . If the assumed conditions ()–() are assumed to hold, then the sequence generated by the iteration (35) converges weakly to the fixed point of SFP (29).
Proof.
Set , , then both and T are nonexpansive. Since the solution set of SFP (29) is nonempty, . Noting that is the solution of SFP (29), the generalized perturbation projection algorithm (35) can be written as
For set
then for , . Next, calculate :
that is . From assumption (), we can conclude that
By Corollary 3, the sequence converges weakly to a solution of SFP (29). The proof is therefore complete. □
5. Conclusions
This work has established weak convergence theorems for generalized Ishikawa iteration with errors and variable generalized Ishikawa iterative in uniformly convex Banach spaces, generalizing prior work by Zhang [8] and Wang [11]. Furthermore, the applicability of these findings has been demonstrated through convergence analysis of the HGPPA and a perturbed CQ algorithm. Under specific regularity conditions, these weak convergence results can be strengthened to strong convergence in Hilbert spaces. A natural open question is whether such strong convergence remains valid in uniformly convex Banach spaces, which we leave as a direction for future research.
Author Contributions
Conceptualization, L.Y., Y.Z. and W.Z.; methodology, L.Y., Y.Z. and W.Z.; software, L.Y., Y.Z. and W.Z.; validation, L.Y., Y.Z. and W.Z.; formal analysis, L.Y., Y.Z. and W.Z.; writing—original draft preparation, L.Y., Y.Z. and W.Z.; writing—review and editing, L.Y., Y.Z. and W.Z. All authors have read and agreed to the published version of the manuscript.
Funding
This work was completed with the support of the Basic Research Funding for Young Researchers Project of Heilongjiang Province (No. 1453QN022).
Data Availability Statement
Data are contained within the article.
Acknowledgments
The authors are very thankful to the referees for their valuable and helpful comments.
Conflicts of Interest
The authors declare no conflict of competing interests.
References
- Browder, F.E. Nonexpansive nonlinear operators in a banach space. Proc. Natl. Acad. Sci. USA 1965, 54, 1041–1044. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Kirk, W.A. A fixed point theorem for mappings which do not increase distances. Am. Math. Mon. 1965, 72, 1004–1006. [Google Scholar] [CrossRef] [Scilit]
- Krasnosel’skiı, M.A. Two remarks on the method of successive approximations. Uspekhi Mat. Nauk. 1965, 10, 123–127. [Google Scholar]
- Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
- Reich, S. Weak convergence theorems for nonexpansive mappings in banach spaces. J. Math. Anal. Appl. 1979, 67, 274–276. [Google Scholar] [CrossRef] [Scilit]
- Kanzow, C.; Shehu, Y. Generalized krasnoselskii–mann-type iterations for nonexpansive mappings in hilbert spaces. Comput. Optim. Appl. 2017, 67, 595–620. [Google Scholar] [CrossRef] [Scilit]
- Zhang, Y.C.; Guo, K.; Wang, T. Generalized krasnoselskii–mann-type iteration for nonexpansive mappings in banach spaces. J. Oper. Res. Soc. China 2021, 9, 195–206. [Google Scholar] [CrossRef] [Scilit]
- Zhang, Y.C. Generalized KM Iterative Algorithm and Its Applications in Zero Point Problems and Split Feasibility Problems. Master’s Thesis, West China Normal University, Nanchong, China, 2020. [Google Scholar]
- Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [Google Scholar] [CrossRef]
- Tan, K.K.; Xu, H.K. Approximating fixed points of non-expansive mappings by the ishikawa iteration process. J. Math. Anal. Appl. 1993, 178, 301. [Google Scholar] [CrossRef] [Scilit]
- Wang, T.; Guo, K.; Zhao, S.L. A class of generalized ishikawa iterations in hilbert spaces and its application to variational inequalities. J. Xihua Norm. Univ. Natural Sci. Ed. 2018, 33, 153–160. [Google Scholar]
- Kondo, A. Iterative scheme generating method beyond Ishikawa iterative method. Math. Ann. 2024, 391, 1–22. [Google Scholar] [CrossRef] [Scilit]
- Tomar, A.; Alam, H.K.; Sajid, M.; Rohen, Y.; Singh, S.S. Fibonacci-Ishikawa iterative method in modular spaces for asymptotically non-expansive monotonic mathematical operators. J. Inequalities Appl. 2025, 2025, 126. [Google Scholar] [CrossRef] [Scilit]
- Pragadeeswarar, V.; Gopi, R.; Park, C.; Lee, J.R. Convergence of Fixed Points for Relatively Nonexpansive Mappings via Ishikawa Iteration. Int. J. Appl. Comput. Math. 2025, 11, 129. [Google Scholar] [CrossRef] [Scilit]
- Liu, X.; Song, X.; Chen, L.; Zhao, Y. Distributed Ishikawa algorithms for seeking the fixed points of multi-agent global operators over time-varying communication graphs. J. Comput. Appl. Math. 2025, 457, 116250. [Google Scholar] [CrossRef] [Scilit]
- Browder, F.E. Convergence theorems for sequences of nonlinear operators in banach spaces. Math. Z. 1967, 100, 201–225. [Google Scholar] [CrossRef] [Scilit]
- Kim, T.H.; Xu, H.K. Robustness of mann’s algorithm for nonexpansive mappings. J. Math. Anal. Appl. 2007, 327, 1105–1115. [Google Scholar] [CrossRef] [Scilit]
- Martinet, B. Regularisation d’inequations variationelles par approximations successives. Rev. Fr. D’Informatique Rech. Oper. 1970, 4, 154–159. [Google Scholar]
- Lopez, G.; Martlnmarquez, V.; Wang, F.; Xu, H.K. Forward-backward splitting methods for accretive operators in banach spaces. Abstr. Appl. Anal. 2012, 2012, 1–25. [Google Scholar] [CrossRef] [Scilit]
- Censor, Y.; Elfving, T. A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 1994, 8, 221–239. [Google Scholar] [CrossRef] [Scilit]
- Byrne, C. Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 2002, 18, 441. [Google Scholar] [CrossRef] [Scilit]
- Byrne, C. A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 2003, 20, 103–120. [Google Scholar] [CrossRef] [Scilit]
- Xu, H.K. A variable Krasnosel’skii–Mann algorithm and the multiple-set split feasibility problem. Inverse Probl. 2006, 22, 2021–2034. [Google Scholar] [CrossRef] [Scilit]
- Zhao, J.; Yang, Q. Several solution methods for the split feasibility problem. Inverse Probl. 2005, 21, 1791–1799. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.


