2021
DOI: 10.48550/arxiv.2108.13994
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Abstract strongly convergent variants of the proximal point algorithm

Andrei Sipos

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.

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 44 publications
0
1
0
Order By: Relevance
“…The quantitative analysis allowed to generalize this reduction to the non-linear setting of hyperbolic spaces, which in turn allowed for several applications of previously known rates of metastability for these algorithms. Our final example can be found in [44] where the author adapts the analysis of the strong convergence of the Halpern type Proximal Point Algorithm, given in [28], from the setting of Banach spaces to CATp0q-spaces. This gave rise to new qualitative convergence results.…”
Section: Final Remarksmentioning
confidence: 99%
“…The quantitative analysis allowed to generalize this reduction to the non-linear setting of hyperbolic spaces, which in turn allowed for several applications of previously known rates of metastability for these algorithms. Our final example can be found in [44] where the author adapts the analysis of the strong convergence of the Halpern type Proximal Point Algorithm, given in [28], from the setting of Banach spaces to CATp0q-spaces. This gave rise to new qualitative convergence results.…”
Section: Final Remarksmentioning
confidence: 99%