Abstract
In our 2006 paper with D. Butnariu, it was shown that the convergence of iterates of a nonexpansive self-mapping of a complete metric space is stable in the presence of summable computational errors. In the present paper, we establish such results for monotone nonexpansive mappings.
MSC:
47H09; 47H10; 54E50
1. Introduction
For more than 60 years now, there has been considerable research activity regarding the fixed point theory of various classes of nonexpansive operators [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]. The starting point of these efforts is Banach’s seminal result [16] on the existence of a unique fixed point for a strict contraction. It also concerns the convergence of iterates of a nonexpansive operator to one of its fixed points. Since that classical theorem, many developments have taken place in this field. See, for example, [15,17,18,19,20].
In our 2006 paper with D. Butnariu [3], it was shown that the convergence of iterates of a nonexpansive self-mapping of a complete metric space is stable in the presence of summable computational errors. In the present paper, our goal is to establish such results for monotone nonexpansive mappings. Note that the study of monotone nonexpansive mapping is a well-established area of research. For pertinent examples and applications of solving matrix and ordinary differential equations, see [21,22]. The results of [3] and the present paper show that the convergence of iterates remains in force even when small computational errors are taken into account. Needless to say, such errors always occur in calculations.
Assume that is a complete metric space. For every point and each non-empty set , put
For every point and every positive number , put
Finally, for every operator mapping , let for every point .
In [3] the authors analyzed the convergence of orbits of nonexpansive operators in complete metric spaces in the presence of computational errors and obtained the following result (see also Theorem 2.72 on page 97 of [13]).
Theorem 1.
Assume that a mapping satisfies
and assume that for every point , the sequence converges in .
Assume further that the sequences and satisfy the conditions
and
Then, the sequence converges to a fixed point of T in .
Theorem 1 has found interesting applications and is an important ingredient in the study of superiorization and perturbation resilience of algorithms. See, for example, [23,24,25,26,27] and references mentioned therein.
2. The Main Results
Assume that is a complete metric space equipped with an order ≤, such that for each , if satisfy and , then , and if satisfy and , then .
Assume that a mapping satisfies
and
In this paper, we establish the following results which are proved in Section 4.
Theorem 2.
Assume that for every point , the sequence converges. Let a sequence satisfy the conditions
and
Then the sequence converges. If, in addition, T is continuous, then its limit is a fixed point of T.
Theorem 3.
Assume that F is a non-empty subset of X, for every point ,
and that a sequence satisfies (3) and (4). Then .
Theorem 4.
Assume that for every point , there exists a compact set , such that
and that a sequence satisfies (3) and (4). Then, there exists a compact set , such that .
3. An Auxiliary Result
Lemma 1.
Assume that a mapping satisfies (1) and (2) and that a sequence satisfies
and
that is an integer, and that
and
Then, for each integer , we have
and
Proof.
In view of (6) and (7),
and relations (8) and (9) hold with .
Assume that is a natural number and that Equations (8) and (9) hold. By (7), we have
In view of (8),
Relations (9) and (11) imply that
It follows from (2) and (6)–(8) that
Thus, (8) and (9) hold for too. Thus, the assumption made for n holds for too. This completes the proof of Lemma 1. □
4. Proofs of Theorems 2–4
Proof of Theorem 2.
Given , there exists a natural number , such that
Set
and
Lemma 1 and relations (12) and (13) imply that for every natural number , we have
In view of (13), there exists
By (14) and (15), for all sufficiently large natural numbers n,
Thus is a Cauchy sequence and there exists
Clearly, if T is continuous, then is a fixed point of T. Theorem 2 is proved. □
Proof of Theorem 3.
Given a positive number , there exists a natural number , such that Equation (12) holds. Define a sequence by (13). Lemma 1 and relations (12) and (13) imply that for every natural number , we have
In view of (13) and the above inequality, for every sufficiently large natural number n, we have
This completes the proof of Theorem 3. □
Proof of Theorem 4.
Given , there exists a natural number such that Equation (12) holds. Define a sequence by (13). Lemma 1 and relations (12) and (13) imply that for every natural number , we have
In view of (13), there exists a compact set , such that
Clearly, for every sufficiently large natural number , we have
Thus, we have shown that there exists a compact set E, such that
for each sufficiently large natural number . We may assume that is finite. This implies that each subsequence of has a convergent subsequence. Denote by E the set of all limit points of the sequence . It is not difficult to see that E is compact and that
This completes the proof of Theorem 4. □
5. Conclusions
We have extended the convergence result of [3], which was established for inexact iterates of a nonexpansive self-mapping of a complete metric space, to monotone nonexpansive mappings. Such mappings have applications to solving matrix and ordinary differential equations (see [21,22]).
Author Contributions
All authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.
Funding
The first author was partially supported by the Israel Science Foundation (Grant No. 820/17), by the Fund for the Promotion of Research at the Technion and by the Technion General Research Fund.
Data Availability Statement
Not applicable.
Acknowledgments
Both authors are grateful to four anonymous referees for their useful comments and helpful suggestions.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Alolaiyan, H.A.; Ali, B.; Abbas, M. Fixed point results of Edelstein-Suzuki type multivalued mappings on b-metric spaces with applications. J. Nonlinear Sci. Appl. 2017, 10, 1201–1214. [Google Scholar] [CrossRef] [Scilit]
- Betiuk-Pilarska, A.; Benavides, T.D. Fixed points for nonexpansive mappings and generalized nonexpansive mappings on Banach lattices. Pure Appl. Func. Anal. 2016, 1, 343–359. [Google Scholar]
- Butnariu, D.; Reich, S.; Zaslavski, A.J. Convergence to fixed points of inexact orbits of Bregman-monotone and of nonexpansive operators in Banach spaces. In Fixed Point Theory and Its Applications; Yokohama Publishers: Yokohama, Japan, 2006; pp. 11–32. [Google Scholar]
- de Blasi, F.S.; Myjak, J. Sur la convergence des approximations successives pour les contractions non linéaires dans un espace de Banach. C. R. Acad. Sci. Paris 1976, 283, 185–187. [Google Scholar]
- Edelstein, M. A0n extension of Banach’s contraction principle. Proc. Am. Math. Soc. 1961, 12, 7–10. [Google Scholar]
- Goebel, K.; Kirk, W.A. Topics in Metric Fixed Point Theory; Cambridge University Press: Cambridge, UK, 1990. [Google Scholar]
- Goebel, K.; Reich, S. Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings; Marcel Dekker: New York, NY, USA; Basel, Switzerland, 1984. [Google Scholar]
- Jachymski, J. Extensions of the Dugundji-Granas and Nadler’s theorems on the continuity of fixed points. Pure Appl. Funct. Anal. 2017, 2, 657–666. [Google Scholar]
- Kirk, W.A. Contraction mappings and extensions. In Handbook of Metric Fixed Point Theory; Kluwer: Dordrecht, The Netherlands, 2001; pp. 1–34. [Google Scholar]
- Kubota, R.; Takahashi, W.; Takeuchi, Y. Extensions of Browder’s demiclosedness principle and Reich’s lemma and their applications. Pure Appl. Func. Anal. 2016, 1, 63–84. [Google Scholar]
- Rakotch, E. A note on contractive mappings. Proc. Am. Math. Soc. 1962, 13, 459–465. [Google Scholar] [CrossRef]
- Reich, S. Fixed points of contractive functions. Boll. Un. Mat. Ital. 1972, 5, 26–42. [Google Scholar]
- Reich, S.; Zaslavski, A.J. Genericity in nonlinear analysis. In Developments in Mathematics; Springer: New York, NY, USA, 2014; Volume 34. [Google Scholar]
- Reich, S.; Zaslavski, A.J. Convergence and well-posedness properties of uniformly locally contractive mappings. Topol. Methods Nonlinear Anal. accepted for publication.
- Zaslavski, A.J. Approximate solutions of common fixed point problems. In Springer Optimization and Its Applications; Springer: Cham, Switzerland, 2016. [Google Scholar]
- Banach, S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fund. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef] [Scilit]
- Censor, Y.; Zaknoon, M. Algorithms and convergence results of projection methods for inconsistent feasibility problems: A review. Pure Appl. Func. Anal. 2018, 3, 565–586. [Google Scholar]
- Gibali, A. A new split inverse problem and an application to least intensity feasible solutions. Pure Appl. Funct. Anal. 2017, 2, 243–258. [Google Scholar]
- Takahashi, W. The split common fixed point problem and the shrinking projection method for new nonlinear mappings in two Banach spaces. Pure Appl. Funct. Anal. 2017, 2, 685–699. [Google Scholar]
- Takahashi, W. A general iterative method for split common fixed point problems in Hilbert spaces and applications. Pure Appl. Funct. Anal. 2018, 3, 349–369. [Google Scholar]
- Nieto, J.J.; Rodríguez-López, R. Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations. Order 2006, 22, 223–239. [Google Scholar] [CrossRef] [Scilit]
- Ran, A.C.; Reurings, M.C.B. A fixed point theorem in partially ordered sets and some applications to matrix equations. Proc. Am. Math. Soc. 2004, 132, 1435–1443. [Google Scholar] [CrossRef] [Scilit]
- Bauschke, H.H.; Koch, V.R. Projection methods: Swiss army knives for solving feasibility and best approximation problems with half-spaces. Contemp. Math. 2015, 636, 1–40. [Google Scholar]
- Butnariu, D.; Davidi, R.; Herman, G.T.; Kazantsev, I.G. Stable convergence behavior under summable perturbations of a class of projection methods for convex feasibility and optimization problems. IEEE J. Sel. Top. Signal Process. 2007, 1, 540–547. [Google Scholar] [CrossRef] [Scilit]
- Censor, Y.; Davidi, R.; Herman, G.T. Perturbation resilience and superiorization of iterative algorithms. Inverse Probl. 2010, 26, 12. [Google Scholar] [CrossRef] [Scilit]
- Censor, Y.; Davidi, R.; Herman, G.T.; Schulte, R.W.; Tetruashvili, L. Projected subgradient minimization versus superiorization. J. Optim. Theory Appl. 2014, 160, 730–747. [Google Scholar] [CrossRef] [Scilit]
- Nikazad, T.; Davidi, R.; Herman, G.T. Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction. Inverse Probl. 2012, 28, 19. [Google Scholar] [CrossRef] [Scilit] [PubMed]
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. |
© 2022 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 (https://creativecommons.org/licenses/by/4.0/).