The Sparse Principal Component of a Constant-Rank Matrix

The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem
${\cal NP}$
-hard. In this paper, we prove that, if the matrix is positive semidefinite and its rank is constant, then its sparse principal component is polynomially computable. Our proof utilizes the auxiliary unit vector technique that has been recently developed to identify problems that are polynomially solvable. In addition, we use this technique to design an algorithm which, for any sparsity value, computes the sparse principal component with complexity
${\cal O}(N^{D+1})$
, where
$N$
and
$D$
are the matrix size and rank, respectively. Our algorithm is fully parallelizable and memory efficient.