A residual-based randomized Kaczmarz method for solving linear feasibility problems
From MaRDI portal
Cites work
- A fast block nonlinear Bregman-Kaczmarz method with averaging for nonlinear sparse signal recovery
- A fast Bregman projection method for linearly constrained optimization problems
- A greedy average block sparse Kaczmarz method for sparse solutions of linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- A surrogate hyperplane Bregman-Kaczmarz method for solving linear inverse problems
- A surrogate hyperplane Kaczmarz method for solving consistent linear equations
- A surrogate hyperplane Kaczmarz method with oblique projection for solving linear systems
- A variational inequality model for the construction of signals from inconsistent nonlinear equations
- Angenäherte Auflösung von Systemen linearer Gleichungen.
- Block Kaczmarz method with inequalities
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- Randomized extended average block Kaczmarz for solving least squares
- Randomized methods for linear constraints: convergence rates and conditioning
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem
This page was built for publication: A residual-based randomized Kaczmarz method for solving linear feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314800)
