In this paper, we introduce a new iterative method for nonexpansive mappings in CAT(
) spaces. First, the rate of convergence of proposed method and comparison with recently existing method is proved. Second, strong and 
-convergence theorems of the proposed method in such spaces under some mild conditions are also proved. Finally, we provide some non-trivial examples to show efficiency and comparison with many previously existing methods.
| Author(s) | Pakkaranang, Nuttapol, Uddin, Izhar, Bantaojai, Thanatporn, Yimmuang, Panu, Garodia, Chanchal |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2021.02.01 |
Approximate Solutions for Multi-Objective Optimization Problems via Scalarizing and Nonscalarizing Methods
A product of strongly quasi-nonexpansive mappings in Hadamard spaces
Inertial viscosity fixed point algorithms for monotone inclusion, convex minimization, and image restoration problems
Holderian Stability for Parametric Optimization Models and Applications
A Novel Fixed-Point Based Two-Step Inertial Algorithm for Convex Bilevel Optimization in Deep Learning Data Classification
Double-step inertial algorithms for equilibrium and fixed point problems in Hilbert spaces
Accelerated forward-backward algorithm based on inertial and correction terms with linesearch for solving convex minimization problem and its application
A Dual-Projective Double Inertial Forward-Backward Splitting Algorithm for Variational Inclusion Problems with Applications to External Validation in Breast Cancer Diagnosis
Efficient Large-Scale Classification with Linex Least Square Twin Bounded Support Vector Machine
Classifying compressive strength of clay bricks using an inertial projected forward-backward algorithm