A General Picard-Mann Iterative Method for Approximating Fixed Points of Nonexpansive Mappings with Applications
Abstract
:1. Introduction
2. Preliminaries
- (i)
- Ref. [28] (Demiclosedness principle) Let be a nonexpansive mapping. If is a sequence in such that weakly converges to ϱ and then That is, is demiclosed at zero.
- (ii)
- Ref. [29] If is bounded, then there exists a continuous, strictly increasing and convex function (depending only on the diameter of with such that for every nonexpansive mapping for all and the following inequality holds:
3. A General Picard-Mann Iterative Method
- (i)
- (ii)
- (iii)
Stability Results
- (1)
- The sequence strongly converges to the fixed point
- (2)
- implies that so that is summably almost T-stable
- (3)
- implies
4. Convergence Results for Nonexpansive Mappings
- (1)
- If , then exists;
- (2)
- exists, where denotes the distance from ϱto
- (3)
- For all and the limit exists.
- (4)
- In addition, if is uniformly convex and the dual space of has the KK-property, then is a singleton.
- (a)
- satisfies the Opial’s property;
- (b)
- has the KK-property.
5. Applications
5.1. Zero of an Accretive Operator
- (a)
- has the Opial’s property;
- (b)
- has the KK-property.
5.2. Generalized Mixed Equilibrium Problem
- (X1)
- for all
- (X2)
- is monotone, that is, for all
- (X3)
- for all
- (X4)
- for each is a convex and lower semicontinuous;
- (X5)
- for fixed and there exists a bounded subset of and such that for all
- (a)
- For each is nonempty;
- (b)
- is a single valued mapping;
- (c)
- is firmly nonexpansive, that is, for allso is a nonexpansive.
- (d)
- ;
- (e)
- is closed and convex.
5.3. Constrained Convex Optimization Problem
5.4. Split Feasibility Problem
5.5. Periodic Solution of a Nonlinear Evolution Equation
- (1)
- For each r,
- (2)
- For each r,
- (3)
- For each initial value there exists a mild solution ϱ of (32) on .
- (4)
- There exists some such that
Author Contributions
Funding
Institutional Review Board Statement
Informed Consent Statement
Data Availability Statement
Conflicts of Interest
References
- Picard, E. Mémoire sur la théorie des équations aux dérivées partielles et la méthodedes approximations successives. J. Math. Pures Appl. 1890, 6, 145–210. [Google Scholar]
- Krasnosel’skiĭ, M.A. Two remarks on the method of successive approximations. Uspehi Mat. Nauk (N.S.) 1955, 10, 123–127. [Google Scholar]
- Schaefer, H. Über die Methode sukzessiver Approximationen. Jber. Deutsch. Math.-Verein. 1957, 59, 131–140. [Google Scholar]
- Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
- Byrne, C. A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 2004, 20, 103–120. [Google Scholar] [CrossRef] [Green Version]
- Combettes, P.L. On the numerical robustness of the parallel projection method in signal synthesis. IEEE Signal Process. Lett. 2001, 8, 45–47. [Google Scholar] [CrossRef]
- Combettes, P.L. The foundations of set theoretic estimation. Proc. IEEE 1993, 81, 182–208. [Google Scholar] [CrossRef]
- Combettes, P.L. The convex feasibility problem in image recovery. In Advances in Imaging and Electron Physics; Elsevier: Amsterdam, The Netherlands, 1996; Volume 95, pp. 155–270. [Google Scholar]
- Combettes, P.L. Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections. IEEE Trans. Image Process. 1997, 6, 493–506. [Google Scholar] [CrossRef] [Green Version]
- Engl, H.W.; Leitão, A. A Mann iterative regularization method for elliptic Cauchy problems. Numer. Funct. Anal. Optim. 2001, 22, 861–884. [Google Scholar] [CrossRef] [Green Version]
- Podilchuk, C.I.; Mammone, R.J. Image recovery by convex projections using a least-squares constraint. J. Opt. Soc. Am. A 1990, 7, 517–521. [Google Scholar] [CrossRef]
- Shukla, R.; Wiśnicki, A. Iterative methods for monotone nonexpansive mappings in uniformly convex spaces. Adv. Nonlinear Anal. 2021, 10, 1061–1070. [Google Scholar] [CrossRef]
- Kirk, W.A. On successive approximations for nonexpansive mappings in Banach spaces. Glasgow Math. J. 1971, 12, 6–9. [Google Scholar] [CrossRef] [Green Version]
- Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [Google Scholar] [CrossRef]
- Noor, M.A. New approximation schemes for general variational inequalities. J. Math. Anal. Appl. 2000, 251, 217–229. [Google Scholar] [CrossRef] [Green Version]
- Agarwal, R.P.; O’Regan, D.; Sahu, D.R. Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J. Nonlinear Convex Anal. 2007, 8, 61–79. [Google Scholar]
- Sahu, D.R. Applications of the S-iteration process to constrained minimization problems and split feasibility problems. Fixed Point Theory 2011, 12, 187–204. [Google Scholar]
- Thakur, B.S.; Thakur, D.; Postolache, M. A new iterative scheme for numerical reckoning fixed points of Suzuki’s generalized nonexpansive mappings. Appl. Math. Comput. 2016, 275, 147–155. [Google Scholar] [CrossRef]
- Ullah, K.; Arshad, M. Numerical reckoning fixed points for Suzukis generalized nonexpansive mappings via new iteration process. Filomat 2018, 32, 187–196. [Google Scholar] [CrossRef] [Green Version]
- Piri, H.; Daraby, B.; Rahrovi, S.; Ghasemi, M. Approximating fixed points of generalized α-nonexpansive mappings in Banach spaces by new faster iteration process. Numer. Algorithms 2019, 81, 1129–1148. [Google Scholar] [CrossRef]
- Ali, F.; Ali, J. Convergence, stability, and data dependence of a new iterative algorithm with an application. Comput. Appl. Math. 2020, 39, 15. [Google Scholar] [CrossRef]
- Ali, J.; Ali, F. A new iterative scheme to approximating fixed points and the solution of a delay differential equation. J. Nonlinear Convex Anal. 2020, 21, 2151–2163. [Google Scholar]
- García Falset, J.; Kaczor, W.a.; Kuczumow, T.; Reich, S. Weak convergence theorems for asymptotically nonexpansive mappings and semigroups. Nonlinear Anal. 2001, 43, 377–401. [Google Scholar] [CrossRef]
- Goebel, K.; Kirk, W.A. Topics in Metric Fixed Point Theory; Cambridge Studies in Advanced Mathematics; Cambridge University Press: Cambridge, UK, 1990; Volume 28, p. viii+244. [Google Scholar] [CrossRef]
- Opial, Z. Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 1967, 73, 591–597. [Google Scholar] [CrossRef] [Green Version]
- Zeidler, E. Nonlinear Functional Analysis and Its Applications. I; Fixed-Point Theorems, Translated from the German by Peter R. Wadsack; Springer: New York, NY, USA, 1986; p. xxi+897. [Google Scholar] [CrossRef]
- Xu, H.K. Inequalities in Banach spaces with applications. Nonlinear Anal. 1991, 16, 1127–1138. [Google Scholar] [CrossRef]
- Browder, F.E. Convergence theorems for sequences of nonlinear operators in Banach spaces. Math. Z. 1967, 100, 201–225. [Google Scholar] [CrossRef]
- Bruck, R.E. A simple proof of the mean ergodic theorem for nonlinear contractions in Banach spaces. Israel J. Math. 1979, 32, 107–116. [Google Scholar] [CrossRef]
- Senter, H.F.; Dotson, W.G., Jr. Approximating fixed points of nonexpansive mappings. Proc. Am. Math. Soc. 1974, 44, 375–380. [Google Scholar] [CrossRef]
- Khan, S.H. A Picard-Mann hybrid iterative process. Fixed Point Theory Appl. 2013, 69, 10. [Google Scholar] [CrossRef]
- Berinde, V. Iterative Approximation of Fixed Points; Editura Efemeride: Baia Mare, Romania, 2002; p. xii+283. [Google Scholar]
- Harder, A.M.; Hicks, T.L. Stability results for fixed point iteration procedures. Math. Japon. 1988, 33, 693–706. [Google Scholar]
- Osilike, M.O. A note on the stability of iteration procedures for strong pseudocontractions and strongly accretive type equations. J. Math. Anal. Appl. 2000, 250, 726–730. [Google Scholar] [CrossRef] [Green Version]
- Berinde, V. Summable almost stability of fixed point iteration procedures. Carpathian J. Math. 2003, 19, 81–88. [Google Scholar]
- Browder, F.E. Nonlinear operators and nonlinear equations of evolution in Banach spaces. Proc. Symp. Pure Math. Am. Math. Soc. 1976, 18. [Google Scholar] [CrossRef] [Green Version]
- Browder, F.E. Nonlinear mappings of nonexpansive and accretive type in Banach spaces. Bull. Am. Math. Soc. 1967, 73, 875–882. [Google Scholar] [CrossRef] [Green Version]
- Marino, G.; Xu, H.K. Convergence of generalized proximal point algorithms. Commun. Pure Appl. Anal. 2004, 3, 791–808. [Google Scholar] [CrossRef]
- Blum, E.; Oettli, W. From optimization and variational inequalities to equilibrium problems. Math. Student 1994, 63, 123–145. [Google Scholar]
- Zhang, S. Generalized mixed equilibrium problem in Banach spaces. Appl. Math. Mech. 2009, 30, 1105–1112. [Google Scholar] [CrossRef]
- Ceng, L.C.; Yao, J.C. Relaxed viscosity approximation methods for fixed point problems and variational inequality problems. Nonlinear Anal. 2008, 69, 3299–3309. [Google Scholar] [CrossRef]
- Browder, F.E. Existence and approximation of solutions of nonlinear variational inequalities. Proc. Nat. Acad. Sci. USA 1966, 56, 1080–1086. [Google Scholar] [CrossRef] [Green Version]
- Xu, H.K. An iterative approach to quadratic optimization. J. Optim. Theory Appl. 2003, 116, 659–678. [Google Scholar] [CrossRef]
- Censor, Y.; Elfving, T. A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 1994, 8, 221–239. [Google Scholar] [CrossRef]
- Byrne, C. Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 2002, 18, 441–453. [Google Scholar] [CrossRef]
- Xu, H.K. Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Probl. 2010, 26, 105018. [Google Scholar] [CrossRef]
- Browder, F.E. Existence of periodic solutions for nonlinear equations of evolution. Proc. Nat. Acad. Sci. USA 1965, 53, 1100–1103. [Google Scholar] [CrossRef] [PubMed] [Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 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/).
Share and Cite
Shukla, R.; Pant, R.; Sinkala, W. A General Picard-Mann Iterative Method for Approximating Fixed Points of Nonexpansive Mappings with Applications. Symmetry 2022, 14, 1741. https://doi.org/10.3390/sym14081741
Shukla R, Pant R, Sinkala W. A General Picard-Mann Iterative Method for Approximating Fixed Points of Nonexpansive Mappings with Applications. Symmetry. 2022; 14(8):1741. https://doi.org/10.3390/sym14081741
Chicago/Turabian StyleShukla, Rahul, Rajendra Pant, and Winter Sinkala. 2022. "A General Picard-Mann Iterative Method for Approximating Fixed Points of Nonexpansive Mappings with Applications" Symmetry 14, no. 8: 1741. https://doi.org/10.3390/sym14081741
APA StyleShukla, R., Pant, R., & Sinkala, W. (2022). A General Picard-Mann Iterative Method for Approximating Fixed Points of Nonexpansive Mappings with Applications. Symmetry, 14(8), 1741. https://doi.org/10.3390/sym14081741