Bias versus non-convexity in compressed sensing

Cites Work

Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
Nearly unbiased variable selection under minimax concave penalty
SparseNet: coordinate descent with nonconvex penalties
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
One-step sparse estimates in nonconcave penalized likelihood models
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Enhancing sparsity by reweighted \(\ell _{1}\) minimization
Robust principal component analysis?
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
Just relax: convex programming methods for identifying sparse signals in noise
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
Stable signal recovery from incomplete and inaccurate measurements
Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
A general theory of concave regularization for high-dimensional sparse estimation problems
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
Iterative thresholding for sparse approximations
Strong oracle optimality of folded concave penalized estimation
Regularized \(M\)-estimators with nonconvexity: statistical and algorithmic theory for local optima
Minimization of non-smooth, non-convex functionals by iterative thresholding
Convex Recovery of a Structured Signal from Independent Random Linear Measurements
Compressed sensing: how sharp is the restricted isometry property?
Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
Global convergence of ADMM in nonconvex nonsmooth optimization
Support recovery without incoherence: a case for nonconvex regularization
A simple prior-free method for non-rigid structure-from-motion factorization
Convex low rank approximation
On convex envelopes and regularization of non-convex functionals without moving global minima
An unbiased approach to compressed sensing
On phase retrieval via matrix completion and the estimation of low rank PSD matrices

Cited In (1)

Unbiasing in iterative reconstruction algorithms for discrete compressed sensing

This page was built for publication: Bias versus non-convexity in compressed sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155168)