Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
From MaRDI portal
(Redirected from Publication:2806702)
Recommendations
- Faster randomized block sparse Kaczmarz by averaging
- On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem
- On greedy randomized block Kaczmarz method for consistent linear systems
- On the complexity analysis of randomized block-coordinate descent methods
- Randomized extended average block Kaczmarz for solving least squares
- scientific article; zbMATH DE number 7708789
- Randomized primal-dual proximal block coordinate updates
- Randomized block subsampling Kaczmarz-Motzkin method
- Block coordinate descent methods for semidefinite programming
- Randomized block Kaczmarz method with projection for solving least squares
Cited in
(21)- Linear convergence of the randomized sparse Kaczmarz method
- A weighted randomized sparse Kaczmarz method for solving linear systems
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
- Randomized primal-dual proximal block coordinate updates
- Learning theory of randomized sparse Kaczmarz method
- Adaptively sketched Bregman projection methods for linear systems
- scientific article; zbMATH DE number 7266294 (Why is no real title available?)
- Regularized Kaczmarz Algorithms for Tensor Recovery
- Faster randomized block sparse Kaczmarz by averaging
- A greedy average block sparse Kaczmarz method for sparse solutions of linear systems
- A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty
- The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem
- Adaptive Bregman-Kaczmarz: an approach to solve linear inverse problems with independent noise exactly
- Acceleration and restart for the randomized Bregman-Kaczmarz method
- A surrogate hyperplane Bregman-Kaczmarz method for solving linear inverse problems
- Randomized Kaczmarz with geometrically smoothed momentum
- Randomized Kaczmarz methods with beyond-Krylov convergence
- A fast Bregman projection method for linearly constrained optimization problems
- Minimal error momentum Bregman-Kaczmarz
- Quantile-based random sparse Kaczmarz for corrupted and noisy linear systems
- Iterative hard thresholding based on randomized Kaczmarz method
This page was built for publication: Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806702)