Pages that link to "Item:Q2293653"
From MaRDI portal
The following pages link to Certifiably optimal sparse principal component analysis (Q2293653):
Displaying 19 items.
- Optimal-SPCA (Q43532) (← links)
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes (Q2129204) (← links)
- On polyhedral and second-order cone decompositions of semidefinite optimization problems (Q2294533) (← links)
- Sparsistency and agnostic inference in sparse PCA (Q2338928) (← links)
- Rate-optimal posterior contraction for sparse PCA (Q2343963) (← links)
- Sparse PCA: optimal rates and adaptive estimation (Q2443213) (← links)
- Sparse PCA on fixed-rank matrices (Q2687042) (← links)
- A strong sequential optimality condition for cardinality-constrained optimization problems (Q2700003) (← links)
- (Q5011563) (← links)
- (Q5054600) (← links)
- Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA (Q5095184) (← links)
- Principal Component Analysis by Optimization of Symmetric Functions has no Spurious Local Optima (Q5215520) (← links)
- Solving sparse principal component analysis with global support (Q6038649) (← links)
- Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint (Q6106165) (← links)
- A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems (Q6106955) (← links)
- PCA Sparsified (Q6176425) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
- Sequential M-stationarity conditions for general optimization problems (Q6595555) (← links)
- Beyond symmetry: best submatrix selection for the sparse truncated SVD (Q6634519) (← links)
