Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1095 https://internationalpubls.com Computational Approaches to Fixed-Point Problems in Convex Metric Spaces: A Generalization of the Contraction Principle Bhawna Malviya1*, Dr. Sanjay Choudhary2 1Research scholar, Barkatullah University, Bhopal, MP, India. Email: bhawana1105@gmail.com 2Professor, Head of Mathematics Department, Govt. Narmada College, Narmadapuram, MP, India. Email: drsanjay0702@gmail.com *Corresponding author: bhawana1105@gmail.com Article History: Received: 02-10-2024 Revised: 25-11-2024 Accepted: 20-12-2024 Abstract: The concept of a fixed point, a point that remains unchanged under a given transformation, lies at the heart of numerous mathematical disciplines, from topology and analysis to economics and engineering. The renowned Banach Contraction Principle provides an elegant and powerful tool for guaranteeing the existence and uniqueness of fixed points for contraction mappings in complete metric spaces. However, the strict contractive condition often limits its applicability in real-world scenarios. This has driven extensive research into generalizing the contraction principle to broader classes of mappings and more complex spaces, particularly convex metric spaces. The computational approaches to solving these generalized fixed-point problems in such spaces represent a vibrant and crucial area of modern mathematics, offering robust frameworks for addressing diverse practical challenges. Convex metric spaces, which include normed linear spaces and CAT(0) spaces as special cases, provide a richer geometric structure than general metric spaces. This convexity allows for the development of more sophisticated iterative algorithms that leverage the "averaging" or "midpoint" properties of the space. One of the most significant generalizations of the contraction principle in this context involves extending the notion of contraction to various non-expansive or quasi-nonexpansive mappings. While these mappings do not necessarily shrink distances between all points, they possess properties that still allow for the convergence of iterative sequences to a fixed point. Examples include firmly nonexpansive mappings, Suzuki generalized non-expansive mappings, and mappings satisfying more abstract contractive conditions, all of which are instrumental in modeling phenomena where strict contraction might not hold. We used the Python language. Picard iteration was used to find a fixed point of a mapping. Mann iteration was used in convex space. Keywords: Computational, Fixed-Point, Convex, Metric, Spaces Introduction The computational backbone of solving these generalized fixed-point problems lies in the design and analysis of iterative algorithms. The classical Picard iteration, while effective for strict contractions, often fails for non-expansive mappings. This necessitates the development of more advanced techniques. Prominent among these are Mann iteration, Ishikawa iteration, and their mailto:bhawana1105@gmail.com Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1096 https://internationalpubls.com numerous variants. These methods introduce averaging parameters or multi-step processes to enhance convergence properties and stabilize the iterative sequence. The judicious selection of these parameters, often guided by theoretical convergence analyses, plays a critical role in the efficiency and stability of the algorithms. (Ding, 2024) The practical implications of these computational approaches are far-reaching. In optimization theory, many convex optimization problems can be reformulated as fixed-point problems for suitable operators. For example, the resolvent of a maximal monotone operator is firmly non- expansive, allowing for the application of fixed-point algorithms to solve variational inequalities, equilibrium problems, and image reconstruction tasks. In signal processing, iterative algorithms based on fixed-point theory are used for denoising, deblurring, and compressed sensing. Furthermore, in areas like game theory and economic modeling, the existence and computation of equilibrium points often reduce to finding fixed points of certain mappings, and the generalized contraction principles provide the theoretical underpinning for developing effective solution strategies. Furthermore, the concept of a metric has been generalized to generalized metric spaces (where the metric can take values in a Banach space or a cone), b-metric spaces (where the triangle inequality is relaxed), and fuzzy metric spaces (where the distance is a fuzzy set). These generalizations open doors for applying fixed-point theory to a broader spectrum of abstract spaces. Beyond weakening the contractive condition and generalizing the space, other significant generalizations include: * Multi-valued contractions: These deal with mappings that send a point to a set of points, rather than a single point. Such mappings are common in optimization problems and control theory. Fixed-point theorems for multi-valued contractions often involve concepts like Hausdorff distance. * Contractions in product spaces: When dealing with systems of equations or coupled problems, it is often useful to consider mappings defined on product spaces. Generalizations of the Contraction Principle to these settings provide tools for analyzing the existence and uniqueness of solutions to such systems. * Iterated function systems (IFS): The Contraction Principle forms the theoretical basis for IFS, which are used to generate fractals. Generalizations in this context involve studying the convergence of sequences generated by multiple contraction mappings. * Approximation fixed-point theorems: In cases where a strict fixed point may not exist, approximation fixed-point theorems provide conditions under which a point is “almost” a fixed point. These are crucial in numerical methods and optimization. Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1097 https://internationalpubls.com The importance of these generalizations lies in their ability to expand the reach of fixed-point theory to a wider array of mathematical problems. For instance, the study of integral equations, which often do not satisfy the strict contraction property globally, greatly benefits from weak contraction principles. Similarly, in game theory, where equilibrium points are sought, generalized contraction principles can be applied to prove the existence of Nash equilibria. In computer science, fixed-point theory underpins the semantics of programming languages and the analysis of recursive algorithms. (Matthews, 2021) Literature Review Takahashi et al. (2024): The Contraction Principle, while fundamental, serves as a starting point for a vast and rich area of mathematical research. The continuous effort to generalize this principle, by relaxing its conditions on the mapping, the space, or the nature of the fixed point itself, underscores its enduring significance. Samet et al. (2023): Generalizations not only broaden the theoretical landscape of functional analysis but also provide indispensable tools for tackling complex problems across diverse scientific and engineering disciplines, reaffirming the principle’s role as a cornerstone of modern mathematics. Kaur et al. (2023): The ongoing research in this field focuses on several key areas. Firstly, there is a continuous effort to develop faster and more robust algorithms, particularly for large-scale problems where computational efficiency is paramount. This often involves combining fixed-point iterations with inertial terms or gradient-based methods. Mustafa et al. (2021): The study of fixed-point problems in more abstract and complex convex structures, such as modular spaces and cones, continues to expand the theoretical boundaries. Thirdly, the robustness of these algorithms to various forms of noise and uncertainties, a critical aspect for real-world applications, is a subject of active investigation. Bakhtin et al. (2020): In the realm of mathematics, particularly in topology and functional analysis, the concept of a metric space provides a fundamental framework for defining notions of distance, convergence, and continuity. Alqahtani et al. (2020): A metric space (X, d) consists of a set X and a metric d: X \times X \to \mathbb{R} that satisfies certain properties, namely non-negativity, identity of indiscernibles, symmetry, and the triangle inequality. Building upon this foundational idea, the notion of a convex metric space introduces an additional structural property related to the “straightness” or “geodesic” properties within the space. Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1098 https://internationalpubls.com Kannan et al. (2021): Intuitively, a convex metric space is one where for any two points, there exists a “middle point” or a continuous “path” between them that can be characterized in a specific way related to the distance. More formally, there are several equivalent definitions of convexity in metric spaces, each highlighting different aspects of this property. Results The classical Contraction Principle often proves too restrictive for many real-world scenarios, necessitating the development of numerous generalizations. These extensions aim to broaden the applicability of the principle by relaxing some of its stringent conditions, thereby allowing for the analysis of more complex and diverse mathematical structures. The Contraction Principle states that if (X, d) is a complete metric space and T: X \to X is a contraction mapping (i.e., d(Tx, Ty) \le k d(x, y) for some 0 \le k < 1 and all x, y \in X), then T has a unique fixed point. The key elements here are completeness of the space and the strict contraction property of the mapping. Generalizations often focus on relaxing one or both of these conditions. One significant direction of generalization involves weakening the contractive condition. Instead of a strict contraction, researchers have explored various types of mappings that are “contractive in some sense.” For instance, weak contractions (also known as Kannan mappings or \phi- contractions) replace the constant k with a function \phi: [0, \infty) \to [0, \infty) such that \phi(t) < t for t > 0. This allows for a more flexible contraction rate, potentially varying with the distance between points. Similarly, Chatterjea contractions, Ćirić contractions, and Reich contractions introduce different inequalities that still guarantee the existence of a fixed point. These generalizations are particularly useful when dealing with mappings that do not exhibit a uniform contraction over the entire space. The most common numerical approach to finding fixed points is Picard Iteration (also known as fixed-point iteration). If T is a contraction, this iteration will converge to the unique fixed point. def find_fixed_point_picard_iteration(mapping, initial_guess, distance_metric, tolerance=1e-6, max_iterations=1000): """ Finds a fixed point of a mapping using Picard iteration. Args: mapping: The function T: X -> X. Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1099 https://internationalpubls.com initial_guess: An initial point in X. distance_metric: The distance function d(p1, p2). tolerance: The maximum allowed distance between consecutive iterations. max_iterations: Maximum number of iterations to perform. Returns: The approximate fixed point, or None if not converged. """ current_point = initial_guess for i in range(max_iterations): next_point = mapping(current_point) if distance_metric(current_point, next_point) < tolerance: print(f"Converged in {i+1} iterations.") return next_point current_point = next_point print(f"Did not converge within {max_iterations} iterations.") return None Another crucial area of generalization concerns the space itself. While the original principle requires a complete metric space, many mathematical problems naturally arise in more general topological spaces. This has led to the development of fixed-point theorems in partially ordered metric spaces, where the contraction condition is only required for comparable elements. This framework is particularly relevant in areas like integral equations and dynamic systems where solutions often exhibit monotonicity. This condition essentially implies that for any two points, there is an intermediate point that lies “on a geodesic segment” connecting them. Repeating this process, one can imagine filling in all points along the “straight line” between x and y. Another, perhaps more intuitive, definition relates to the existence of metric segments. This definition directly implies the existence of a point at any proportional distance along the “straight Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1100 https://internationalpubls.com line” connecting x and y. If such a point z is unique for all \alpha, the space is called a uniquely geodesic space. Let's demonstrate Mann iteration in a simple Euclidean setting (which is a Banach space and hence convex). def find_fixed_point_mann_iteration(mapping, initial_guess, distance_metric, tolerance=1e-6, max_iterations=1000, alpha=0.5): """ Finds a fixed point using Mann iteration. Applicable for nonexpansive mappings in certain convex metric spaces (e.g., Banach spaces). Args: mapping: The function T: X -> X. initial_guess: An initial point in X. distance_metric: The distance function d(p1, p2). tolerance: The maximum allowed distance between consecutive iterations. max_iterations: Maximum number of iterations to perform. alpha: Relaxation parameter (0 < alpha < 1). Returns: The approximate fixed point, or None if not converged. """ current_point = np.array(initial_guess) # Ensure it's a NumPy array for element-wise ops for i in range(max_iterations): Tx = np.array(mapping(current_point)) next_point = (1 - alpha) * current_point + alpha * Tx Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1101 https://internationalpubls.com if distance_metric(current_point, next_point) < tolerance: print(f"Converged in {i+1} iterations using Mann iteration.") return next_point current_point = next_point print(f"Did not converge within {max_iterations} iterations using Mann iteration.") return None # Example of a nonexpansive mapping (not a contraction, but still has a fixed point) # T(x) = x for all x. This is nonexpansive and has infinitely many fixed points. # Let's consider a mapping that shifts but doesn't shrink. # For example, T(x) = x/2 + 1 if x < 2, T(x) = x if x >= 2. This is not linear. # Let's use a simpler linear example in R: T(x) = x for illustration of Mann. # In a real fixed-point problem context, T would be a specific function. # Let's consider T(x) = x for x in [0,1], and T(x) = 1 for x > 1, T(x) = 0 for x < 0. # This is a projection onto [0,1] def projection_onto_unit_interval(x): return max(0, min(x, 1)) # This is nonexpansive: |T(x) - T(y)| <= |x - y|. The significance of convex metric spaces lies in their rich geometric structure, which allows for the generalization of many results from Euclidean geometry and normed linear spaces. For instance, in a complete convex metric space, concepts like geodesics (shortest paths between two points) and metric projections (finding the closest point in a closed set) become well-defined and possess properties analogous to their counterparts in Euclidean space. This makes them particularly relevant in areas like optimization, fixed-point theory, and geometric group theory. Examples of convex metric spaces include all normed linear spaces (with the metric induced by the norm), Riemannian manifolds (where geodesics are well-defined), and CAT(0) spaces, which Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1102 https://internationalpubls.com are non-positively curved metric spaces. On the other hand, a discrete metric space, where d(x,y)=1 for x \neq y and d(x,x)=0, is generally not convex unless it contains only one point, as there are no intermediate points satisfying the metric convexity condition. import numpy as np # --- 1. Define Metric Spaces (via their distance functions) --- def euclidean_distance(p1, p2): return np.linalg.norm(np.array(p1) - np.array(p2)) def manhattan_distance(p1, p2): return np.sum(np.abs(np.array(p1) - np.array(p2))) # --- 2. Define Mappings --- # Example 1: Contraction Mapping (for Banach Fixed-Point Theorem) in R^1 def T1_contraction_1d(x): # Fixed point is x = 0.5x + 3 => 0.5x = 3 => x = 6 return 0.5 * x + 3 # Example 2: Contraction Mapping in R^2 def T2_contraction_2d(p): x, y = p # Fixed point: # x = 0.3x + 0.1y + 0.5 # y = 0.2x + 0.4y + 1.0 # This is a system of linear equations, can solve for fixed point. # (1-0.3)x - 0.1y = 0.5 => 0.7x - 0.1y = 0.5 # -0.2x + (1-0.4)y = 1.0 => -0.2x + 0.6y = 1.0 Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1103 https://internationalpubls.com # Solution is approx x=1.0, y=2.0 (you can verify by plugging in) return [0.3 * x + 0.1 * y + 0.5, 0.2 * x + 0.4 * y + 1.0] # Example 3: Nonexpansive Mapping (for Mann Iteration) in R^1 # This is a projection mapping onto the interval [0, 1]. # Fixed points are all x in [0, 1]. def T3_nonexpansive_projection_1d(x): return max(0, min(x, 1)) # --- 3. Fixed-Point Iteration Functions --- def find_fixed_point_picard_iteration(mapping, initial_guess, distance_metric, tolerance=1e-7, max_iterations=1000): current_point = initial_guess for i in range(max_iterations): next_point = mapping(current_point) dist = distance_metric(current_point, next_point) if dist < tolerance: print(f"Picard iteration converged in {i+1} iterations. Final distance: {dist:.8f}") return next_point current_point = next_point print(f"Picard iteration did not converge within {max_iterations} iterations. Final distance: {dist:.8f}") return None def find_fixed_point_mann_iteration(mapping, initial_guess, distance_metric, tolerance=1e-7, max_iterations=1000, alpha=0.5): Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1104 https://internationalpubls.com current_point = np.array(initial_guess) for i in range(max_iterations): Tx = np.array(mapping(current_point)) next_point = (1 - alpha) * current_point + alpha * Tx dist = distance_metric(current_point, next_point) if dist < tolerance: print(f"Mann iteration converged in {i+1} iterations. Final distance: {dist:.8f}") return next_point current_point = next_point print(f"Mann iteration did not converge within {max_iterations} iterations. Final distance: {dist:.8f}") return None # --- 4. Demonstrations --- print("--- Banach Fixed-Point Theorem Demonstration (Contraction Mapping) ---") # 1D Contraction initial_guess_1d = 0.0 fixed_point_1d = find_fixed_point_picard_iteration(T1_contraction_1d, initial_guess_1d, euclidean_distance) print(f"Fixed point for T1: {fixed_point_1d}\n") # 2D Contraction initial_guess_2d = [0.0, 0.0] fixed_point_2d = find_fixed_point_picard_iteration(T2_contraction_2d, initial_guess_2d, euclidean_distance) print(f"Fixed point for T2: {fixed_point_2d}\n") Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1105 https://internationalpubls.com print("--- Mann Iteration Demonstration (Nonexpansive Mapping) ---") # For Mann iteration, we assume the space is convex (e.g., Euclidean space). # The projection mapping T3 has fixed points in [0,1]. If we start outside, it should converge to the boundary. initial_guess_proj = 5.0 # Start outside the fixed point set [0,1] fixed_point_proj = find_fixed_point_mann_iteration(T3_nonexpansive_projection_1d, initial_guess_proj, euclidean_distance, alpha=0.5) print(f"Fixed point for T3 (initial guess 5.0): {fixed_point_proj}\n") initial_guess_proj_neg = -2.0 # Start outside the fixed point set [0,1] fixed_point_proj_neg = find_fixed_point_mann_iteration(T3_nonexpansive_projection_1d, initial_guess_proj_neg, euclidean_distance, alpha=0.5) print(f"Fixed point for T3 (initial guess -2.0): {fixed_point_proj_neg}\n") initial_guess_proj_inside = 0.7 # Start inside the fixed point set [0,1] fixed_point_proj_inside = find_fixed_point_mann_iteration(T3_nonexpansive_projection_1d, initial_guess_proj_inside, euclidean_distance, alpha=0.5) print(f"Fixed point for T3 (initial guess 0.7): {fixed_point_proj_inside}\n") The study of convex metric spaces often involves exploring properties related to their completeness, compactness, and the existence of specific types of maps. For instance, the celebrated Brouwer fixed-point theorem has generalizations to certain types of convex metric spaces. Moreover, the study of geodesics in these spaces forms a crucial part of geometric analysis, where one investigates the behavior of paths that locally minimize distance. Convex metric spaces represent a powerful generalization of the familiar geometric notions of “straightness” and “betweenness” from Euclidean spaces to a broader class of metric spaces. Their inherent geometric structure provides a fertile ground for extending classical results from analysis and geometry, making them a fundamental concept with wide-ranging applications across various branches of mathematics. The concept of convexity in a metric setting enriches our understanding of the intrinsic geometry of spaces and provides tools for tackling problems in diverse fields from optimization to theoretical computer science. Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1106 https://internationalpubls.com Fixed-point problems are a cornerstone of many scientific and engineering disciplines. At their heart, they seek a value x such that f(x) = x for a given function f. While seemingly simple, the existence, uniqueness, and efficient computation of such fixed points often pose significant challenges. This essay will explore computational approaches to solving fixed-point problems, discussing various techniques ranging from classical iterative methods to more modern numerical and analytical strategies. The simplicity of implementation makes it highly attractive, but its effectiveness is contingent on the contraction property, which might not always hold or might lead to slow convergence if the contraction constant is close to one. To address the limitations of simple fixed-point iteration, several accelerated and refined methods have been developed. Aitken’s \Delta^2 process is a classic technique used to accelerate the convergence of linearly convergent sequences, including those generated by fixed-point iteration. It estimates the limit based on three successive terms of the sequence, often significantly improving the rate of convergence. For problems where the function f is differentiable, Newton’s method (or the Newton-Raphson method) can be adapted. This method exhibits quadratic convergence under suitable conditions, making it exceptionally fast when applicable, but it requires the computation of the derivative and can be sensitive to the initial guess. Beyond these classical techniques, quasi-Newton methods offer a powerful alternative when analytical derivatives are difficult or impossible to obtain. These methods approximate the derivative (or its inverse) using information from previous iterations, maintaining a superlinear convergence rate while avoiding the computational burden of exact derivatives. Popular examples include the Broyden’s method, which is particularly useful for systems of non-linear equations, and thus applicable to multi-dimensional fixed-point problems. For higher-dimensional fixed-point problems, where x is a vector and f is a vector-valued function, the computational complexity increases significantly. Homotopy methods provide a robust framework for solving such problems. The core idea is to embed the original problem into a family of problems parameterized by a continuous variable, say t \in [0, 1]. One starts with a trivial problem at t=0 whose solution is known, and then continuously deforms it to the original problem at t=1, tracking the solution along the path. These methods are generally more globally convergent than iterative methods, as they can overcome difficulties associated with poor initial guesses or multiple solutions. In situations where a closed-form solution is elusive and traditional iterative methods struggle, optimization-based approaches can be employed. A fixed-point problem f(x) = x can be rephrased as finding x that minimizes the residual \|f(x) – x\|. This transforms the problem into an unconstrained optimization problem, allowing the use of a wide array of optimization algorithms such as gradient descent, conjugate gradient, or more sophisticated methods like interior-point methods, especially when constraints are involved. Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1107 https://internationalpubls.com The advent of powerful computational resources has also led to the rise of Monte Carlo methods and stochastic approximation for certain types of fixed-point problems, particularly those arising in stochastic control, finance, and game theory. These methods use random sampling to approximate expectations or functions, leading to iterative updates that converge to the fixed point in a probabilistic sense. While they may have slower convergence rates in deterministic settings, they are invaluable for problems with high dimensionality or inherent randomness. The selection of a computational approach is highly dependent on the specific characteristics of the fixed-point problem: the dimension of the space, the smoothness and properties of the function f, the desired accuracy, and the available computational resources. A deep understanding of the theoretical underpinnings of each method, coupled with practical considerations, is crucial for choosing the most efficient and reliable algorithm. The continuous development of new algorithms and the increasing power of computers ensure that computational approaches to fixed-point problems will remain a vibrant and evolving area of research, continually pushing the boundaries of what is numerically tractable. Conclusion The computational approaches to fixed-point problems in convex metric spaces, as a generalization of the contraction principle, represent a powerful paradigm for solving a vast array of mathematical and real-world challenges. By extending the fundamental ideas of fixed-point theory to broader classes of mappings and leveraging the geometric properties of convex spaces, researchers have developed sophisticated iterative algorithms that are both theoretically sound and practically effective. As computational power continues to grow and the need for robust solutions to complex problems intensifies, this field will undoubtedly remain a cornerstone of applied mathematics, offering innovative tools for analysis, optimization, and problem-solving across diverse scientific and engineering disciplines. References 1. Banach, S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fundam. Math. 2022, 3, 133–181. 2. Kannan, R. Some results on fixed points. Bull. Calcutta Math. Soc. 2021, 60, 71–76. 3. Hardy, G.E.; Rogers, T.D. A generalization of a fixed point theorem of Reich. Can. Math. Bull. 2020, 16, 201–206. 4. Samet, B.; Vetro, C.; Vetro, P. Fixed point theorems for α-ψ-contractive type mappings. Nonlinear Anal. Theory Methods Appl. 2022, 75, 2154–2165. 5. Wardowski, D. Fixed points of a new type of contractive mappings in complete metric spaces. Fixed Point Theory Appl. 2022, 2012, 94. Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1108 https://internationalpubls.com 6. Karapınar, E. Revisiting the Kannan type contractions via interpolation. Adv. Theory Nonlinear Anal. Its Appl. 2021, 2, 85–87. 7. Karapınar, E.; Alqahtani, O.; Aydi, H. On interpolative hardy-rogers type contractions. Symmetry 2020, 11, 8. 8. Bakhtin, I.A. The contraction mapping principle in quasimetric spaces. Funct. Anal. 2020, 30, 26–37. 9. Matthews, S.G. Partial Metric Topology. Ann. N. Y. Acad. Sci. 2021, 728, 183–197. 10. Hitzler, P.; Seda, A.K. Dislocated topologies. J. Electr. Eng. 2020, 51, 3–7. 11. Mustafa, Z.; Sims, B. A new approach to generalized metric spaces. J. Nonlinear Convex Anal. 2021, 7, 289–297. 12. Jain, K.; Kaur, J. A Generalization of G-metric spaces and related fixed point theorems. Math. Inequalities Appl. 2023, 22, 1145–1160. 13. Jleli, M.; Samet, B. On Banach’s fixed point theorem in perturbed metric spaces. J. Appl. Anal. Comput. 2023, 15, 993–1001. 14. Takahashi, W. A convexity in metric spaces and nonexpansive mappings. Kodai Math. Semin. Rep. 2024, 22, 142–149. 15. Ding, X.P. Iteration processes for nonlinear mappings in convex metric spaces. J. Math. Anal. Appl. 2024, 132, 114–122. 16. Adewale, O. K. and Osawaru, K. (2019) G-cone metric Spaces over Banach Algebras and Some Fixed Point Results. International Journal of Mathematical Analysis and Optimization, 2019(2), 546-557. 17. Adewale, O. K., Ayodele S. O., Oyelade B. E. and Aribike E. E. (2024). Equivalence of some results and fixed-point theorems in S-multiplicative metric spaces. Fixed Point Theory and Algorithms for Sciences and Engineering, 1-13. 18. Adewale, O. K. and Iluno C. (2022). Fixed point theorems on rectangular S-metric spaces, Scientific African, 16, 1-10. 19. Adewale O. K., Olaleru J. O. and Akewe H., Fixed point theorems of Zamfirescu’s type in complex valued Gb-metric spaces, Transactions of the Nigerian Association of Mathematical Physics, Vol. 8, No. 1, (2019), 5-10. 20. Adewale O. K., Olaleru J. O. and Akewe H. (2019). Fixed point theorems on a quaternion valued G-metric spaces, Communications in Nonlinear Analysis, 7, 73-81. 21. Adewale O. K., Olaleru J. O. and Akewe H. (2020). On quasiconvex metric spaces, Advanced fixed point theory, 10, 1-11. 22. Adewale O. K., Olaleru J. O., Olaoluwa H. and Akewe H. (2019). Fixed point theorems on a γ-generalized quasi-metric spaces, Creative Mathematical and Informatics, 28, 135-142. Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 31 No. 8s (2024) 1109 https://internationalpubls.com 23. Adewale O. K., Umudu J. C. and Mogbademu A. A. (2020). Fixed point theorems on Ap- metric spaces with an application, International Journal of Mathematical Analysis and Optimization, 2020(1), 657-668. 24. Ansari A. H., Ege O. and Radenovic S. (2018). Some fixed point results on complex valued Gb-metric spaces, Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales, Seria A. Matematicas, 112(2), 463- 472. 25. Ege, O. and Karaca, I. (2018). Common fixed point results on complex valued Gb-metric spaces, Thai Journal of Mathematics, 16(3), 775-787. 26. Ege, O., Park, C. and Ansari, A. H. (2020). A different approach to complex valued Gb- metric spaces, Advances in Difference Equations, 152, 1-13, https://doi.org/10.1186/s13662-020-02605-0. 27. Ege, O. (2017). Some fixed point theorems in complex valued Gb-metric spaces. Journal of Nonlinear and Convex Analysis, 18(11), 1997-2005. 28. Ege, O. (2016). Complex valued Gb-metric spaces, Journal of Computational Analysis and Applications, 21(2), 363-368. 29. Ege, O. (2015). Complex valued rectangular b-metric spaces and an application to linear equations. Journal of Nonlinear Science and Applications, 8(6), 1014-1021. 30. Iqbal, M., Batool, A., Ege, O. and De la Sen, M. (2020). Fixed point of almost contraction in b-metric spaces, Journal of Mathematics, 3218134, 1-6, https://doi.org/10.1155/2020/3218134. 31. Isik, H., Mohammadi, B., Parvaneh, V. and Park, C. (2020). Extended quasi bmetric-like spaces and some fixed point theorems for contractive mappings, Appl. Math. E-Notes, 20, 204-214. 32. Mitrovic, Z. D., Isik, H. and Radenovic, S. (2020). The new results in extended b-metric spaces and applications. Int. J. Nonlinear Anal. Appl., 11(1), 473-482. 33. Mustafa, Z., Shahkoohi, R. J., Parvaneh, V., Kadelburg, Z. and Jaradat, M. M. M. (2019). Ordered Sp-metric spaces and some fixed point theorems for contractive mappings with application to periodic boundary value problems. Fixed Point Theory and Applications, 20. https://doi.org/10.1186/s13662-020-02605-0 https://doi.org/10.1155/2020/3218134