Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications

Abstract

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

Publication
In Preparation for IEEE Signal Processing Magazine (Invited Paper for Special Issue on Nonconvex Optimization)