Pages that link to "Item:Q715084"

The following pages link to An augmented Lagrangian approach for sparse principal component analysis (Q715084):

Displaying 31 items.

• A feasible method for optimization with orthogonality constraints (Q101635) (← links)
• Optimal detection of sparse principal components in high dimension (Q385763) (← links)
• Robust least square semidefinite programming with applications (Q457207) (← links)
• Alternating direction method of multipliers for sparse principal component analysis (Q457552) (← links)
• Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
• Improve robustness of sparse PCA by \(L_{1}\)-norm maximization (Q645882) (← links)
• An augmented Lagrangian approach for sparse principal component analysis (Q715084) (← links)
• Finding Dantzig selectors with a proximity operator based fixed-point algorithm (Q1663200) (← links)
• Nonmonotone gradient methods for vector optimization with a portfolio optimization application (Q1694908) (← links)
• Global convergence of ADMM in nonconvex nonsmooth optimization (Q1736880) (← links)
• An alternating direction method for finding Dantzig selectors (Q1927184) (← links)
• Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization (Q2035513) (← links)
• An approximate augmented Lagrangian method for nonnegative low-rank matrix approximation (Q2051047) (← links)
• Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes (Q2129204) (← links)
• From simple structure to sparse components: a review (Q2259727) (← links)
• An augmented Lagrangian proximal alternating method for sparse discrete optimization problems (Q2299205) (← links)
• Robust sparse principal component analysis (Q2335927) (← links)
• Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742) (← links)
• Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method (Q2399164) (← links)
• L1-norm-based principal component analysis with adaptive regularization (Q2417836) (← links)
• Projection onto a Polyhedron that Exploits Sparsity (Q2817841) (← links)
• An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming (Q2957850) (← links)
• An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints (Q3186107) (← links)
• Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms (Q5219700) (← links)
• Penalty and Augmented Lagrangian Methods for Constrained DC Programming (Q5868956) (← links)
• Doubly iteratively reweighted algorithm for constrained compressed sensing models (Q6097766) (← links)
• A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds (Q6110426) (← links)
• A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)
• Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems (Q6157998) (← links)
• Gradient Flows for Probabilistic Frame Potentials in the Wasserstein Space (Q6172769) (← links)
• PCA Sparsified (Q6176425) (← links)