The following pages link to (Q3096150):
Displaying 50 items.
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis (Q97537) (← links)
- Sparse Principal Component Analysis via Variable Projection (Q150980) (← links)
- Regularity properties for sparse regression (Q279682) (← links)
- The sparse principal component analysis problem: optimality conditions and algorithms (Q306306) (← links)
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
- Sparse principal component analysis subject to prespecified cardinality of loadings (Q333376) (← links)
- Sparse non Gaussian component analysis by semidefinite programming (Q374189) (← links)
- Optimal detection of sparse principal components in high dimension (Q385763) (← links)
- A majorization-minimization approach to the sparse generalized eigenvalue problem (Q413888) (← links)
- Sparse PCA by iterative elimination algorithm (Q429783) (← links)
- Alternating direction method of multipliers for sparse principal component analysis (Q457552) (← links)
- Feature selection for \(k\)-means clustering stability: theoretical analysis and an algorithm (Q468677) (← links)
- Approximation bounds for sparse principal component analysis (Q484129) (← links)
- Convex approximations to sparse PCA via Lagrangian duality (Q631218) (← links)
- Testing the nullspace property using semidefinite programming (Q633104) (← links)
- Improve robustness of sparse PCA by \(L_{1}\)-norm maximization (Q645882) (← links)
- Near-optimal stochastic approximation for online principal component estimation (Q681490) (← links)
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications (Q683737) (← links)
- An augmented Lagrangian approach for sparse principal component analysis (Q715084) (← links)
- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time (Q896557) (← links)
- Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition (Q1785395) (← links)
- Bayesian variable selection for globally sparse probabilistic PCA (Q1786585) (← links)
- Sparse power factorization: balancing peakiness and sample complexity (Q2000543) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- A guide for sparse PCA: model comparison and applications (Q2073736) (← links)
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes (Q2129204) (← links)
- A sparse rank-1 approximation algorithm for high-order tensors (Q2187088) (← links)
- Sparse eigenbasis approximation: multiple feature extraction across spatiotemporal scales with application to coherent set identification (Q2206552) (← links)
- On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach (Q2234331) (← links)
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method (Q2257078) (← links)
- From simple structure to sparse components: a review (Q2259727) (← links)
- Certifiably optimal sparse principal component analysis (Q2293653) (← links)
- Robust sparse principal component analysis (Q2335927) (← links)
- Sparsistency and agnostic inference in sparse PCA (Q2338928) (← links)
- NP-hardness and inapproximability of sparse PCA (Q2361497) (← links)
- Sparse PCA on fixed-rank matrices (Q2687042) (← links)
- Sparse PCA: Convex Relaxations, Algorithms and Applications (Q2802550) (← links)
- Interpretable functional principal component analysis (Q2827196) (← links)
- Recovering PCA from Hybrid-$(\ell_1,\ell_2)$ Sparse Sampling of Data Elements (Q4636984) (← links)
- Understanding large text corpora via sparse machine learning (Q4969899) (← links)
- (Q4998937) (← links)
- First-Order Algorithms for a Class of Fractional Optimization Problems (Q5026841) (← links)
- (Q5038021) (← links)
- (Q5054600) (← links)
- Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA (Q5095184) (← links)
- Large Covariance Estimation by Thresholding Principal Orthogonal Complements (Q5743151) (← links)
- An active-set proximal quasi-Newton algorithm for ℓ<sub>1</sub>-regularized minimization over a sphere constraint (Q5870141) (← links)
- Structured sparsity through convex optimization (Q5965303) (← links)
- Solving sparse principal component analysis with global support (Q6038649) (← links)
- A general null space property for sparse principal component analysis (Q6045576) (← links)
