A Direct Formulation for Sparse PCA Using Semidefinite Programming
From MaRDI portal
Publication:5757478
DOI10.1137/050645506zbMath1128.90050arXivcs/0406021OpenAlexW2615253071WikidataQ59409959 ScholiaQ59409959MaRDI QIDQ5757478
No author found.
Publication date: 7 September 2007
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0406021
semidefinite programmingprincipal component analysisfactor analysisMoreau-Yosida regularizationKarhunen-Loève transformsemidefinite relaxation
Factor analysis and principal components; correspondence analysis (62H25) Semidefinite programming (90C22) Combinatorial optimization (90C27)
Related Items (only showing first 100 items - show all)
Sparse local influence analysis ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ Unnamed Item ⋮ Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA ⋮ A general null space property for sparse principal component analysis ⋮ Hierarchical disjoint principal component analysis ⋮ A novel regularization-based optimization approach to sparse mean-reverting portfolios selection ⋮ Performance enhancements for a generic conic interior point algorithm ⋮ Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint ⋮ Fast deflation sparse principal component analysis via subspace projections ⋮ A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming ⋮ Practical approximation algorithms for \(\ell_1\)-regularized sparse rank-1 approximation to higher-order tensors ⋮ A communication-efficient and privacy-aware distributed algorithm for sparse PCA ⋮ Dynamic Principal Component Analysis in High Dimensions ⋮ PCA Sparsified ⋮ The regularization continuation method for optimization problems with nonlinear equality constraints ⋮ A clustering approach to interpretable principal components ⋮ DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization ⋮ A non-monotone linear search algorithm with mixed direction on Stiefel manifold ⋮ Unnamed Item ⋮ 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 ⋮ Compressed modes for variational problems in mathematics and physics ⋮ A Sparse Decomposition of Low Rank Symmetric Positive Semidefinite Matrices ⋮ Exploring the Locally Low Dimensional Structure in Solving Random Elliptic PDEs ⋮ Sparse Principal Component Analysis in Hilbert Space ⋮ Eigenvectors from Eigenvalues Sparse Principal Component Analysis ⋮ Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning ⋮ Proximal Distance Algorithms: Theory and Examples ⋮ ECA: High-Dimensional Elliptical Component Analysis in Non-Gaussian Distributions ⋮ Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants ⋮ The analysis of multivariate data using semi-definite programming ⋮ Exactly Uncorrelated Sparse Principal Component Analysis ⋮ Estimating structured high-dimensional covariance and precision matrices: optimal rates and adaptive estimation ⋮ An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem ⋮ Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold ⋮ Scale-Invariant Sparse PCA on High-Dimensional Meta-Elliptical Data ⋮ Principal Component Analysis of High-Frequency Data ⋮ Recovering PCA from Hybrid-$(\ell_1,\ell_2)$ Sparse Sampling of Data Elements ⋮ Subsampling Algorithms for Semidefinite Programming ⋮ Binary Component Decomposition Part I: The Positive-Semidefinite Case ⋮ Sparse Partial Least Squares Regression for Simultaneous Dimension Reduction and Variable Selection ⋮ Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property ⋮ Smart Alpha: active management with unstable and latent factors ⋮ Discussion of: Treelets -- an adaptive multi-scale basis for sparse unordered data ⋮ An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint ⋮ Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis ⋮ Identifiability of Complete Dictionary Learning ⋮ Optimality conditions for sparse nonlinear programming ⋮ NP-hardness and inapproximability of sparse PCA ⋮ High-resolution signal recovery via generalized sampling and functional principal component analysis ⋮ Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes ⋮ High-dimensional analysis of semidefinite relaxations for sparse principal components ⋮ Identifying small mean-reverting portfolios ⋮ A literature review of (Sparse) exponential family PCA ⋮ Sublinear time algorithms for approximate semidefinite programming ⋮ The sparse principal component analysis problem: optimality conditions and algorithms ⋮ Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios ⋮ Inverse problems from biomedicine: inference of putative disease mechanisms and robust therapeutic strategies ⋮ \(rs\)-sparse principal component analysis: a mixed integer nonlinear programming approach with VNS ⋮ Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors ⋮ Sparse principal component analysis and iterative thresholding ⋮ Alternating proximal gradient method for convex minimization ⋮ Sparse principal component regression for generalized linear models ⋮ A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world ⋮ 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 ⋮ Sparse subspace linear discriminant analysis ⋮ Optimal detection of sparse principal components in high dimension ⋮ Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming ⋮ Sparse exponential family principal component analysis ⋮ Disjoint factor analysis with cross-loadings ⋮ Learning a factor model via regularized PCA ⋮ Sharp detection boundaries on testing dense subhypergraph ⋮ Principal component analysis: a review and recent developments ⋮ Manifold elastic net: a unified framework for sparse dimension reduction ⋮ Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time ⋮ A majorization-minimization approach to the sparse generalized eigenvalue problem ⋮ Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization ⋮ Sparse canonical correlation analysis ⋮ Sparse tangent portfolio selection via semi-definite relaxation ⋮ Mean estimation with sub-Gaussian rates in polynomial time ⋮ Sparse PCA on fixed-rank matrices ⋮ Robust sparse principal component analysis: situation of full sparseness ⋮ Convex approximations to sparse PCA via Lagrangian duality ⋮ A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints ⋮ Testing the nullspace property using semidefinite programming ⋮ Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements ⋮ High Dimensional Change Point Estimation via Sparse Projection ⋮ Sparse PCA by iterative elimination algorithm ⋮ An exact approach to sparse principal component analysis ⋮ A fresh variational-analysis look at the positive semidefinite matrices world ⋮ Sparse eigenbasis approximation: multiple feature extraction across spatiotemporal scales with application to coherent set identification ⋮ Improve robustness of sparse PCA by \(L_{1}\)-norm maximization ⋮ Minimax sparse principal subspace estimation in high dimensions ⋮ Sparse PCA: optimal rates and adaptive estimation ⋮ Alternating direction method of multipliers for sparse principal component analysis
Uses Software
This page was built for publication: A Direct Formulation for Sparse PCA Using Semidefinite Programming
