In the previous chapter, we saw many problems for which the goal is to find a sparse solution to an underdetermined linear system of equations y = Ax. This problem is NP-hard in general. However, we also observed that certain well-structured instances can be solved efficiently: in experiments, when y = Axo and xo was sufficiently sparse, tractable ℓ1 minimization
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.