This paper considers the sparse generalized eigenvalue problem (SGEP), which aims to find the leading eigenvector with at most $k$ nonzero entries. SGEP naturally ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback