scientific article
From MaRDI portal
Publication:3096150
zbMath1225.68170MaRDI QIDQ3096150
No author found.
Publication date: 8 November 2011
Full work available at URL: http://www.jmlr.org/papers/v9/aspremont08a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Factor analysis and principal components; correspondence analysis (62H25) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (53)
NP-hardness and inapproximability of sparse PCA ⋮ Regularity properties for sparse regression ⋮ Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes ⋮ The sparse principal component analysis problem: optimality conditions and algorithms ⋮ Projection algorithms for nonconvex minimization with application to sparse principal component analysis ⋮ Sparse principal component analysis subject to prespecified cardinality of loadings ⋮ Sparse non Gaussian component analysis by semidefinite programming ⋮ Optimal detection of sparse principal components in high dimension ⋮ Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA ⋮ Solving sparse principal component analysis with global support ⋮ A sparse rank-1 approximation algorithm for high-order tensors ⋮ A general null space property for sparse principal component analysis ⋮ Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint ⋮ Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time ⋮ Unnamed Item ⋮ A majorization-minimization approach to the sparse generalized eigenvalue problem ⋮ A communication-efficient and privacy-aware distributed algorithm for sparse PCA ⋮ Sparse PCA on fixed-rank matrices ⋮ PCA Sparsified ⋮ Convex approximations to sparse PCA via Lagrangian duality ⋮ Testing the nullspace property using semidefinite programming ⋮ Sparse PCA by iterative elimination algorithm ⋮ 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 ⋮ Alternating direction method of multipliers for sparse principal component analysis ⋮ Feature selection for \(k\)-means clustering stability: theoretical analysis and an algorithm ⋮ Approximation bounds for sparse principal component analysis ⋮ Unnamed Item ⋮ On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach ⋮ Unnamed Item ⋮ Near-optimal stochastic approximation for online principal component estimation ⋮ Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications ⋮ Sparse power factorization: balancing peakiness and sample complexity ⋮ Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method ⋮ From simple structure to sparse components: a review ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ Large Covariance Estimation by Thresholding Principal Orthogonal Complements ⋮ Alternating direction method of multipliers for penalized zero-variance discriminant analysis ⋮ An augmented Lagrangian approach for sparse principal component analysis ⋮ Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition ⋮ Bayesian variable selection for globally sparse probabilistic PCA ⋮ Sparse Principal Component Analysis via Variable Projection ⋮ Structured sparsity through convex optimization ⋮ Sparse PCA: Convex Relaxations, Algorithms and Applications ⋮ Certifiably optimal sparse principal component analysis ⋮ Understanding large text corpora via sparse machine learning ⋮ Interpretable functional principal component analysis ⋮ Recovering PCA from Hybrid-$(\ell_1,\ell_2)$ Sparse Sampling of Data Elements ⋮ A guide for sparse PCA: model comparison and applications ⋮ Robust sparse principal component analysis ⋮ Sparsistency and agnostic inference in sparse PCA ⋮ An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint ⋮ First-Order Algorithms for a Class of Fractional Optimization Problems
Uses Software
This page was built for publication:
