Quantitative results on a Halpern-type proximal point algorithm

Abstract

We apply proof mining methods to analyse a result of Boikanyo and Moroş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.

This is a preprint of an article published in Computational Optimization and Applications. The final authenticated version is available online at: https://doi.org/10.1007/s10589-021-00263-w