A Modified Proximal Point Algorithm and Some Convergence Results

<abstract><p>Proximal point algorithm is one of the most popular technique to find either zero of monotone operator or minimizer of a lower semi-continuous function. In this paper, we propose a new modified proximal point algorithm for solving minimization problems and common fixed point problems in CAT(0) spaces. We prove $ \Delta $ and strong convergence of the proposed algorithm. Our results extend and improve the corresponding recent results in the literature.</p></abstract>

show abstract

A modified proximal point algorithm in geodesic metric space

Garodia

Uddin

Abdalla

et al. 2023

MATH

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A Modified Proximal Point Algorithm and Some Convergence Results

Abstract: In this paper, the convergence to minimizers of a convex function of a modified proximal point algorithm involving a single-valued nonexpansive mapping and a multivalued nonexpansive mapping in CAT(0) spaces is studied and a numerical example is given to support our main results.

Cited by 1 publication

References 30 publications

A modified proximal point algorithm in geodesic metric space

A modified proximal point algorithm in geodesic metric space

Contact Info

Product

Resources

About