Error bounds for compressed sensing algorithms with group sparsity: A unified approach (Q2399645): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The restricted isometry property and its implications for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical introduction to compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing and best 𝑘-term approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-ideal model selection by \(\ell _{1}\) minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Selection and Estimation in Regression with Grouped Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The benefit of group sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteratively reweighted least squares minimization for sparse recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the restricted isometry property for random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning and generalisation. With applications to neural networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic constructions of compressed sensing matrices / rank
 
Normal rank

Latest revision as of 07:03, 14 July 2024

scientific article
Language Label Description Also known as
English
Error bounds for compressed sensing algorithms with group sparsity: A unified approach
scientific article

    Statements

    Error bounds for compressed sensing algorithms with group sparsity: A unified approach (English)
    0 references
    0 references
    24 August 2017
    0 references
    compressed sensing
    0 references
    group sparsity
    0 references
    group restricted isometry property
    0 references
    error bounds
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references