Linear convergence of reshuffling Kaczmarz methods with sparse constraints
From MaRDI portal
Cites work
- A mathematical introduction to compressive sensing
- A proximal stochastic gradient method with progressive variance reduction
- A randomized Kaczmarz algorithm with exponential convergence
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- Angenäherte Auflösung von Systemen linearer Gleichungen.
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressive sensing and structured random matrices
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Dimensionality reduction with subgaussian matrices: a unified theory
- Efficient online and batch learning using forward backward splitting
- Greedy and randomized versions of the multiplicative Schwarz method
- High-dimensional probability. An introduction with applications in data science
- Iterative hard thresholding based on randomized Kaczmarz method
- Iterative hard thresholding for compressed sensing
- Iterative hard thresholding for low CP-rank tensor models
- Limit laws for random matrix products
- Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
- Linear convergence of reshuffling Kaczmarz methods with sparse constraints
- Low rank tensor recovery via iterative hard thresholding
- Matrix concentration for products
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- On sparse reconstruction from Fourier and Gaussian measurements
- Optimization for deep learning: an overview
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Projection method for solving a singular system of linear equations and its applications
- Quantile-based iterative methods for corrupted systems of linear equations
- Randomized Kaczmarz solver for noisy linear systems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Tail bounds via generic chaining
- Why random reshuffling beats stochastic gradient descent
This page was built for publication: Linear convergence of reshuffling Kaczmarz methods with sparse constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6937297)
