On greedy multi-step inertial randomized Kaczmarz method for solving linear systems
Abstract
The multi-step inertial randomized Kaczmarz (MIRK) method is an iterative method for solving large-scale linear systems. In this paper, we enhance the MIRK method by incorporating the greedy probability criterion, coupled with the introduction of a tighter threshold parameter for this criterion. We prove that the proposed greedy MIRK (GMIRK) method enjoys an improved deterministic linear convergence compared to both the MIRK method and the greedy randomized Kaczmarz method. Furthermore, we exhibit that the multi-step inertial extrapolation approach can be geometrically interpreted as an orthogonal projection method, and establish its relationship with the sketch-and-project method in (SIAM J. Matrix Anal. Appl. 36(4):1660-1690, 2015) and the oblique projection technique in (Results Appl. Math. 16:100342, 2022). Numerical experiments are provided to confirm our results.
Cite
@article{arxiv.2308.00467,
title = {On greedy multi-step inertial randomized Kaczmarz method for solving linear systems},
author = {Yansheng Su and Deren Han and Yun Zeng and Jiaxin Xie},
journal= {arXiv preprint arXiv:2308.00467},
year = {2024}
}
Comments
to appear in Calcolo