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