carpathian_2018_34_2_229_237_abstractcarpathian_2018_34_2_229_237In 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.
| Author(s) | Chaipunya, Parin, Cholamjiak, Prasit, Kumam, Poom, Pakkaranang, Nuttapol, Suparatulatorn, Raweerote |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2018.02.11 |
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
