A greedy average block sparse Kaczmarz method for sparse solutions of linear systems
From MaRDI portal
Publication:6549107
DOI10.1016/J.AML.2024.109053zbMATH Open1540.65117MaRDI QIDQ6549107
Publication date: 3 June 2024
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative numerical methods for linear systems (65F10)
Cites Work
- Title not available (Why is that?)
- Sample size selection in optimization methods for machine learning
- A randomized Kaczmarz algorithm with exponential convergence
- Linear convergence of the randomized sparse Kaczmarz method
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
- The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
- Randomized Iterative Methods for Linear Systems
- Image reconstruction from a small number of projections
- Adaptively sketched Bregman projection methods for linear systems
- Faster Randomized Block Kaczmarz Algorithms
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
- Regularized Kaczmarz Algorithms for Tensor Recovery
- Compressed sensing
- Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems
- Faster randomized block sparse Kaczmarz by averaging
Related Items (1)
This page was built for publication: A greedy average block sparse Kaczmarz method for sparse solutions of linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6549107)
