Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Newton Methods for Optimization Problems with Simple Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting high log-densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Active Set Algorithm for Box Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / 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: Q3096150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least angle regression. (With discussion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonmonotone Line Search Technique for Newton’s Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probing the Pareto Frontier for Basis Pursuit Solutions / 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: On Finding Dense Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex approximations to sparse PCA via Lagrangian duality / 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: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A majorization-minimization approach to the sparse generalized eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Reconstruction by Separable Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405273 / rank
 
Normal rank

Revision as of 13:44, 12 July 2024

scientific article
Language Label Description Also known as
English
Projection algorithms for nonconvex minimization with application to sparse principal component analysis
scientific article

    Statements

    Projection algorithms for nonconvex minimization with application to sparse principal component analysis (English)
    0 references
    0 references
    0 references
    0 references
    15 September 2016
    0 references
    sparse principal component analysis
    0 references
    gradient projection
    0 references
    nonconvex minimization
    0 references
    approximate Newton
    0 references
    Barzilai-Borwein method
    0 references
    0 references
    0 references
    0 references

    Identifiers