Simple bounds for recovering low-complexity models (Q378116): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15B52 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60B20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C46 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6225211 / rank
 
Normal rank
Property / zbMATH Keywords
 
low-complexity models
Property / zbMATH Keywords: low-complexity models / rank
 
Normal rank
Property / zbMATH Keywords
 
\(\ell _{1}\)-norm minimization
Property / zbMATH Keywords: \(\ell _{1}\)-norm minimization / rank
 
Normal rank
Property / zbMATH Keywords
 
nuclear-norm minimization
Property / zbMATH Keywords: nuclear-norm minimization / rank
 
Normal rank
Property / zbMATH Keywords
 
block-sparsity
Property / zbMATH Keywords: block-sparsity / rank
 
Normal rank
Property / zbMATH Keywords
 
duality
Property / zbMATH Keywords: duality / rank
 
Normal rank
Property / zbMATH Keywords
 
random matrices
Property / zbMATH Keywords: random matrices / rank
 
Normal rank
Property / zbMATH Keywords
 
convex programming
Property / zbMATH Keywords: convex programming / rank
 
Normal rank

Revision as of 11:04, 29 June 2023

scientific article
Language Label Description Also known as
English
Simple bounds for recovering low-complexity models
scientific article

    Statements

    Simple bounds for recovering low-complexity models (English)
    0 references
    0 references
    0 references
    11 November 2013
    0 references
    low-complexity models
    0 references
    \(\ell _{1}\)-norm minimization
    0 references
    nuclear-norm minimization
    0 references
    block-sparsity
    0 references
    duality
    0 references
    random matrices
    0 references
    convex programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references