Testing the Nullspace Property using Semidefinite Programming

Recent results in compressed sensing show that, under certain conditions, the sparsest so-lution to an underdetermined set of linear equations can be recovered by solving a linear pro-gram. These results either rely on computing sparse eigenvalues of the design matrix or on properties of its nullspace. So far, no tractable algorithm is known to test these conditions and most current results rely on asymptotic properties of random matrices. Given a matrix A, we use semidefinite relaxation techniques to test the nullspace property on A and show on some numerical examples that these relaxation bounds can prove perfect recovery of sparse solutions with relatively high cardinality