The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem
From MaRDI portal
Publication:6593333
DOI10.1016/J.CAM.2024.116182zbMATH Open1546.65023MaRDI QIDQ6593333FDOQ6593333
Authors: Ze Wang, Jun-Feng Yin, Ji-Chen Zhao 
Publication date: 26 August 2024
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Cites Work
- A randomized Kaczmarz algorithm with exponential convergence
- Variational Analysis
- Sample size selection in optimization methods for machine learning
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- The linearized Bregman method via split feasibility problems: analysis and generalizations
- Randomized Iterative Methods for Linear Systems
- Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory
- Linear convergence of the randomized sparse Kaczmarz method
- Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
- Adaptively sketched Bregman projection methods for linear systems
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- Learning Theory of Randomized Sparse Kaczmarz Method
- Faster randomized block sparse Kaczmarz by averaging
- On convergence rates of Kaczmarz-type methods with different selection rules of working rows
- A surrogate hyperplane Kaczmarz method for solving consistent linear equations
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
Cited In (1)
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)
