Convergence analysis of the Halpern iteration with adaptive anchoring parameters
Mathematics of Computation · 17.05.2023 · 93 (345) · 327-345
DOI: 10.1090/mcom/3851 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics of Computation, online erschienen am 17.05.2023. Verfasst von Songnian He und 3 weiteren Autor:innen. Die Arbeit wurde bisher 14-mal zitiert (Crossref) und nennt 27 Literaturangaben.
Abstract (Originalsprache)
We propose an adaptive way to choose the anchoring parameters for the Halpern iteration to find a fixed point of a nonexpansive mapping in a real Hilbert space. We prove strong convergence of this adaptive Halpern iteration and obtain the rate of asymptotic regularity at least O ( 1 / k ) O(1/k) , where k k is the number of iterations. Numerical experiments are also provided to show advantages and outperformance of our adaptive Halpern algorithm over the standard Halpern algorithm.
Zitieren
APA
He, S., Xu, H., Dong, Q., & Mei, N. (2023). Convergence analysis of the Halpern iteration with adaptive anchoring parameters. Mathematics of Computation, 93(345), 327-345. https://doi.org/10.1090/mcom/3851
Vancouver
He S, Xu H, Dong Q, Mei N. Convergence analysis of the Halpern iteration with adaptive anchoring parameters. Mathematics of Computation. 2023;93(345):327-345. doi:10.1090/mcom/3851
BibTeX
@article{He2023,
author = {He, Songnian and Xu, Hong-Kun and Dong, Qiao-Li and Mei, Na},
title = {Convergence analysis of the Halpern iteration with adaptive anchoring parameters},
journal = {Mathematics of Computation},
year = {2023},
volume = {93},
number = {345},
pages = {327--345},
doi = {10.1090/mcom/3851}
}
EUVIMED