A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty
From MaRDI portal
Publication:6559997
Cites work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1089159 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- A randomized Kaczmarz algorithm with exponential convergence
- A weighted difference of anisotropic and isotropic total variation model for image processing
- Adaptively sketched Bregman projection methods for linear systems
- Analysis and generalizations of the linearized Bregman method
- Analysis of multi-stage convex relaxation for sparse regularization
- Atomic decomposition by basis pursuit
- Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
- Faster randomized block Kaczmarz algorithms
- Faster randomized block sparse Kaczmarz by averaging
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Linear convergence of the randomized sparse Kaczmarz method
- Linearized Bregman iterations for compressed sensing
- Nearly unbiased variable selection under minimax concave penalty
- Randomized extended Kaczmarz for solving least squares
- Randomized extended average block Kaczmarz for solving least squares
- Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Sparse Approximate Solutions to Linear Systems
- Sparse sampling Kaczmarz–Motzkin method with linear convergence
- The linearized Bregman method via split feasibility problems: analysis and generalizations
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559997)
