Pages that link to "Item:Q2361497"
From MaRDI portal
The following pages link to NP-hardness and inapproximability of sparse PCA (Q2361497):
Displaying 16 items.
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- Hierarchical compressed sensing (Q2106467) (← links)
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes (Q2129204) (← links)
- Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors (Q2162522) (← links)
- A note on the hardness of sparse approximation (Q2444766) (← links)
- Sparse PCA on fixed-rank matrices (Q2687042) (← links)
- Recovering PCA from Hybrid-$(\ell_1,\ell_2)$ Sparse Sampling of Data Elements (Q4636984) (← links)
- (Q5054600) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA (Q5095184) (← links)
- Jointly low-rank and bisparse recovery: Questions and partial answers (Q5220065) (← links)
- Solving sparse principal component analysis with global support (Q6038649) (← links)
- Robust sensing of low-rank matrices with non-orthogonal sparse decomposition (Q6051152) (← links)
- A communication-efficient and privacy-aware distributed algorithm for sparse PCA (Q6133304) (← links)
- Riemannian thresholding methods for row-sparse and low-rank matrix recovery (Q6157448) (← links)
- Beyond symmetry: best submatrix selection for the sparse truncated SVD (Q6634519) (← links)
