Faster randomized block sparse Kaczmarz by averaging
From MaRDI portal
Publication:6109882
DOI10.1007/s11075-022-01473-xzbMath1521.65030arXiv2203.10838MaRDI QIDQ6109882
Publication date: 31 July 2023
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.10838
Convex programming (90C25) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Randomized algorithms (68W20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel coordinate descent methods for big data optimization
- Validation analysis of mirror descent stochastic approximation method
- On the acceleration of Kaczmarz's method for inconsistent linear systems
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Stochastic mirror descent dynamics and their convergence in monotone variational inequalities
- Linear convergence of the randomized sparse Kaczmarz method
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- On greedy randomized average block Kaczmarz method for solving large linear systems
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
- Convergence rates for Kaczmarz-type algorithms
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized Kaczmarz with averaging
- Randomized Extended Kaczmarz for Solving Least Squares
- The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Iterative Methods for Linear Systems
- Analysis and Generalizations of the Linearized Bregman Method
- Linearized Bregman iterations for compressed sensing
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- Exact Regularization of Convex Programs
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Robust Stochastic Approximation Approach to Stochastic Programming
- Relaxation methods for image reconstruction
- Atomic Decomposition by Basis Pursuit
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization
- Preasymptotic convergence of randomized Kaczmarz method
- On Adaptive Sketch-and-Project for Solving Linear Systems
- On stochastic Kaczmarz type methods for solving large scale systems of ill-posed equations
- Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory
- Randomized Extended Average Block Kaczmarz for Solving Least Squares
- Faster Randomized Block Kaczmarz Algorithms
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Methods of conjugate gradients for solving linear systems
- Compressed sensing
