On the Randomized Kaczmarz Algorithm
Not on the map. Why?
Abstract (arXiv)
The Randomized Kaczmarz Algorithm is a randomized method which aims at solving a consistent system of over determined linear equations. This note discusses how to find an optimized randomization scheme for this algorithm, which is related to the question raised by citec2. Illustrative experiments are conducted to support the findings.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 12 Feb 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 3; 2023: 1; 2024: 0; 2025: 1.
5 papers.
- 2022UNO: Unlimited Sampling Meets One-Bit Quantizationcited by 11
- 2025KCLNet: Physics-Informed Power Flow Prediction via Constraints Projectionscited by 4
- 2022Linear Discriminant Analysis with the Randomized Kaczmarz Methodcited by 1
- 2022ORKA: Accelerated Kaczmarz Algorithms for Signal Recovery from One-Bit Samplescited by 1
- 2023One-Bit Quadratic Compressed Sensing: From Sample Abundance to Linear Feasibilitycited by 1
- 2025KCLNet: Physics-Informed Power Flow Prediction via Constraints Projections15 Jun 2025
- 2023One-Bit Quadratic Compressed Sensing: From Sample Abundance to Linear Feasibility16 Mar 2023
- 2022UNO: Unlimited Sampling Meets One-Bit Quantization10 Dec 2022
- 2022ORKA: Accelerated Kaczmarz Algorithms for Signal Recovery from One-Bit Samples8 Dec 2022
- 2022Linear Discriminant Analysis with the Randomized Kaczmarz Method10 Nov 2022