Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742)

From MaRDI portal
Revision as of 11:01, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Do semidefinite relaxations solve sparse PCA up to the information limit?
scientific article

    Statements

    Do semidefinite relaxations solve sparse PCA up to the information limit? (English)
    0 references
    0 references
    0 references
    0 references
    6 July 2015
    0 references
    principal component analysis
    0 references
    spectral analysis
    0 references
    spiked covariance ensembles
    0 references
    sparsity
    0 references
    high-dimensional statistics
    0 references
    convex relaxation
    0 references
    semidefinite programming
    0 references
    Wishart ensembles
    0 references
    random matrices
    0 references
    integrality gap
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers