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 QIDQ6593333
Jun-Feng Yin, Ji-Chen Zhao, Ze Wang
Publication date: 26 August 2024
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative numerical methods for linear systems (65F10)
Cites Work
- Unnamed Item
- Sample size selection in optimization methods for machine learning
- A randomized Kaczmarz algorithm with exponential convergence
- Linear convergence of the randomized sparse Kaczmarz method
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
- Randomized Iterative Methods for Linear Systems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Variational Analysis
- Learning Theory of Randomized Sparse Kaczmarz Method
- Adaptively sketched Bregman projection methods for linear systems
- Compressed sensing
- Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory
- On convergence rates of Kaczmarz-type methods with different selection rules of working rows
- Faster randomized block sparse Kaczmarz by averaging
- A surrogate hyperplane Kaczmarz method for solving consistent linear equations
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
Related Items (1)
This page was built for publication: The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem
