Abstract
In this manuscript, a new three-step iterative scheme to approximate fixed points in the setting of Busemann spaces is introduced. The proposed algorithms unify and extend most of the existing iterative schemes. Thereafter, by making consequent use of this method, strong and -convergence results of mappings that satisfy the condition () in the framework of uniformly convex Busemann space are obtained. Our results generalize several existing results in the same direction.
Keywords:
the condition (ℰμ); standard three-step iteration algorithm; fixed point; uniformly convex Busemann space MSC: AMS Subject Classification:
47H09; 47H10; 54H25; 54E40
1. Introduction
Throughout this paper, , , and denote the set of all real numbers, positive real numbers, and fixed points of the mapping ℘, respectively.
The fixed point theory is considered one of the most powerful analytical techniques in mathematics, especially in nonlinear analysis, where it plays a prominent role in algorithm technology. The purpose of investing in algorithms is to obtain the best algorithms with a faster convergence rate, because the lower the convergence rate, the faster the speed of obtaining the solution. This is probably the drawback of using the iterative methods.
It should be noted that the Mann iteration converges faster than the Ishikawa iteration for the class of Zamfirescu operators [1], and hence the convergence behavior of proclaimed and empirically proven faster iterative schemes need not always be faster. There was extensive literature on proclaimed new and faster iteration schemes in ancient times. Some of the iteration schemes are undoubtedly better versions of previously existed iteration schemes, whereas a few are only the special cases. There are more than twenty iteration schemes in the present literature. Our analysis’s focal objective is to unify the existing results in the framework of Busemann spaces (see [2] for the precise definitions and properties of Busemann spaces). This analysis has a special significance in terms of unification, and numerous researchers have intensively investigated various aspects of it.
Apart from Picard, Mann, and Ishikawa, many iterative schemes with better convergence rates are obtained; see, for example, [3,4,5,6,7,8,9,10,11]. In many cases, these algorithms cannot obtain strong convergence; therefore, it was necessary to investigate new effective algorithms. Recently, several authors were able to apply the strong convergence of algorithms, see [12,13,14,15,16].
Recall that a metric space is called a path (or simply a [17]) in if there is a path , such that is an isometry for . A is an isometry , and a line is an isometry . For more details about path in metric fixed point theory, see [18,19,20,21,22,23,24].
Definition 1 ([17]).
Let be a metric space and . A path joining j to ℓ is a mapping such that and
for all . Particularly, γ is an isometry and
A segment joining j and ℓ in is the image of a path in . The space is said to be a space, if every two points of j are joined by a .
Definition 2 ([17]).
A metric space is said to be a space if given two arbitrary points of there exists a path that joins them.
Definition 3 ([17]).
The metric space is said to be Busemann space, if for any two affinely reparametrized and the map defined by
is a convex; that is, the metric of Busemann space is convex. In a Busemann space the joining any two points is unique.
Proposition 1 ([25]).
In such spaces, the hypotheses below hold:
- (1)
- (2)
- (3)
- (4)
where and .
Busemann spaces are also hyperbolic spaces, which were introduced by Kohlenbach [26]. Further, is said to be uniquely geodesic [17] if there is exactly one joining j and ℓ for each
Definition 4 ([17]).
Suppose that is a uniquely space and is a segment joining j and ℓ and Then,
will be a unique point in satisfying
and
In the sequel, the notation is used for segment and is denoted by . A subset is said to be convex if includes every geodesic segment joining any two of its points. Let be a metric space and We say that ℘ is convex if for every path the map is a convex. It is known that if is a convex function and is an increasing convex function, then is convex.
We now introduce our algorithm.
Let be a complete Busemann space, be a nonempty convex subset of and be a mapping. For any ,
where , , , , and for are sequences in . Moreover, , and .
Remark 1.
For distinct values of , , , , and for , we have well-known distinct iteration schemes as follows:
- (1)
- , , , in the standard three-step iteration scheme, we obtain the Noor iterative scheme [27].
- (2)
- , , and in the standard three-step iteration scheme, we obtain the SP iterative scheme [28].
- (3)
- , , and in the standard three-step iteration scheme, we obtain the Picard-S iterative scheme [29].
- (4)
- and , and in the standard three-step iteration scheme, we obtain the iterative scheme [30].
- (5)
- , , in the standard three-step iteration scheme, we obtain the Abbas and Nazir iterative scheme [31].
- (6)
- , , and in the standard three-step iteration scheme, we obtain the P iterative scheme [32].
- (7)
- , , and in the standard three-step iteration scheme, we obtain the D iterative scheme [33].
- (8)
- , in the standard three-step iteration scheme, we obtain the Mann iterative scheme [34].
- (9)
- , and in the standard three-step iteration scheme, we obtain the Ishikawa iterative scheme [35].
2. Preliminaries
In this section, we present some relevant and essential definitions, lemmas, and theorems needed in the sequel.
Definition 5 ([36]).
The Busemann space is called uniformly convex if for any and there exists a map δ such that for every three points , , and implies that
where m denotes the midpoint of any geodesic segment (i.e., ) and A mapping is called a modulus of uniform convexity, for and for a given .
Henceforth, the uniform convexity modulus with a decreasing modulus concerning (for a fixed ) is termed as the uniform convexity monotone modulus. The subsequent lemmas and geometric properties, which are instrumental throughout the discussion to learn about essential terms of Busemann spaces, are necessary to achieve our significant findings and are as follows:
Lemma 1.
If ℘ is a mapping satisfying condition and has a fixed point then it is a quasi-nonexpansive mapping.
Let be a nonempty closed convex subset of a Busemann space , and let be a bounded sequence in . For , we set
The asymptotic radius of is given by
and the asymptotic center of relative to is the set
It is known that, in a Busemann space, consists of exactly one point [37].
Recall that a bounded sequence is said to be regular [38], if for every subsequence of .
Lemma 2 ([4]).
Let be a Busemann space and , a sequence in , for some If and are sequences in satisfying
also,
and
for some then
Lemma 3 ([5]).
If is a closed convex subset of a uniformly convex Busemann space and is a bounded sequence in , then the asymptotic center of belongs to
Lemma 4 ([38]).
Let be a Busemann space, be a bounded sequence in and be a subset of . Then has a subsequence, which is regular in
Definition 6 ([38]).
A sequence in Busemann space is said to be if there exists some such that j is the unique asymptotic center of for every subsequence of . In this case we write and it is called the of .
Lemma 5 ([21]).
Every bounded sequence in a complete Busemann space always has a subsequence.
Lemma 6 ([21]).
Suppose that is a closed convex subset of a Busemann space and satisfies the condition (). Then to j and implying that and
Definition 7.
Assume that is a subset of a Busemann space . For , a mapping is called:
- (i)
- Contraction if there is so that
- (ii)
- Nonexpansive if
- (iii)
- Quasi-nonexpansive if and denote the set
- (iv)
- Satisfy Condition if
- (v)
- Suzuki generalized nonexpansive if it verifies Condition .
Garcia-Falset et al. [6] introduced the generalization for nonexpansive mappings known as condition ().
Definition 8 ([6]).
Let A mapping is said to satisfy condition if for all , we have
We say that ℘ satisfies condition , if ℘ satisfies condition for some [39].
Theorem 1.
Let be a nonempty bounded, closed and convex subset of a complete space . If is a generalized nonexpansive mapping, then ℘ has a fixed point in . Moreover, is closed and convex.
3. Main Results
We begin this section with the proof of the following lemmas:
Lemma 7.
Let be a nonempty closed convex subset of a complete Busemann space , and let be a mapping satisfying condition . For an arbitrary chosen , let the sequence be generated by a standard three-step iteration algorithm with the condition
and
Then, exists for all .
Proof.
Let and . Since ℘ satisfies condition , and hence
From standard three-step iteration algorithm, we have
Also,
Using the value of , we have
Since , we have
Now,
Since
we have
On substituting
we have
Also, it is given that
we have
This implies that is bounded and non-increasing for all . Hence, exists, as required. □
Lemma 8.
Let be a nonempty closed convex subset of complete Busemann space , and be a mapping satisfying condition . For an arbitrary chosen , let the sequence be generated by a standard three-step iteration algorithm. Then, is nonempty if and only if is bounded and for a unique asymptotic center.
Proof.
Since , let and . Using Lemma 7, there is an existence of , which confirms the boundedness of . Assuming
on combining this result with the values of and of Lemma 7
Also,
On the other hand, by using the value of of Lemma 7, we have
by the above-mentioned standard three-step iteration algorithm,
This implies that,
This implies that,
and hence, we have
Therefore,
By using Equations (1) and (2), we have
Using Equations (1) and (3) and the above-mentioned inequalities, we have
and hence, by Lemma 2, we have
Conversely, suppose that is bounded and . Then, by Lemma 4 has a subsequence that is regular with respect to . Let be a subsequence of in such a way that . Hence, we have
As a consequence, the uniqueness of the asymptotic center ensures that is a fixed point of ℘ so this concludes the proof. □
Now, we state and prove our main theorems in this section.
Theorem 2.
Let be a nonempty closed convex subset of a compete Busemann space and be a mapping satisfying condition . For an arbitrary chosen , assume that is a sequence generated by a standard three-step iteration algorithm. Then and converges to a fixed point of ℘.
Proof.
Since , so by Lemma 8, we have bounded and
Also, let
where the union is taken over all subsequences of . We claim that . Considering , then there is an existence of subsequence of in such a way that Using Lemmas 3 and 5 there is an existence of subsequence of in such a way that . Since , then by Lemma 6 . We claim that . In contrast, since ℘ is a mapping satisfying condition ( and , then by Lemma 7 there is an existence of . Using the uniqueness of asymptotic centers, we have
which is a contradiction. So . To prove that converges to a fixed point of ℘, it is sufficient to show that consists of exactly one point. Considering a subsequence of . By Lemmas 3 and 5 there is existence of subsequence of , which is how . Let and . We can conclude the explanation by proving that . On the contrary, since is convergent, then by the uniqueness of the asymptotic centers, we have
which is a contradiction. Hence, and converges to a fixed point of ℘. □
Theorem 3.
Let be a nonempty closed convex and complete Busemann space , and be a mapping verification condition . For an arbitrary chosen , assume that is a sequence generated by a standard three-step iteration algorithm. Then converges strongly to a fixed point of ℘.
Proof.
By Lemmas 7, 8 and Theorem 2, we have so by Lemma 8 is bounded and converges to . Suppose on the contrary that does not converge strongly to . By the compactness assumption, passing to subsequences if necessary, we may assume that there exists with such that converges strongly to . Therefore,
Since is the unique asymptotic center of , it follows that , which is a contradiction. Hence, converges strongly to a fixed point of ℘. □
4. Conclusions
The extension of the linear version of fixed point results to nonlinear domains has its own significance. To achieve the objective of replacing a linear domain with a nonlinear one, Takahashi [40] introduced the notion of a convex metric space and studied fixed point results of nonexpansive mappings in this direction. Since the standard three-step iteration scheme unifies various existing iteration schemes for different values of and for , existing results of the standard three-step iteration scheme including strong and results in the setting of Busemann spaces satisfying condition are generalized.
Author Contributions
All authors have equally contributed to this work. All authors have read and agreed to the published version of the manuscript.
Funding
This work received no external funding.
Acknowledgments
The authors are very grateful to the anonymous reviewers for their constructive comments leading to the substantial improvement of the paper.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Babu, G.V.R.; Prasad, K. Mann iteration converges faster than Ishikawa iteration for the class of zamfirescu operators. Fixed Point Theory Appl. 2006, 2006, 49615. [Google Scholar] [CrossRef]
- Busemann, H. Spaces with nonpositive curvature. Acta Math. 1948, 80, 259–310. [Google Scholar] [CrossRef]
- Sosov, E.N. On analogues of weak convergence in a special metric space. Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika 2004, 5, 84–89. [Google Scholar]
- Lawaong, W.; Panyanak, B. Approximating fixed points of nonexpansive nonself-mappings in CAT(0) spaces. Fixed Point Theory Appl. 2010, 2010, 367274. [Google Scholar] [CrossRef][Green Version]
- Dhompongsa, S.; Inthakon, W.; Kaewkhao, A. Edelstien’s method and Fixed point theorems for some generalized nonexpansive mappings. J. Math. Anal. Appl. 2009, 350, 12–17. [Google Scholar] [CrossRef]
- Garcia-Falset, J.; Llorens-Fuster, E.; Suzuki, T. Fixed point theory for a class of generalized nonexpansive mappings. J. Math. Anal. Appl. 2011, 375, 185–195. [Google Scholar] [CrossRef]
- Ðukić, D.; Paunović, L.; Radenović, S. Convergence of iterates with errors of uniformly quasi-Lipschitzian mappings in cone metric spaces. Kragujev. J. Math. 2011, 35, 399–410. [Google Scholar]
- Todorčević, V. Harmonic Quasiconformal Mappings and Hyperbolic Type Metrics; Springer Nature: Cham, Switzerland, 2019. [Google Scholar]
- Xu, H.-K.; Altwaijry, N.; Chebbi, S. Strong convergence of mann’s iteration process in Banach Spaces. Mathematics 2020, 8, 954. [Google Scholar] [CrossRef]
- Ivanov, S.I. General local convergence theorems about the Picard iteration in arbitrary normed fields with applications to Super-Halley method for multiple polynomial zeros. Mathematics 2020, 8, 1599. [Google Scholar] [CrossRef]
- Berinde, V. Iterative Approximation of Fixed Points. In Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany, 2007. [Google Scholar]
- Ansari, Q.H.; Islam, M.; Yao, J.C. Nonsmooth variational inequalities on Hadamard manifolds. Appl. Anal. 2020, 99, 340–358. [Google Scholar] [CrossRef]
- Hammad, H.A.; ur Rehman, H.; De la Sen, M. Advanced Algorithms and common solutions to variational inequalities. Symmetry 2020, 12, 1198. [Google Scholar] [CrossRef]
- Dang, Y.; Sun, J.; Xu, H. Inertial accelerated algorithms for solving a split feasibility problem. J. Ind. Manag. Optim. 2017, 13, 1383–1394. [Google Scholar] [CrossRef]
- Hammad, H.A.; ur Rehman, H.; De la Sen, M. Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications. Math. Probl. Eng. 2020, 2020, 7487383. [Google Scholar] [CrossRef]
- Tuyen, T.M.; Hammad, H.A. Effect of Shrinking Projection and CQ-Methods on Two Inertial Forward-Backward Algorithms for Solving Variational Inclusion Problems. In Rendiconti del Circolo Matematico di Palermo Series 2; Available online: https://doi.org/10.1007/s12215-020-00581-8 (accessed on 27 February 2021).
- Papadopoulos, A. Metric Spaces, Convexity and Nonpositive Curvature. In IRMA Lectures in Mathematics and Theoretical Physics; European Mathematical Society: Strasbourg, France, 2005. [Google Scholar]
- Sharma, N.; Mishra, L.N.; Mishra, V.N.; Almusawa, H. End point approximation of standard three-step multivalued iteration algorithm for nonexpansive mappings. Appl. Math. Inf. Sci. 2021, 15, 73–81. [Google Scholar]
- Khamsi, M.A.; Kirk, W.A. An Introduction to Metric Spaces and Fixed Point Theory; John Wiley: New York, NY, USA, 2011. [Google Scholar]
- Bridson, M.; Haefliger, A. Metric Spaces of Non-Positive Curvature; Springer: Berlin, Germany, 1999. [Google Scholar]
- Kirk, W.A.; Panyanak, B. A concept of convergence in geodesic spaces. Nonlinear Anal. 2008, 68, 3689–3696. [Google Scholar] [CrossRef]
- Kirk, W.A. Geodesic geometry and fixed point theory. In Seminar of Mathematical Analysis; Colecc. Abierta: Malaga, Spain, 2003. [Google Scholar]
- Foertsch, T.; Lytchak, A.; Schroeder, V. Non-positive curvature and the Ptolemy inequality. Int. Math. Res. Not. 2007, 2007, rnm100. [Google Scholar]
- Kirk, W.A. Geodesic geometry and fixed point theory II. In International Conference on Fixed Point Theory and Applications; Yokohama Publ.: Yokohama, Japan, 2004; pp. 113–142. [Google Scholar]
- Bagherboum, M. Approximating fixed points of mappings satisfying condition (E) in Busemann space. Numer. Algorithms 2016, 71, 25–39. [Google Scholar] [CrossRef]
- Kohlenbach, U. Some Logical theorems with applications in functional analysis. Tran. Am. Math. Soc. 2005, 357, 89–128. [Google Scholar] [CrossRef]
- Noor, M.A. New approximation schemes for general variational inequalities. J. Math. Anal. Appl. 2000, 251, 217–229. [Google Scholar] [CrossRef]
- Phuengrattana, W.; Suantai, S. On the rate of convergence of Mann, Ishikawa, Noor and SP-iterations for continuous functions on an arbitrary interval. J. Comput. Appl. Math. 2011, 235, 3006–3014. [Google Scholar] [CrossRef]
- Gursoy, F.; Karakaya, V. A Picard-S hybrid type iteration method for solving a differential equation with retarded argument. arXiv 2014, arXiv:1403.25-46. [Google Scholar]
- Chugh, R.; Kumar, V.; Kumar, S. Strong Convergence of a new three step iterative scheme in Banach spaces. Am. J. Comput. Math. 2012, 2, 345–357. [Google Scholar] [CrossRef]
- Abbas, M.; Nazir, T. A new faster iteration process applied to constrained minimization and feasibility problems. Mat. Vesn. 2014, 66, 223–234. [Google Scholar]
- Sainuan, P. Rate of convergence of P-iteration and S-iteration for continuous functions on closed intervals. Thai J. Math. 2015, 13, 449–457. [Google Scholar]
- Daengsaen, J.; Khemphet, A. On the Rate of Convergence of P-Iteration, SP-Iteration, and D-Iteration Methods for Continuous Non-decreasing Functions on Closed Intervals. Abstr. Appl. Anal. 2018, 2018, 7345401. [Google Scholar] [CrossRef]
- Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
- Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [Google Scholar] [CrossRef]
- Goebel, K.; Reich, S. Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings; Marcel Dekker: New York, NY, USA; Basel, Switzerland, 1984. [Google Scholar]
- Dhompongsa, S.; Kirk, W.A.; Sims, B. Fixed points of uniformly lipschitzian mappings. Nonlinear Anal. 2006, 65, 762–772. [Google Scholar] [CrossRef]
- Kirk, W.; Shahzad, N. Fixed Point Theory in Distance Spaces; Springer: Cham, Switzerland; Heidelberg, Germany; New York, NY, USA; Dordrecht, The Netherlands; London, UK, 2014. [Google Scholar]
- Ullah, K.; Khan, B.A.; Ozer, O.; Nisar, Z. Some Convergence Results Using K* Iteration Process in Busemann Spaces. Malays. J. Math. Sci. 2019, 13, 231–249. [Google Scholar]
- Takahashi, T. A convexity in metric spaces and nonexpansive mappings. Kodai Math. Semin. Rep. 1970, 22, 142–149. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 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 (http://creativecommons.org/licenses/by/4.0/).