Full Text: PDF
Volume 2, Issue 2, 1 August 2018, Pages 219-228
Abstract. We apply methods of proof mining to obtain uniform quantitative bounds on the strong convergence of the proximal point algorithm for finding minimizers of convex, lower semicontinuous, proper functions in CAT(0) spaces. Thus, for uniformly convex functions, we compute rates of convergence, while, for totally bounded CAT(0) spaces, we apply methods introduced by Kohlenbach, Leuştean and Nicolae to compute rates of metastability.
How to Cite this Article:
Laurențiu Leuştean, Andrei Sipoş, Effective strong convergence of the proximal point algorithm in CAT(0) spaces, J. Nonlinear Var. Anal. 2 (2018), 219-228.