A Direct Formulation for Sparse PCA Using Semidefinite Programming
From MaRDI portal
Abstract: We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its eigenvector. The problem arises in the decomposition of a covariance matrix into sparse factors, and has wide applications ranging from biology to finance. We use a modification of the classical variational representation of the largest eigenvalue of a symmetric matrix, where cardinality is constrained, and derive a semidefinite programming based relaxation for our problem. We also discuss Nesterov's smooth minimization technique applied to the SDP arising in the direct sparse PCA method.
Recommendations
- Sparse PCA: convex relaxations, algorithms and applications
- Optimal solutions for sparse principal component analysis
- Sparse PCA on fixed-rank matrices
- High-dimensional analysis of semidefinite relaxations for sparse principal components
- Do semidefinite relaxations solve sparse PCA up to the information limit?
Cited in
(only showing first 100 items - show all)- Covariance regularization by thresholding
- A feasible method for optimization with orthogonality constraints
- Image compression by sparse PCA coding in curvelet domain
- Integrative sparse principal component analysis
- Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios
- Sparse principal component regression for generalized linear models
- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
- Sparse tangent portfolio selection via semi-definite relaxation
- The spectral norm of random inner-product kernel matrices
- On semidefinite relaxations for the block model
- Projected nonmonotone search methods for optimization with orthogonality constraints
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Using SeDuMi to find various optimal designs for regression models
- Principal component analysis: a generalized Gini approach
- Sparse principal component regression via singular value decomposition approach
- An empirical comparison of two approaches for CDPCA in high-dimensional data
- An alternate gradient method for optimization problems with orthogonality constraints
- Efficient semidefinite programming with approximate ADMM
- A guide for sparse PCA: model comparison and applications
- New bounds for subset selection from conic relaxations
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
- A literature review of (Sparse) exponential family PCA
- Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
- A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world
- Mean estimation with sub-Gaussian rates in polynomial time
- Sparse eigenbasis approximation: multiple feature extraction across spatiotemporal scales with application to coherent set identification
- Foreword to the special focus on mathematics, data and knowledge
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method
- From simple structure to sparse components: a review
- Low-rank matrix approximation in the infinity norm
- Sparse equisigned PCA: algorithms and performance bounds in the noisy rank-1 setting
- Certifiably optimal sparse principal component analysis
- Asymptotic behaviors of semidefinite programming with a covariance perturbation
- On cutting planes for cardinality-constrained linear programs
- Robust sparse principal component analysis
- Sparsistency and agnostic inference in sparse PCA
- Rate-optimal posterior contraction for sparse PCA
- Detecting positive correlations in a multivariate sample
- Do semidefinite relaxations solve sparse PCA up to the information limit?
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic
- Optimality conditions for sparse nonlinear programming
- NP-hardness and inapproximability of sparse PCA
- Inverse problems from biomedicine: inference of putative disease mechanisms and robust therapeutic strategies
- Alternating proximal gradient method for convex minimization
- Sparse exponential family principal component analysis
- Disjoint factor analysis with cross-loadings
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Minimax sparse principal subspace estimation in high dimensions
- Sparse PCA: optimal rates and adaptive estimation
- Random matrix theory in statistics: a review
- Community detection in dense random networks
- Sharp detection boundaries on testing dense subhypergraph
- Sparse PCA on fixed-rank matrices
- Robust sparse principal component analysis: situation of full sparseness
- Sparse PCA: convex relaxations, algorithms and applications
- Least squares sparse principal component analysis: a backward elimination approach to attain large loadings
- Low-rank approximation and completion of positive tensors
- Principal component analysis: a review and recent developments
- Sublinear time algorithms for approximate semidefinite programming
- The sparse principal component analysis problem: optimality conditions and algorithms
- Optimal solutions for sparse principal component analysis
- Concave programming for finding sparse solutions to problems with convex constraints
- Identifying small mean-reverting portfolios
- rs-sparse principal component analysis: a mixed integer nonlinear programming approach with VNS
- Sparse principal component analysis and iterative thresholding
- Principal component analysis with weighted sparsity constraint
- Minimax bounds for sparse PCA with noisy high-dimensional data
- Massively parallel feature selection: an approach based on variance preservation
- Sparse non Gaussian component analysis by semidefinite programming
- Clustering and feature selection using sparse principal component analysis
- Optimal detection of sparse principal components in high dimension
- Learning a factor model via regularized PCA
- Manifold elastic net: a unified framework for sparse dimension reduction
- A majorization-minimization approach to the sparse generalized eigenvalue problem
- Sparse canonical correlation analysis
- Sparse PCA by iterative elimination algorithm
- A fresh variational-analysis look at the positive semidefinite matrices world
- Sparse Variable PCA Using Geodesic Steepest Descent
- Alternating direction method of multipliers for sparse principal component analysis
- Sparse subspace linear discriminant analysis
- Biobjective sparse principal component analysis
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements
- High dimensional change point estimation via sparse projection
- A non-monotone linear search algorithm with mixed direction on Stiefel manifold
- Sparse partial least squares regression for simultaneous dimension reduction and variable selection
- Recovering PCA and sparse PCA via hybrid-(_1,_2) sparse sampling of data elements
- A survey of high dimension low sample size asymptotics
- Accelerated method for optimization over density matrices in quantum state estimation
- An adaptive fast solver for a general class of positive definite matrices via energy decomposition
- Wasserstein dictionary learning: optimal transport-based unsupervised nonlinear dictionary learning
- ECA: High-Dimensional Elliptical Component Analysis in Non-Gaussian Distributions
- Approximation bounds for sparse principal component analysis
- Comment on ``Hypothesis testing by convex optimization
- scientific article; zbMATH DE number 7255152 (Why is no real title available?)
- Scale-invariant sparse PCA on high-dimensional meta-elliptical data
- Binary component decomposition. I: The positive-semidefinite case
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- Smart Alpha: active management with unstable and latent factors
- Identifiability of complete dictionary learning
This page was built for publication: A Direct Formulation for Sparse PCA Using Semidefinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757478)
