Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays (Q1929588): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximate Solutions to Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of \(L _{p }\) minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse nonnegative solution of underdetermined linear equations by linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the faces of randomly-projected hypercubes and orthants, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Recovery of Nonnegative Signals With Minimal Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty principles and ideal atomic decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The restricted isometry property and its implications for compressed sensing / rank
 
Normal rank

Latest revision as of 02:26, 6 July 2024

scientific article
Language Label Description Also known as
English
Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
scientific article

    Statements

    Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2013
    0 references
    Summary: Compressive sensing microarrays (CSM) are DNA-based sensors that operate using group testing and compressive sensing principles. Mathematically, one can cast the CSM as sparse nonnegative recovery (SNR) which is to find the sparsest solutions subjected to an underdetermined system of linear equations and nonnegative restrictions. In this paper, we discuss the \(l_1\) relaxation of the SNR. By defining nonnegative restricted isometry/orthogonality constants, we give a nonnegative restricted property condition which guarantees that the SNR and the \(l_1\) relaxation share the common unique solution. Besides, we show that any solution to the SNR must be one of the extreme points of the underlying feasible set.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references