Sciweavers

NIPS
2004
14 years 25 days ago
A Direct Formulation for Sparse PCA Using Semidefinite Programming
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...
Alexandre d'Aspremont, Laurent El Ghaoui, Michael ...