CVX Forum: a community-driven support forum
Latest Categories Search
Home / Uncategorized / Basis pursuit

Basis pursuit

Uncategorized
Nov 9, 2012
A
anasif
Nov 9, 2012 #1

Hi,
Can cvx solve for x where the optimization problem is:
min ||x||_1, s.t. b=Ax, where x has size N and is M-sparse
(M<N), and A has size M-by-N?

Thanks,
Nasif

M
Michael C. Grant
Nov 9, 2012 #2

Yes, it can.

Archive of CVX Forum: a community-driven support forum — Generated as a static archive