Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2604.21443 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Tabla de Contenidos:
- The Halpern algorithm is a powerful fixed point approximation method for finding the closest point in the fixed point set of a nonexpansive mapping to the initial point. However, in practice, it is not necessarily true that this algorithm can be applied to large-scale fixed point problems, since the computation of the nonexpansive mapping is expensive. In this paper, we present mini-batch stochastic Halpern algorithm to resolve the issue caused by the computational difficulty of the mapping. We preform a convergence analysis demonstrating that the algorithm with diminishing step sizes and increasing batch sizes converges in mean square to the closest point in the fixed point set to the initial point. We also perform a convergence rate analysis demonstrating that convergence speed of the algorithm depends on the settings of the diminishing step sizes.