Testing the nullspace property using semidefinite programming

This publication has 15 references indexed in Scilit:

• A Direct Formulation for Sparse PCA Using Semidefinite Programming
  SIAM Review, 2007
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
  IEEE Transactions on Information Theory, 2006
• Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace
  Foundations of Computational Mathematics, 2006
• Decoding by Linear Programming
  IEEE Transactions on Information Theory, 2005
• Sparse nonnegative solution of underdetermined linear equations by linear programming
  Proceedings of the National Academy of Sciences, 2005
• Smooth minimization of non-smooth functions
  Mathematical Programming, 2004
• Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
  SIAM Review, 2003
• Uncertainty principles and ideal atomic decomposition
  IEEE Transactions on Information Theory, 2001
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
  Journal of the ACM, 1995
• Random projections of regular simplices
  Discrete & Computational Geometry, 1992