Pages that link to "Item:Q2896039"

The following pages link to Generalized power method for sparse principal component analysis (Q2896039):

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)
• 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)
• 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)
• The restricted isometry property for random block diagonal matrices (Q466970) (← links)
• Approximation bounds for sparse principal component analysis (Q484129) (← 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)
• A framework of constraint preserving update schemes for optimization on Stiefel manifold (Q747775) (← links)
• Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios (Q1635895) (← links)
• Principal minimax support vector machine for sufficient dimension reduction with contaminated data (Q1660132) (← links)
• Regularized generalized canonical correlation analysis: a framework for sequential multiblock component methods (Q1682445) (← links)
• Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function (Q1758023) (← links)
• Bayesian variable selection for globally sparse probabilistic PCA (Q1786585) (← links)
• Monotonically convergent algorithms for symmetric tensor approximation (Q1931773) (← links)
• On conjugate families and Jeffreys priors for von Mises-Fisher distributions (Q1937212) (← links)
• Sparse total least squares: analysis and greedy algorithms (Q1938584) (← links)
• Projected nonmonotone search methods for optimization with orthogonality constraints (Q1993600) (← links)
• Sparse power factorization: balancing peakiness and sample complexity (Q2000543) (← links)
• Kurdyka-Łojasiewicz property of zero-norm composite functions (Q2026719) (← links)
• A guide for sparse PCA: model comparison and applications (Q2073736) (← links)
• Global convergence of Riemannian line search methods with a Zhang-Hager-type condition (Q2084256) (← links)
• Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes (Q2129204) (← links)
• An active-set algorithm for norm constrained quadratic problems (Q2133422) (← links)
• On the rotational invariant \(L_1\)-norm PCA (Q2174418) (← links)
• An \(\ell_1\)-penalized adaptive normalized quasi-Newton algorithm for sparsity-aware generalized eigen-subspace tracking (Q2181395) (← links)
• Sparse eigenbasis approximation: multiple feature extraction across spatiotemporal scales with application to coherent set identification (Q2206552) (← 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)
• Projection sparse principal component analysis: an efficient least squares method (Q2274951) (← links)
• Certifiably optimal sparse principal component analysis (Q2293653) (← links)
• Sparse principal component analysis with missing observations (Q2318671) (← links)
• On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
• Semi-sparse PCA (Q2331152) (← links)
• Robust sparse principal component analysis (Q2335927) (← links)
• Sparsistency and agnostic inference in sparse PCA (Q2338928) (← links)
• Sparse exponential family principal component analysis (Q2417828) (← links)
• Minimax sparse principal subspace estimation in high dimensions (Q2443207) (← links)
• Sparse PCA: optimal rates and adaptive estimation (Q2443213) (← links)
• Estimation of low-rank matrices via approximate message passing (Q2656598) (← links)
• Nonmonotone inexact restoration approach for minimization with orthogonality constraints (Q2661684) (← links)
• Implicit steepest descent algorithm for optimization with orthogonality constraints (Q2673531) (← links)
• Sparse PCA on fixed-rank matrices (Q2687042) (← links)
• Robust sparse principal component analysis: situation of full sparseness (Q2688809) (← links)
• Riemannian Preconditioning (Q2792408) (← links)