Convex approximations to sparse PCA via Lagrangian duality (Q631218): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3079664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096150 / 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: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing technique and its applications in semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semidefinite bounds for maximization of a non-convex quadratic objective over the<i>l<sub>1</sub></i>unit ball / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Approximations with Sparse Factors I: Basic Algorithms and Error Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Approximations with Sparse Factors II: Penalized Methods with Discrete Newton-Like Iterations / rank
 
Normal rank

Latest revision as of 21:16, 3 July 2024

scientific article
Language Label Description Also known as
English
Convex approximations to sparse PCA via Lagrangian duality
scientific article

    Statements

    Identifiers