The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem
From MaRDI portal
Publication:6593333
Recommendations
- A surrogate hyperplane Kaczmarz method for solving consistent linear equations
- A greedy average block sparse Kaczmarz method for sparse solutions of linear systems
- Linear convergence of the randomized sparse Kaczmarz method
- A surrogate hyperplane Bregman-Kaczmarz method for solving linear inverse problems
- A weighted randomized sparse Kaczmarz method for solving linear systems
Cites work
- A randomized Kaczmarz algorithm with exponential convergence
- A surrogate hyperplane Kaczmarz method for solving consistent linear equations
- Adaptively sketched Bregman projection methods for linear systems
- Compressed sensing
- Faster randomized block sparse Kaczmarz by averaging
- Learning theory of randomized sparse Kaczmarz method
- Linear convergence of the randomized sparse Kaczmarz method
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- On convergence rates of Kaczmarz-type methods with different selection rules of working rows
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory
- Randomized iterative methods for linear systems
- Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sample size selection in optimization methods for machine learning
- The linearized Bregman method via split feasibility problems: analysis and generalizations
- Variational Analysis
This page was built for publication: The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593333)
