carpathian_2024_40_2_343_361This paper considers the framework of CAT
(0) spaces and analyzes coupled best proximity points for cyclic Kannan and cyclic Chatterjea contractions. The framework is substantial and versatile for employing metric notions and contractive conditions. For each mapping, we establish the existence and uniqueness of the coupled best proximity point. The work gives a step toward investigating the best proximity points in CAT(0) spaces.
| Author(s) | Dechboon, Premyuda, Khammahawong, Konrawut, Mongkolkeha, Chirasak, Salisu, Sani |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2024.02.08 |
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
Fixed point theorems for basic θ-contraction and applications
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
Periodic cycles for an extension of generalized 3x + 1 functions
Some remarks on expansive mappings in metric spaces
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
Extreme solution for fractional differential equation with nonlinear boundary condition
Generalized Split Feasibility Problem: Solution by Iteration
