# Quantitative results on a Halpern-type proximal point algorithm

arXiv: https://arxiv.org/abs/2001.10040 · HTML: https://mlsanity.com/paper/2001.10040/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Jan 2020.

## Built on by (most cited first, 2 of 2)

- [Asymptotic regularity of a generalised stochastic Halpern scheme](https://mlsanity.com/paper/2411.04845/) (2024)
- [Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity](https://mlsanity.com/paper/2402.05071/) (2024)

## Abstract (arXiv)

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