On greedy multi-step inertial randomized Kaczmarz method for solving linear systems
From MaRDI portal
Publication:6622730
DOI10.1007/s10092-024-00621-0MaRDI QIDQ6622730
Jiaxin Xie, Yansheng Su, Yun Zeng, Deren Han
Publication date: 22 October 2024
Published in: Calcolo (Search for Journal in Brave)
oblique projectionKaczmarz methodinertial extrapolationgreedy probability criterionsketch-and-projectdeterministic linear convergence
Cites Work
- Unnamed Item
- Unnamed Item
- Two-subspace projection method for coherent overdetermined systems
- A randomized Kaczmarz algorithm with exponential convergence
- A new greedy Kaczmarz algorithm for the solution of very large linear systems
- On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
- Kaczmarz method with oblique projection
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
- MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
- The mathematics of computerized tomography
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Randomized Iterative Methods for Linear Systems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Uncertainty principles and ideal atomic decomposition
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- On Adaptive Sketch-and-Project for Solving Linear Systems
- On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems
- Computed Tomography: Algorithms, Insight, and Just Enough Theory
- Adaptively sketched Bregman projection methods for linear systems
- On greedy randomized coordinate descent methods for solving large linear least‐squares problems
- Some methods of speeding up the convergence of iteration methods
- Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory
- On convergence rates of Kaczmarz-type methods with different selection rules of working rows
- Greedy capped nonlinear Kaczmarz methods
This page was built for publication: On greedy multi-step inertial randomized Kaczmarz method for solving linear systems