Minimum subspace approximation property for sparse approximations in finite dimension

Abstract

We find necessary and sufficient conditions that a class of subspaces C must satisfy so that a solution exits to the problem of finding the subspace V ∈ C that best approximate a set of data F ∈ ℝ^d.