Finding the Largest Low-Rank Clusters With Ky Fan $2$-$k$-Norm and $\ell_1$-Norm
DOI10.1137/140962097zbMath1332.15032arXiv1403.5901OpenAlexW1497701622MaRDI QIDQ5743612
Xuan Vinh Doan, Stephen A. Vavasis
Publication date: 5 February 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.5901
convex optimizationnonnegative matrix factorizationbiclusteringKy Fan normlow rank matrix approximationsub-Gaussian random noise
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Factorization of matrices (15A23) Convex programming (90C25) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Positive matrices and their generalizations; cones of matrices (15B48) Random matrices (algebraic aspects) (15B52)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Guaranteed clustering and biclustering via semidefinite programming
- On matrix approximation problems with Ky Fan \(k\) norms
- Low rank multivariate regression
- Properties of linear approximations of matrices in the spectral norm
- A Proximal Point Algorithm for Sequential Feature Extraction Applications
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Finding Approximately Rank-One Submatrices with the Nuclear Norm and $\ell_1$-Norm
- Computational neuroscience
This page was built for publication: Finding the Largest Low-Rank Clusters With Ky Fan $2$-$k$-Norm and $\ell_1$-Norm