Abstract strongly convergent variants of the proximal point algorithm
Optimization and Control
2022-11-22 v4 Logic
Abstract
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.
Cite
@article{arxiv.2108.13994,
title = {Abstract strongly convergent variants of the proximal point algorithm},
author = {Andrei Sipos},
journal= {arXiv preprint arXiv:2108.13994},
year = {2022}
}