Truncated power method for sparse eigenvalue problems
From MaRDI portal
Recommendations
- Generalized power method for sparse principal component analysis
- Sparse PCA: convex relaxations, algorithms and applications
- A subspace accelerated truncated Newton algorithm for solving the extreme eigenvalue of a large-scale sparse symmetric matrix
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Optimal solutions for sparse principal component analysis
Cited in
(41)- Eigenvectors from Eigenvalues Sparse Principal Component Analysis
- Certifiably optimal sparse principal component analysis
- A power method for computing the dominant eigenvalue of a dual quaternion Hermitian matrix
- Boosted sparse nonlinear distance metric learning
- scientific article; zbMATH DE number 7370563 (Why is no real title available?)
- Fast deflation sparse principal component analysis via subspace projections
- Using \(\ell_1\)-relaxation and integer programming to obtain dual bounds for sparse PCA
- An exponential inequality for U-statistics under mixing conditions
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Kurdyka-Łojasiewicz property of zero-norm composite functions
- A tight bound of hard thresholding
- An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
- Provable sample-efficient sparse phase retrieval initialized by truncated power method
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- Sparse principal component analysis with missing observations
- Sparse PCA: optimal rates and adaptive estimation
- Compressed vibration modes of elastic bodies
- Sparse Principal Component Analysis Based on Least Trimmed Squares
- scientific article; zbMATH DE number 6982922 (Why is no real title available?)
- Cutting plane generation through sparse principal component analysis
- Continuous and atlas-free analysis of brain structural connectivity
- Dimension Reduction Forests: Local Variable Importance Using Structured Random Forests
- An active-set algorithm for norm constrained quadratic problems
- A truncation algorithm for minimizing the Frobenius-Schatten norm to find a sparse matrix
- Sublinear column-wise actions of the matrix exponential on social networks
- Sparse equisigned PCA: algorithms and performance bounds in the noisy rank-1 setting
- Optimal Permutation Recovery in Permuted Monotone Matrix Model
- Sparse Manifold Subspace Learning
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis
- ECA: High-Dimensional Elliptical Component Analysis in Non-Gaussian Distributions
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis
- A guide for sparse PCA: model comparison and applications
- Sparse principal component analysis and iterative thresholding
- Scalable interpretable multi-response regression via SEED
- Partially Observed Dynamic Tensor Response Regression
- Slicing-free inverse regression in high-dimensional sufficient dimension reduction
- Estimation of low-rank matrices via approximate message passing
- Sparse PCA on fixed-rank matrices
- Solving sparse principal component analysis with global support
- Sparsistency and agnostic inference in sparse PCA
- Near-optimal stochastic approximation for online principal component estimation
This page was built for publication: Truncated power method for sparse eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405273)
