Principal components: a descent algorithm
From MaRDI portal
Publication:349019
DOI10.1016/J.JCP.2014.02.033zbMATH Open1349.62252OpenAlexW2065955928MaRDI QIDQ349019FDOQ349019
Rebeca Salas-Boni, Esteban G. Tabak
Publication date: 5 December 2016
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2014.02.033
Recommendations
- Gradient algorithms for principal component analysis
- Principal component analysis: a review and recent developments
- Non-linear generalization of principal component analysis: from a global to a local approach
- Limited memory block Krylov subspace optimization for computing dominant singular value decompositions
- Convergence of algorithms used for principal component analysis
Factor analysis and principal components; correspondence analysis (62H25) Applications of mathematical programming (90C90)
Cites Work
- The Geometry of Algorithms with Orthogonality Constraints
- Title not available (Why is that?)
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Title not available (Why is that?)
- Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
- A Randomized Algorithm for Principal Component Analysis
- Principal Dynamical Components
- Optimization algorithms exploiting unitary constraints
Cited In (4)
This page was built for publication: Principal components: a descent algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q349019)