Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
From MaRDI portal
Publication:1929588
DOI10.1155/2012/646045zbMath1254.92028OpenAlexW2096394018WikidataQ36432356 ScholiaQ36432356MaRDI QIDQ1929588
Yu Li, Lingchen Kong, Linxia Qin, Nai-Hua Xiu
Publication date: 9 January 2013
Published in: Computational \& Mathematical Methods in Medicine (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/646045
Applications of mathematical programming (90C90) Linear programming (90C05) Biochemistry, molecular biology (92C40)
Related Items (2)
The non-convex sparse problem with nonnegative constraint for signal reconstruction ⋮ The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
Uses Software
Cites Work
- Unnamed Item
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions
- A note on the complexity of \(L _{p }\) minimization
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- The restricted isometry property and its implications for compressed sensing
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- Decoding by Linear Programming
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
- Sparse Approximate Solutions to Linear Systems
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Compressed sensing
This page was built for publication: Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
