The non-convex sparse problem with nonnegative constraint for signal reconstruction
From MaRDI portal
(Redirected from Publication:328467)
Recommendations
- A linearly convergent algorithm for sparse signal reconstruction
- Sparse Optimization with Least-Squares Constraints
- Concave programming for finding sparse solutions to problems with convex constraints
- A gradient projection method for the sparse signal reconstruction in compressive sensing
- A modulus-based iterative method for sparse signal recovery
Cites work
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Limited Memory Algorithm for Bound Constrained Optimization
- A Subband Adaptive Iterative Shrinkage/Thresholding Algorithm
- A stochastic linear-quadratic programming model for the newsvendor problem
- An Improved Smoothed $\ell^0$ Approximation Algorithm for Sparse Representation
- An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Decoding by Linear Programming
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Exact matrix completion via convex optimization
- Fast Sparse Representation Based on Smoothed ℓ0 Norm
- Iterative thresholding for sparse approximations
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- On the limited memory BFGS method for large scale optimization
- Optimized Projections for Compressed Sensing
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Restricted isometry properties and nonconvex compressive sensing
- Sparse Approximate Solutions to Linear Systems
- Sparse Approximation via Penalty Decomposition Methods
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Stable signal recovery from incomplete and inaccurate measurements
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
- Thresholding-based iterative selection procedures for model selection and shrinkage
Cited in
(11)- Concave programming for finding sparse solutions to problems with convex constraints
- Sparse signal recovery via exponential metric approximation
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- An efficient algorithm for non-convex sparse optimization
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Sparse recovery under nonnegativity and sum-to-one constraints
- Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration
- An Empirical-Bayes Approach to Recovering Linearly Constrained Non-Negative Sparse Signals
- On the \(\ell_1\)-norm invariant convex \(k\)-sparse decomposition of signals
- The sparsest solution of the union of finite polytopes via its nonconvex relaxation
- Sparse Signal Approximation via Nonseparable Regularization
This page was built for publication: The non-convex sparse problem with nonnegative constraint for signal reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328467)
