On the relaxed greedy deterministic row and column iterative methods
From MaRDI portal
Publication:2161834
DOI10.1016/j.amc.2022.127339OpenAlexW4221157473MaRDI QIDQ2161834
Ling-Xia Cui, Qian Zuo, Nianci Wu
Publication date: 5 August 2022
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.15186
Algorithms in computer science (68Wxx) Numerical linear algebra (65Fxx) Basic linear algebra (15Axx)
Related Items (1)
Cites Work
- Unnamed Item
- Randomized block Kaczmarz method with projection for solving least squares
- A randomized Kaczmarz algorithm with exponential convergence
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Randomized Iterative Methods for Linear Systems
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Convergence analyses based on frequency decomposition for the randomized row iterative method
- On Adaptive Sketch-and-Project for Solving Linear Systems
- Randomized Extended Average Block Kaczmarz for Solving Least Squares
- Faster Randomized Block Kaczmarz Algorithms
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
- On greedy randomized coordinate descent methods for solving large linear least‐squares problems
- Semiconvergence analysis of the randomized row iterative method and its extended variants
This page was built for publication: On the relaxed greedy deterministic row and column iterative methods
