Bias versus non-convexity in compressed sensing
From MaRDI portal
Publication:2155168
DOI10.1007/s10851-022-01071-5OpenAlexW4220914429MaRDI QIDQ2155168
Marcus Carlsson, Daniele Gerosa, Carl Olsson
Publication date: 15 July 2022
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-022-01071-5
Cites Work
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Nearly unbiased variable selection under minimax concave penalty
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- Support recovery without incoherence: a case for nonconvex regularization
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A simple prior-free method for non-rigid structure-from-motion factorization
- One-step sparse estimates in nonconcave penalized likelihood models
- Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex low rank approximation
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- On convex envelopes and regularization of non-convex functionals without moving global minima
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- Strong oracle optimality of folded concave penalized estimation
- Convex Recovery of a Structured Signal from Independent Random Linear Measurements
- Robust principal component analysis?
- Compressed Sensing: How Sharp Is the Restricted Isometry Property?
- SparseNet: Coordinate Descent With Nonconvex Penalties
- Just relax: convex programming methods for identifying sparse signals in noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- An unbiased approach to compressed sensing
- On phase retrieval via matrix completion and the estimation of low rank PSD matrices
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima
- A general theory of concave regularization for high-dimensional sparse estimation problems
This page was built for publication: Bias versus non-convexity in compressed sensing
