The paper reviews recent work on nonconvex optimization methods for finding the sparsest vectors in linear subspaces.