Approximation bounds for sparse principal component analysis (Q484129): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153671921 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1205.0121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-dimensional analysis of semidefinite relaxations for sparse principal components / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Euclidean restricted memory level method for large-scale convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fluctuations of the extreme eigenvalues of finite rank deformations of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal detection of sparse principal components in high dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Direct Formulation for Sparse PCA Using Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Optimization on the Cone of Positive Semidefinite Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized power method for sparse principal component analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information, Physics, and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4237477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean Field Models for Spin Glasses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outward rotations / rank
 
Normal rank

Latest revision as of 11:56, 9 July 2024

scientific article
Language Label Description Also known as
English
Approximation bounds for sparse principal component analysis
scientific article

    Statements

    Approximation bounds for sparse principal component analysis (English)
    0 references
    0 references
    0 references
    18 December 2014
    0 references

    Identifiers

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