On a proximal point algorithm for solving common fixed point problems and convex minimization problems in Geodesic spaces with positive curvature

Abstract

<abstract><p>In this article, we present a new modified proximal point algorithm in the framework of CAT(1) spaces which is utilized for solving common fixed point problem and minimization problems. Also, we prove convergence results of the obtained process under some mild conditions. Our results extend and improve several corresponding results of the existing literature.</p></abstract>

Approximating Common Solution of Minimization Problems Involving Asymptotically Quasi-Nonexpansive Multivalued Mappings

“…Khatoon et al [34,35] carried out great work on a modified proximal point algorithm for nearly asymptotically quasi-nonexpansive mappings. Khunpanuk et al [36] worked on a proximal point algorithm for solving common fixed-point problems and convex minimization problems in Geodesic spaces with positive curvature. Garodia et al [37] worked on constrained minimization, variational inequality and a split feasibility problem via a new iteration scheme in Banach spaces.…”