Pages that link to "Item:Q328467"
From MaRDI portal
The following pages link to The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467):
Displaying 9 items.
- On the \(\ell_1\)-norm invariant convex \(k\)-sparse decomposition of signals (Q743785) (← links)
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays (Q1929588) (← links)
- Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration (Q2069147) (← links)
- The sparsest solution of the union of finite polytopes via its nonconvex relaxation (Q2311128) (← links)
- An efficient algorithm for non-convex sparse optimization (Q2315622) (← links)
- Concave programming for finding sparse solutions to problems with convex constraints (Q3096890) (← links)
- Sparse Recovery of Nonnegative Signals With Minimal Expansion (Q4572748) (← links)
- An Empirical-Bayes Approach to Recovering Linearly Constrained Non-Negative Sparse Signals (Q4579435) (← links)
- Sparse Signal Approximation via Nonseparable Regularization (Q4620785) (← links)
