Penalized principal component analysis using smoothing

DOI10.1007/S11222-025-10610-0MaRDI QIDQ6979116zbMATH OpenFDO

Authors Rebecca Hurwitz, Georg Hahn

Publication date 26 May 2025

Published in Statistics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11222-025-10610-0

zbMATH Keywords

principal component analysissmoothingsingular value decompositioncovariance matrixeigenvectorNesterov1000 Genomes Projectgenomic relationship matrix

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Factor analysis and principal components; correspondence analysis (62H25) Applications of statistics to biology and medical sciences; meta analysis (62P10)

Cites work

• scientific article; zbMATH DE number 43206 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A Direct Formulation for Sparse PCA Using Semidefinite Programming
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A fast and efficient smoothing approach to Lasso regression and an application in statistical genetics: polygenic risk scores for chronic obstructive pulmonary disease (COPD)
• A majorization-minimization approach to the sparse generalized eigenvalue problem
• Invariant co-ordinate selection (with discussion)
• Multivariate Data Analysis on Matrix Manifolds
• Penalized Orthogonal Iteration for Sparse Estimation of Generalized Eigenvalue Problem
• Penalized classification using Fisher's linear discriminant
• Regularized generalized eigen-decomposition with applications to sparse supervised feature extraction and sparse discriminant analysis
• Smooth minimization of non-smooth functions
• Smoothing methods for convex inequalities and linear complementarity problems
• Sparse Generalized Eigenvalue Problem Via Smooth Optimization
• Sparse principal component analysis via regularized low rank matrix approximation
• Sparse quadratic classification rules via linear dimension reduction
• Sparse sufficient dimension reduction
• The approximation of one matrix by another of lower rank.
• Trace optimization and eigenproblems in dimension reduction methods.

This page was built for publication: Penalized principal component analysis using smoothing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979116)