On randomized multiple row-action methods for linear feasibility problems
From MaRDI portal
Cites work
- A new greedy Kaczmarz algorithm for the solution of very large linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Angenäherte Auflösung von Systemen linearer Gleichungen.
- Block-iterative methods for consistent and inconsistent linear equations
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- On convergence rate of the randomized Kaczmarz method
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On the relaxed greedy deterministic row and column iterative methods
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized iterative methods for linear systems
- Randomized methods for linear constraints: convergence rates and conditioning
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
- The randomized Kaczmarz method with a new random selection rule
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Variant of greedy randomized Kaczmarz for ridge regression
This page was built for publication: On randomized multiple row-action methods for linear feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013167)
