A direct formulation for sparse PCA using semidefinite programming

Alexandre d'Aspremont, Laurent El Ghaoui, Michael I. Jordan +1

We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its…