A Randomized Rounding Algorithm for Sparse PCA

Kimon Fountoulakis, Abhisek Kundu, Eugenia-Maria Kontopoulou +1

We present and analyze a simple, two-step algorithm to approximate the optimal solution of the sparse PCA problem. Our approach first solves a L1 penalized version of the NP-hard s…