The non-convex sparse problem with nonnegative constraint for signal reconstruction
DOI10.1007/s10957-016-0869-2zbMath1353.65058OpenAlexW2308325646MaRDI QIDQ328467
Wanquan Liu, Guanglu Zhou, Louis Caccetta, Xin Zhang, Yong Wang
Publication date: 20 October 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-0869-2
algorithmcomputational complexitycombinatorial optimizationsignal reconstructionlimited-memory BFGS algorithmnon-convex optimization problemnon-Lipschitz continuousnonnegative sparse solution
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Uses Software
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Iterative thresholding for sparse approximations
- On the limited memory BFGS method for large scale optimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Thresholding-based iterative selection procedures for model selection and shrinkage
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
- Exact matrix completion via convex optimization
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Compressed sensing and best 𝑘-term approximation
- Restricted isometry properties and nonconvex compressive sensing
- Decoding by Linear Programming
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- Fast Sparse Representation Based on Smoothed ℓ0 Norm
- Optimized Projections for Compressed Sensing
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- An Improved Smoothed $\ell^0$ Approximation Algorithm for Sparse Representation
- A Subband Adaptive Iterative Shrinkage/Thresholding Algorithm
- On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- Sparse Approximate Solutions to Linear Systems
- A Limited Memory Algorithm for Bound Constrained Optimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Sparse Approximation via Penalty Decomposition Methods
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
