Two proposals for robust PCA using semidefinite programming (Q1952221)

From MaRDI portal
Revision as of 11:45, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Two proposals for robust PCA using semidefinite programming
scientific article

    Statements

    title
    Two proposals for robust PCA using semidefinite programming (English)
    0 references
    DOI
    10.1214/11-EJS636
    0 references
    author
    Joel A. Tropp
    0 references
    Michael B. McCoy
    0 references
    publication date
    28 May 2013
    0 references
    Mathematics Subject Classification ID
    62H25
    0 references
    62G35
    0 references
    90C22
    0 references
    zbMATH DE Number
    6166852
    0 references
    zbMATH Keywords
    robustness
    0 references
    principal component analysis
    0 references
    semidefinite relaxation
    0 references
    leverage
    0 references
    duality
    0 references
    describes a project that uses
    SDPLR
    0 references
    robustbase
    0 references
    UCI-ml
    0 references
    CVX
    0 references
    CG_DESCENT
    0 references
    WaveLab
    0 references
    Wikidata QID
    Q56686579
    0 references
    arXiv ID
    1012.1086
    0 references
    cites work
    Q4849988
    0 references
    Q4144736
    0 references
    Q3239535
    0 references
    Algorithm 851
    0 references
    Robust Statistics
    0 references
    Robust Statistics
    0 references
    Q3995847
    0 references
    Robust Statistics
    0 references
    Q3103880
    0 references
    Q4482447
    0 references
    Q3715635
    0 references
    Convex Analysis
    0 references
    Q4779819
    0 references
    Q5600636
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1952221&oldid=35333759"
    Powered by MediaWiki