Abstract
For approximating the fixed points of enriched nonexpansive mappings in Hilbert spaces, we consider a modified Krasnosel’skiǐ–Mann algorithm for which we prove a strong convergence theorem. We also empirically compare the rate of convergence of the modified Krasnosel’skiǐ–Mann algorithm and of the simple Krasnosel’skiǐ fixed point algorithm. Based on the numerical experiments reported in the paper we conclude that, for the class of enriched nonexpansive mappings, it is more convenient to work with the simple Krasnosel’skiǐ fixed point algorithm than with the modified Krasnosel’skiǐ–Mann algorithm.
1. Introduction and Preliminaries
Let H be a real Hilbert space with the inner product and the induced norm . Suppose that C is a nonempty closed and convex subset of H. A mapping is nonexpansive if it satisfies the following symmetric contractive type condition:
for all .
A point is called a fixed point of T provided . We denote by the set of fixed points of T, that is, .
The problem of existence and approximation of fixed points of nonexpansive mappings is important as it has important applications in various areas of research, and many problems can be regarded as fixed point problems for appropriate nonexpansive mappings: convex feasibility problems, convex optimization problems, monotone variational inequalities, image recovery, signal processing, and so on.
However, the study of fixed points of nonexpansive mappings is not a trivial task. Indeed, if C is a closed nonempty subset of a Banach space X and is nonexpansive, it is known that T may not have a fixed point or it may have many fixed points, and third, it may happen that, even if T has a unique fixed point, the Picard iteration may fail to converge to such a fixed point. One of the simplest examples of such a map is on with the usual norm, which gives, for , say, and . In addition, rotation about the origin of the unit disk in the plane is another example of nonexpansive mapping having a unique fixed point while does not converge.
These aspects made the study of nonexpansive mappings one of the major and most active research areas of nonlinear analysis since the mid-1960s, see, for example, the monographs [,,,] and references therein.
One way to obtain convergent iterative schemes for the approximation of fixed points of nonexpansive mappings is mainly due to Mann [] and to Krasnosel’skiǐ [], who considered, instead of Picard iteration (which does not converge, in general, for nonexpansive mappings), an explicit averaged iteration of the form
where the initial guess is chosen arbitrarily. This simple but powerful algorithm is usually called the Mann iteration, or the Krasnosel’skiǐ–Mann iteration, or simply Krasnosel’skiǐ iteration, in the case (constant), to acknowledge the pioneering results in [,].
Although the Krasnosel’skiǐ–Mann algorithm defined by (2) provides a unified framework for different algorithms, it however has only weak convergence under certain conditions, see for example []. Thus, in order to achieve the convergence in norm of the iterates, it is necessary to impose additional conditions on the considered operators or on the space (demicompactness, continuity, compactness) or to operate some modifications of the algorithm itself, such as in [,,,] etc.
Let H be a real Hilbert space and let be a nonlinear mapping. Let and be two sequences in . Yao, Zhou and Liou [] introduced the following modified Krasnosel’skiǐ–Mann iterative algorithm:
where is given, and proves that converges strongly to a fixed point of the nonexpansive mapping T.
Note that, in the particular case and (constant), the modified Krasnosel’skiǐ–Mann iterative algorithm (3) reduces to the Krasnosel’skiǐ algorithm (2).
On the other hand, the author [], see also [], introduced and studied the class of enriched nonexpansive mapping as a generalization of the nonexpansive mappings.
Let be a linear normed space. A mapping is said to be an enriched nonexpansive (or b-enriched nonexpansive) if there exists such that
We note that condition (4) is also symmetric and that the class of enriched nonexpansive mappings includes all nonexpansive mappings, which are obtained for in (4). In [] it was also shown (see Example 2.1) that there exist other important classes of mappings, e.g., Lipschitzian and generalized pseudocontractive mappings, which are not nonexpansive but are enriched nonexpansive. Results on the existence and approximation of fixed points of enriched nonexpansive mappings by means of the Krasnosel’skiǐ iteration were also established, for which both weak and strong convergence are provided.
However, the strong convergence result obtained in [] for the Krasnosel’skiǐ iteration (Theorem 1 below) is tributary to the additional property of demicompactness of the enriched nonexpansive mapping T. To state it here, we need the following concept.
Definition 1
([]). Let H be a Hilbert space and C a subset of H. A mapping is called demicompact if it has the property that whenever is a bounded sequence in H and is strongly convergent, then there exists a subsequence of which is strongly convergent.
Theorem 1
([]). Let C be a bounded closed convex subset of a Hilbert space H and be a b-enriched nonexpansive and demicompact mapping. Then the set of fixed points of T is a nonempty convex set and there exists such that, for any given , the Krasnosel’skiǐ iteration given by
converges strongly to a fixed point of T.
Starting from these facts, our aim in this paper is to achieve strong convergence by considering the modified Krasnosel’skiǐ–Mann iterative algorithm (3) to approximate fixed points of enriched nonexpansive mappings which are not necessarily nonexpansive. We also compare numerically the rate of convergence of the modified Krasnosel’skiǐ–Mann iterative algorithm (3) to the one of the Krasnosel’skiǐ algorithm used in [].
2. Strong Convergence of the Modified Krasnosel’skiǐ–Mann Algorithm
To prove the main result of this paper, we need some auxiliary results collected in the next lemmas.
Lemma 1.
Let H be a real Hilbert space. Then the following identity holds:
Lemma 2
(Browder’s demiclosedness principle, []). Let C be a nonempty closed convex of a real Hilbert space H. Let be a nonexpansive mapping. Then is demiclosed on C, i.e., if converges weakly to and , then .
Lemma 3
([]). Assume is a sequence of nonnegative real numbers such that
where is a sequence in and is a sequence in such that
- (i)
- ;
- (ii)
- or .
Then .
Theorem 2.
Let H be a real Hilbert space and let be an enriched nonexpansive mapping with . Let and be two sequences of real numbers in . Assume the following conditions are satisfied:
- (C1)
- ;
- (C2)
- ;
- (C3)
- .
Then the sequences and generated by the modified Krasnosel’skiǐ–Mann iterative algorithm
converge strongly to a fixed point of T, where and is some constant.
Proof.
By using , it follows that and the previous inequality becomes
Denote . Then Inequality (7) shows that
i.e., that the averaged operator is nonexpansive.
In view of the hypotheses we have
In order to prove the theorem, let us observe that the sequence given by Equation (6), that is,
is actually the modified Krasnosel’skiǐ–Mann iterative algorithm (3) corresponding to the averaged operator .
Claim 1. Sequences and are bounded.
Let . As is nonexpansive, for any we have
which implies
and therefore
Using Equation (6), we have
which, by Lemma 1, yields
and from this identity, by using Inequality (8), one obtains
that is,
which implies
Now, by Equation (6), we have
from which we can show easily by induction that
which proves that sequences and are bounded, and so Claim 1 is proved.
Claim 2. For , there exists such that
By using Lemma 1, the previous inequality implies
As is bounded, there exists such that, for ,
which by using Equation (14) proves Claim 2.
As is bounded, without loss of generality, we may assume that converges weakly to a point, say, .
Claim 3. and converge strongly to q.
We discuss the following two cases.
Case 1. The sequence is nonincreasing.
Now, using the nonexpansiveness of , one obtains
which shows that converges to 0 as .
As is demiclosed, it follows by Lemma 2 that . This means that and converge weakly .
Now, as , it follows that and hence, applying Lemma 3 to Equation (16), we obtain that (and also ), as claimed.
Case 2. The sequence is not nonincreasing.
Denote and consider the function defined for all (for some large enough) by
By definition, is a nondecreasing sequence such that
On the other hand, for all , we have
from which we deduce that
and, as converges weakly to q (and hence converges, too), this shows that
Therefore,
Let us note that, for , one has if (that is, ), because for j satisfying , we have . This implies that, for all ,
and this implies
which shows that converges strongly to q (and therefore, converges strongly to q, too). □
The next Corollary is the main result (Theorem 1) in [].
Corollary 1.
Let H be a real Hilbert space. Let be a nonexpansive mapping with . Let and be two sequences of real numbers in . Assume the following conditions are satisfied:
; ; .
Then the sequences and generated by the modified Krasnosel’skiǐ–Mann iterative algorithm
converges strongly to a fixed point of T, where .
Proof.
Remark 1.
To avoid the assumption in Theorem 2, we can merge it with Theorem 1 and consider T defined on a bounded closed subset of H.
Theorem 3.
Let H be a real Hilbert space, C a bounded closed convex subset of H, and a b-enriched nonexpansive mapping. Then is a nonempty convex set and the sequences and generated by the modified Krasnosel’skiǐ–Mann iterative algorithm
converge strongly to a fixed point of T, where and is some constant and and are sequences of real numbers in , satisfying the conditions
- (C1)
- ;
- (C2)
- ;
- (C3)
- .
Proof.
The first part follows by Theorem 1, while for the second part one adapts the proof of Theorem 2, by noting that in this case, the boundedness of and is ensured by the hypothesis. □
The next example shows that Theorem 2 is an effective generalization of Theorem 1 in [].
Example 1
(Example 2.1, []). Let be endowed with the usual norm and let be defined by , for all . Then
- (i)
- T is not nonexpansive.
- (ii)
- T is a -enriched nonexpansive mapping.
- (iii)
- .
Proof.
(i) Assume T is nonexpansive. Then
which, for and , leads to the contradiction .
(ii) The enriched nonexpansive condition (4) reduces in this case to
It easy to check that, for any , we have
which proves that T is a -enriched nonexpansive mapping. □
Therefore, all assumptions of Theorem 2 are satisfied and, for any , the sequence
generated by the modified Krasnosel’skiǐ–Mann algorithm (6), converges to 1, the unique fixed point of T, provided that and satisfy conditions –.
3. Numerical Experiments and Conclusions
Our aim in this section is to present a comparative study of the modified Krasnosel’skiǐ–Mann algorithm (6), involved in Theorems 2 and 3, and of the simpler Krasnosel’skiǐ algorithm (5), involved in Theorem 1, for the case of the enriched nonexpansive function T in Example 1. For the numerical experiments, which are given in Table 1, Table 2, Table 3 and Table 4, we consider different values of the parameters , , and and of the starting points . By N, we denote the number of iterations needed to obtain the fixed point with six exact digits.

Table 1.
Numerical experiments for Krasnosel’skiǐ iteration and starting points and .

Table 2.
Numerical experiments for Krasnosel’skiǐ iteration and starting point .

Table 3.
Numerical experiments for modified Krasnosel’skiǐ–Mann iteration and starting point .

Table 4.
Numerical experiments for modified Krasnosel’skiǐ–Mann iteration and starting point .
1. The speed of convergence of Krasnosel’skiǐ iteration for the considered enriched nonexpansive mapping depends on both parameter and starting point .
2. When starting from (see Table 1), the most rapid Krasnosel’skiǐ iteration corresponds to the value of the parameter (after three iterations we obtain the exact value of fixed point). In this case, Krasnosel’skiǐ iteration also converges quickly for the value of the parameter (after nine iterations we obtain the fixed point).
3. For , Krasnosel’skiǐ iteration converges as slowly as the value of the parameter approaches 1 (note that for , Krasnosel’skiǐ iteration reduces to Picard iteration, which is not convergent).
4. When starting from (see Table 2), the most rapid Krasnosel’skiǐ iteration corresponds to the value of the parameter (we obtain the fixed point after one iteration only), while for , the fixed point is obtained after three iterations.
5. Similarly to the case , for , the Krasnosel’skiǐ iteration converges as slowly as the parameter approaches 1.
6. Now, by analyzing the results in Table 3 and Table 4, note that the modified Krasnosel’skiǐ–Mann iteration converges very slowly in comparison with the simple Krasnosel’skiǐ iteration. In all the three cases considered for the parameters and , and for any starting value , the modified Krasnosel’skiǐ–Mann iteration converges extremely slowly.
7. When starting from , the exact value of the fixed point is not yet reached after 1000 iterations, while, for , the modified Krasnosel’skiǐ–Mann iteration reaches the fixed point after 362 iterations in the third case and 362 iterations in the second case, while in the first case, more than 600 iterations are needed to reach the exact value of the fixed point.
8. Based on the numerical experiments reported here, we can conclude that for approximating the fixed points of some enriched nonexpansive mappings, it would be more convenient to use the Krasnosel’skiǐ iteration than the modified Krasnosel’skiǐ–Mann iteration.
9. Therefore, it is an open problem to study if a similar situation holds in the case of all enriched nonexpansive mappings or nonexpansive mappings.
10. For other related developments we refer to [,,,,,,,] and references therein.
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The author declares no conflict of interest.
References
- Agarwal, R.P.; O’Regan, D.; Sahu, D.R. Fixed point theory for Lipschitzian-type mappings with applications. In Topological Fixed Point Theory and Its Applications; Springer: New York, NY, USA, 2009; Volume 6. [Google Scholar]
- Berinde, V. Iterative approximation of fixed points. In Lecture Notes in Mathematics, 2nd ed.; Springer: Berlin, Germany, 2007; Volume 1912. [Google Scholar]
- Chidume, C. Geometric properties of Banach spaces and nonlinear iterations. In Lecture Notes in Mathematics; Springer: London, UK, 2009; Volume 1965. [Google Scholar]
- Goebel, K.; Reich, S. Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings; Monographs and Textbooks in Pure and Applied Mathematics; Marcel Dekker, Inc.: New York, NY, USA, 1984; Volume 83. [Google Scholar]
- Mann, W.R. Mean value methods in iteration. Proc. Amer. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
- Krasnosel’skiǐ, M.A. Two remarks about the method of successive approximations. Uspehi Mat. Nauk 1955, 10, 123–127. (In Russian) [Google Scholar]
- Reich, S. Weak convergence theorems for nonexpansive mappings in Banach spaces. J. Math. Anal. Appl. 1979, 67, 274–276. [Google Scholar] [CrossRef] [Green Version]
- Imnang, S.; Suantai, S. Strong convergence of the modified Mann iterations in a Banach space. Thai J. Math. 2005, 3, 259–274. [Google Scholar]
- Kim, T.-H.; Xu, H.-K. Strong convergence of modified Mann iterations. Nonlinear Anal. 2005, 61, 51–60. [Google Scholar] [CrossRef]
- Takahashi, W.; Takeuchi, Y.; Kubota, R. Strong convergence theorems by hybrid methods for families of nonexpansive mappings in Hilbert spaces. J. Math. Anal. Appl. 2008, 341, 276–286. [Google Scholar] [CrossRef]
- Yao, Y.H.; Chen, R.; Yao, J.-C. Strong convergence and certain control conditions for modified Mann iteration. Nonlinear Anal. 2008, 68, 1687–1693. [Google Scholar] [CrossRef]
- Yao, Y.H.; Zhou, H.; Liou, Y.-C. Strong convergence of a modified Krasnoselski-Mann iterative algorithm for non-expansive mappings. J. Appl. Math. Comput. 2009, 29, 383–389. [Google Scholar] [CrossRef]
- Berinde, V. Approximating fixed points of enriched nonexpansive mappings by Krasnosel’skiǐ iteration in Hilbert spaces. Carpathian J. Math. 2019, 35, 293–304. [Google Scholar] [CrossRef]
- Berinde, V. Approximating fixed points of enriched nonexpansive mappings in Banach spaces by using a retraction-displacement condition. Carpathian J. Math. 2020, 36, 27–34. [Google Scholar] [CrossRef]
- Petryshyn, W.V. Construction of fixed points of demicompact mappings in Hilbert space. J. Math. Anal. Appl. 1966, 14, 276–284. [Google Scholar] [CrossRef] [Green Version]
- Browder, F.E. Semicontractive and semiaccretive nonlinear mappings in Banach spaces. Bull. Amer. Math. Soc. 1968, 74, 660–665. [Google Scholar] [CrossRef] [Green Version]
- Xu, H.-K. Iterative algorithms for nonlinear operators. J. London Math. Soc. 2002, 66, 240–256. [Google Scholar] [CrossRef]
- Browder, F.E.; Petryshyn, W.V. Construction of fixed points of nonlinear mappings in Hilbert space. J. Math. Anal. Appl. 1967, 20, 197–228. [Google Scholar] [CrossRef] [Green Version]
- Abbas, M.; Anjum, R.; Berinde, V. Enriched Multivalued Contractions with Applications to Differential Inclusions and Dynamic Programming. Symmetry 2021, 13, 1350. [Google Scholar] [CrossRef]
- Bagherboum, M.; Razani, A. A modified Mann iterative scheme for a sequence of nonexpansive mappings and a monotone mapping with applications. Bull. Iranian Math. Soc. 2014, 40, 823–849. [Google Scholar]
- Nakajo, K.; Takahashi, W. Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups. J. Math. Anal. Appl. 2003, 279, 372–379. [Google Scholar] [CrossRef] [Green Version]
- Pant, R.; Shukla, R. The Krasnosel’skiǐ–Mann algorithm for a countable family of non-self Lipschitzian mappings. Topol. Methods Nonlinear Anal. 2020, 56, 325–348. [Google Scholar] [CrossRef]
- Shukla, R.; Pant, R. Some new fixed point results for monotone enriched nonexpansive mappings in ordered Banach spaces. Adv. Theory Nonlinear Anal. Appl. 2021, 5, 559–567. [Google Scholar] [CrossRef]
- Yao, Y.H.; Măruşter, S. Strong convergence of an iterative algorithm for variational inequalities in Banach spaces. Math. Comput. Model. 2011, 54, 325–329. [Google Scholar] [CrossRef]
- Yao, Y.H.; Noor, M.A.; Liou, Y.-C. A new hybrid iterative algorithm for variational inequalities. Appl. Math. Comput. 2010, 216, 822–829. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the author. 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 (https://creativecommons.org/licenses/by/4.0/).