carpathian_2024_40_2_333_342In this research, we offer a new proximal point technique for approximating a common member of the set of all solutions of the convex minimization problems in the setting of CAT(1) spaces. We further show that, in some modest circumstances, the resulting process is convergent. Our results extend and enhance other related results in the literature.
| Author(s) | Kitkuan, Duangkamon , Padcharoen, Anantachai, Calderón, Kenyi, Martìnez-Moreno, Juan |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2024.02.07 |
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