Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}{{ k}} \right)}\)
SIAM Journal on Numerical Analysis · 31.12.2023 · 61 (6) · 2813-2843
DOI: 10.1137/22m1504305 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Numerical Analysis, online erschienen am 20.11.2023. Verfasst von Radu Ioan Boţ und 1 weiteren Autor:innen. Die Arbeit wurde bisher 21-mal zitiert (Crossref) und nennt 44 Literaturangaben. Gefördert von: Austrian Science Fund.
Abstract (Originalsprache)
The Krasnosel’skiĭ–Mann (KM) algorithm is the most fundamental iterative scheme designed to find a fixed point of an averaged operator in the framework of a real Hilbert space, since it lies at the heart of various numerical algorithms for solving monotone inclusions and convex optimization problems. We enhance the Krasnosel’skiĭ–Mann algorithm with Nesterov’s momentum updates and show that the resulting numerical method exhibits a convergence rate for the fixed point residual of [Formula: see text] while preserving the weak convergence of the iterates to a fixed point of the operator. Numerical experiments illustrate the superiority of the resulting so-called Fast KM algorithm over various fixed point iterative schemes, and also its oscillatory behavior, which is a specific of Nesterov’s momentum optimization algorithms.
Förderung
- Austrian Science Fund
Zitieren
APA
Boţ, R. I., & Nguyen, D. (2023). Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}{{ k}} \right)}\). SIAM Journal on Numerical Analysis, 61(6), 2813-2843. https://doi.org/10.1137/22m1504305
Vancouver
Boţ RI, Nguyen D. Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}{{ k}} \right)}\). SIAM Journal on Numerical Analysis. 2023;61(6):2813-2843. doi:10.1137/22m1504305
BibTeX
@article{Bo2023,
author = {Boţ, Radu Ioan and Nguyen, Dang-Khoa},
title = {Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol o \left(\frac1 k \right)\)},
journal = {SIAM Journal on Numerical Analysis},
year = {2023},
volume = {61},
number = {6},
pages = {2813--2843},
doi = {10.1137/22m1504305}
}
EUVIMED