A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Convex programming (90C25) Randomized algorithms (68W20) Iterative numerical methods for linear systems (65F10) Computing methodologies for image processing (68U10)

Cites Work

Nearly unbiased variable selection under minimax concave penalty
Title not available (Why is that?)
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Title not available (Why is that?)
A randomized Kaczmarz algorithm with exponential convergence
Analysis of multi-stage convex relaxation for sparse regularization
Title not available (Why is that?)
The sparsity and bias of the LASSO selection in high-dimensional linear regression
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
The linearized Bregman method via split feasibility problems: analysis and generalizations
Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
Linearized Bregman iterations for compressed sensing
Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
Title not available (Why is that?)
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Efficiency of coordinate descent methods on huge-scale optimization problems
Sparse Approximate Solutions to Linear Systems
Atomic decomposition by basis pursuit
A weighted difference of anisotropic and isotropic total variation model for image processing
Randomized extended Kaczmarz for solving least squares
Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
Analysis and generalizations of the linearized Bregman method
Convergence of the linearized Bregman iteration for $\ell _1$-norm minimization
Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
Randomized extended average block Kaczmarz for solving least squares
Linear convergence of the randomized sparse Kaczmarz method
Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
Sparse sampling Kaczmarz–Motzkin method with linear convergence
Faster randomized block Kaczmarz algorithms
Adaptively sketched Bregman projection methods for linear systems
Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
Faster randomized block sparse Kaczmarz by averaging

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)