Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes (Q2129204): 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: W3089317050 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1212.4137 / 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: Improved Bounds on Restricted Isometry Constants for Gaussian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sparse principal component analysis problem: optimality conditions and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifiably optimal sparse principal component analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust principal component analysis? / 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: Q5251797 / 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: Sparsistency and agnostic inference in sparse PCA / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented Lagrangian approach for sparse principal component analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness and inapproximability of sparse PCA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improve robustness of sparse PCA by \(L_{1}\)-norm maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse principal component analysis by choice of norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse principal component analysis via regularized low rank matrix approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: From simple structure to sparse components: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected gradient approach to the numerical solution of the SCoTLASS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax sparse principal subspace estimation in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis / rank
 
Normal rank

Latest revision as of 17:55, 28 July 2024

scientific article
Language Label Description Also known as
English
Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
scientific article

    Statements

    Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes (English)
    0 references
    0 references
    0 references
    0 references
    22 April 2022
    0 references
    sparse PCA
    0 references
    alternating maximization
    0 references
    gpower
    0 references
    big data analytics
    0 references
    unsupervised learning
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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