Pages that link to "Item:Q306306"
From MaRDI portal
The following pages link to The sparse principal component analysis problem: optimality conditions and algorithms (Q306306):
Displayed 10 items.
- A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes (Q2129204) (← links)
- A solution approach for cardinality minimization problem based on fractional programming (Q2168753) (← links)
- A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world (Q2170129) (← links)
- Certifiably optimal sparse principal component analysis (Q2293653) (← links)
- Optimization problems involving group sparsity terms (Q2330642) (← links)
- Proximal Mapping for Symmetric Penalty and Sparsity (Q4606656) (← links)
- (Q6155223) (← links)
- PCA Sparsified (Q6176425) (← links)
- A Path-Based Approach to Constrained Sparse Optimization (Q6202768) (← links)