Showing math.OCShow all
3 papers · 1 filter
math.OC2018
Effective strong convergence of the proximal point algorithm in CAT(0) spaces
Laurentiu Leustean, Andrei Sipos
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 semicontinu…
math.OC2018
The asymptotic behaviour of convex combinations of firmly nonexpansive mappings
Andrei Sipos
We show that in the framework of CAT(0) spaces, any convex combination of two mappings which are firmly nonexpansive -- or which satisfy the more general property -- is asy…
math.OC2017
An application of proof mining to the proximal point algorithm in CAT(0) spaces
Laurentiu Leustean, Andrei Sipos
We compute, using techniques originally introduced by Kohlenbach, the first author and Nicolae, uniform rates of metastability for the proximal point algorithm in the context of CA…