arXiv Analytics

Sign in

arXiv:2108.13994 [math.OC]AbstractReferencesReviewsResources

Abstract strongly convergent variants of the proximal point algorithm

Andrei Sipos

Published 2021-08-31Version 1

We prove an abstract form of the strong convergence of the Halpern-type and Tikhonov-type proximal point algorithms in CAT(0) spaces. In addition, we derive uniform and computable rates of metastability (in the sense of Tao) for these iterations using proof mining techniques.

Related articles: Most relevant | Search more
arXiv:2411.17329 [math.OC] (Published 2024-11-26)
Strong convergence and fast rates for systems with Tikhonov regularization
arXiv:2410.14369 [math.OC] (Published 2024-10-18)
Extra-Gradient Method with Flexible Anchoring: Strong Convergence and Fast Residual Decay
arXiv:1910.07873 [math.OC] (Published 2019-10-17)
On The Strong Convergence of The Gradient Projection Algorithm with Tikhonov regularizing term