The sparse principal component analysis problem: optimality conditions and algorithms
From MaRDI portal
Abstract: Sparse principal component analysis addresses the problem of finding a linear combination of the variables in a given data set with a sparse coefficients vector that maximizes the variability of the data. This model enhances the ability to interpret the principal components, and is applicable in a wide variety of fields including genetics and finance, just to name a few. We suggest a necessary coordinate-wise-based optimality condition, and show its superiority over the stationarity-based condition that is commonly used in the literature, and which is the basis for many of the algorithms designed to solve the problem. We devise algorithms that are based on the new optimality condition, and provide numerical experiments that support our assertion that algorithms, which are guaranteed to converge to stronger optimality conditions, perform better than algorithms that converge to points satisfying weaker optimality conditions.
Recommendations
- Optimal solutions for sparse principal component analysis
- An augmented Lagrangian approach for sparse principal component analysis
- Sparse PCA: convex relaxations, algorithms and applications
- Sparse principal component analysis via variable projection
- An exact approach to sparse principal component analysis
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- A majorization-minimization approach to the sparse generalized eigenvalue problem
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Convex Analysis
- Generalized power method for sparse principal component analysis
- Identifying small mean-reverting portfolios
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- Optimal solutions for sparse principal component analysis
- Principal component analysis.
- Regularization and Variable Selection Via the Elastic Net
- Sparse principal component analysis via regularized low rank matrix approximation
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
Cited in
(22)- scientific article; zbMATH DE number 6765491 (Why is no real title available?)
- Proximal mapping for symmetric penalty and sparsity
- Sparse PCA: optimal rates and adaptive estimation
- A Lagrange–Newton algorithm for tensor sparse principal component analysis
- Optimization problems involving group sparsity terms
- Robust sparse principal component analysis: situation of full sparseness
- A Path-Based Approach to Constrained Sparse Optimization
- Subspace Newton method for sparse group \(\ell_0\) optimization problem
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
- An augmented Lagrangian approach for sparse principal component analysis
- PCA Sparsified
- First- and second-order optimality conditions of nonsmooth sparsity multiobjective optimization via variational analysis
- scientific article; zbMATH DE number 6129459 (Why is no real title available?)
- High-dimensional analysis of semidefinite relaxations for sparse principal components
- Sparse principal component analysis via fractional function regularity
- The Sparse Principal Component of a Constant-Rank Matrix
- Principal Component Analysis by Optimization of Symmetric Functions has no Spurious Local Optima
- Certifiably optimal sparse principal component analysis
- The greedy simplex algorithm for double sparsity constrained optimization problems
- A solution approach for cardinality minimization problem based on fractional programming
- A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world
- A Lagrange-Newton algorithm for sparse nonlinear programming
This page was built for publication: The sparse principal component analysis problem: optimality conditions and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306306)
