Quantitative results on a Halpern-type proximal point algorithm

Abstract

We apply proof mining methods to analyse a result of Boikanyo and Moro\c{s}anu on the strong convergence of a Halpern-type proximal point algorithm. As a consequence, we obtain quantitative versions of this result, providing uniform effective rates of asymptotic regularity and metastability.