An accelerated randomized Kaczmarz method via low-rank approximation
From MaRDI portal
Publication:5266140
DOI10.1080/00207160.2014.941827zbMath1434.65040OpenAlexW2051436088MaRDI QIDQ5266140
Publication date: 30 July 2015
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.941827
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Randomized algorithms (68W20) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Extensions of Lipschitz mappings into a Hilbert space
This page was built for publication: An accelerated randomized Kaczmarz method via low-rank approximation