Search

In this work, we analyse the class of strictly pseudocontractive mappings in general metric spaces by providing a comprehensive and appropriate definition of a strictly pseudocontractive mapping, which serves as a natural extension of the existing notion. Moreover, we establish its various characterizations and explore several significant properties of these mappings in relation to fixed point theory in CAT(0) spaces. Specifically, we establish that these mappings are Lipschitz continuous, satisfying the demiclosedness-type property, and possessing a closed convex fixed point set. Furthermore, we show that the fixed points of the mappings can be effectively approximated using an iterative scheme for fixed points of nonexpansive mappings. The results in this work contribute to a deeper understanding of strictly pseudocontractive mappings and their applicability in the context of fixed point theory in metric spaces. [ABSTRACT FROM AUTHOR]

Inspired by the work of Dakjum et al. [Eshi, D., Das, P. K. and Debnath, P., Coupled coincidence and coupled common fixed point theorems on a metric space with a graph, Fixed Point Theory Appl., 37 (2016), 1-14], we introduce a new class of G-f-contraction mappings in complete fuzzy metric spaces endowed with a directed graph and prove some existence results for coupled coincidence and coupled common fixed point theorems of this type of contraction mappings in complete fuzzy metric spaces endowed with a directed graph. [ABSTRACT FROM AUTHOR]

In this paper best random proximity points equations have been proved. As a result best random proximity points and best random p-proximity points have been proposed with the help of new generalized notions. These are generalizations of random fixed point theorems. Also, the concept of random best p-proximity points has also be proposed in this work and corresponding theorems are also defined here. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new modified proximal point algorithm involving fixed point iteration for nonexpansive mappings in CAT(1) spaces. Under some mild conditions, we prove that the sequence generated by our iterative algorithm Δ-converges to a common solution between certain convex optimization and fixed point problems. [ABSTRACT FROM AUTHOR]