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

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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Nearly unbiased variable selection under minimax concave penalty
The sparsity and bias of the LASSO selection in high-dimensional linear regression
A randomized Kaczmarz algorithm with exponential convergence
Linear convergence of the randomized sparse Kaczmarz method
Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
Atomic Decomposition by Basis Pursuit
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
Analysis and Generalizations of the Linearized Bregman Method
Linearized Bregman iterations for compressed sensing
Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Sparse Approximate Solutions to Linear Systems
Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
Adaptively sketched Bregman projection methods for linear systems
Randomized Extended Average Block Kaczmarz for Solving Least Squares
Faster Randomized Block Kaczmarz Algorithms
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Faster randomized block sparse Kaczmarz by averaging
Sparse sampling Kaczmarz–Motzkin method with linear convergence

This page was built for publication: A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty