Pages that link to "Item:Q413888"

The following pages link to A majorization-minimization approach to the sparse generalized eigenvalue problem (Q413888):

Displaying 15 items.

• 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)
• A majorization-minimization approach to the sparse generalized eigenvalue problem (Q413888) (← links)
• Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach (Q742312) (← links)
• Pruning of error correcting output codes by optimization of accuracy-diversity trade off (Q890296) (← links)
• New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299) (← links)
• Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach (Q1616936) (← links)
• Structured variable selection via prior-induced hierarchical penalty functions (Q1659467) (← links)
• An \(\ell_1\)-penalized adaptive normalized quasi-Newton algorithm for sparsity-aware generalized eigen-subspace tracking (Q2181395) (← links)
• From simple structure to sparse components: a review (Q2259727) (← links)
• A harmonic FEAST algorithm for non-Hermitian generalized eigenvalue problems (Q2321349) (← links)
• Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method (Q2399164) (← links)
• On the non-Hermitian FEAST algorithms with oblique projection for eigenvalue problems (Q2423589) (← links)
• Penalized Orthogonal Iteration for Sparse Estimation of Generalized Eigenvalue Problem (Q3391278) (← links)
• Eigenvectors from Eigenvalues Sparse Principal Component Analysis (Q5084448) (← links)