Optimal solutions for sparse principal component analysis
From MaRDI portal
Recommendations
Cited in
(69)- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time
- From simple structure to sparse components: a review
- A sparse rank-1 approximation algorithm for high-order tensors
- Certifiably optimal sparse principal component analysis
- Sparse PCA: convex relaxations, algorithms and applications
- Truncated power method for sparse eigenvalue problems
- Large covariance estimation by thresholding principal orthogonal complements. With discussion and authors' reply
- Subexponential-time algorithms for sparse PCA
- Understanding large text corpora via sparse machine learning
- scientific article; zbMATH DE number 7370563 (Why is no real title available?)
- NP-hardness and inapproximability of sparse PCA
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
- Sparse power factorization: balancing peakiness and sample complexity
- Regularity properties for sparse regression
- Using \(\ell_1\)-relaxation and integer programming to obtain dual bounds for sparse PCA
- On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach
- Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- A communication-efficient and privacy-aware distributed algorithm for sparse PCA
- Sparse PCA by iterative elimination algorithm
- Cardinality minimization, constraints, and regularization: a survey
- Optimal algorithms for binary, sparse, and L₁-norm principal component analysis
- Testing the nullspace property using semidefinite programming
- A general null space property for sparse principal component analysis
- An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- The sparse principal component analysis problem: optimality conditions and algorithms
- On stationarity conditions and constraint qualifications for multiobjective optimization problems with cardinality constraints
- Factor Modeling for High-Dimensional Functional Time Series
- Interpretable functional principal component analysis
- Feature selection for \(k\)-means clustering stability: theoretical analysis and an algorithm
- Sparse principal component analysis subject to prespecified cardinality of loadings
- Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method
- PCA Sparsified
- An exact approach to sparse principal component analysis
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis
- Recovering PCA and sparse PCA via hybrid-(_1,_2) sparse sampling of data elements
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis
- A decentralized proximal gradient tracking algorithm for composite optimization on Riemannian manifolds
- Sparse outlier-robust PCA for multi-source data
- Principal component analysis with weighted sparsity constraint
- Alternating direction method of multipliers for sparse principal component analysis
- Sparse eigenbasis approximation: multiple feature extraction across spatiotemporal scales with application to coherent set identification
- Approximation bounds for sparse principal component analysis
- A guide for sparse PCA: model comparison and applications
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
- Convex approximations to sparse PCA via Lagrangian duality
- The Sparse Principal Component of a Constant-Rank Matrix
- Linear dimensionality reduction methods for analyzing structured biomedical data: existing research and future opportunities
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Sparse non Gaussian component analysis by semidefinite programming
- Optimal detection of sparse principal components in high dimension
- Structured sparsity through convex optimization
- An augmented Lagrangian approach for sparse principal component analysis
- A majorization-minimization approach to the sparse generalized eigenvalue problem
- Robust sparse principal component analysis
- Bayesian variable selection for globally sparse probabilistic PCA
- scientific article; zbMATH DE number 6129459 (Why is no real title available?)
- Sparse principal component analysis via variable projection
- Principal Component Analysis by Optimization of Symmetric Functions has no Spurious Local Optima
- Sparse PCA on fixed-rank matrices
- Solving sparse principal component analysis with global support
- Sparsistency and agnostic inference in sparse PCA
- First-order algorithms for a class of fractional optimization problems
- Near-optimal stochastic approximation for online principal component estimation
- Stochastic proximal gradient method FOR _1 regularized optimization over a sphere
- Solving the k-sparse eigenvalue problem with reinforcement learning
- Improve robustness of sparse PCA by \(L_{1}\)-norm maximization
This page was built for publication: Optimal solutions for sparse principal component analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096150)
