Answers are grounded in this paper and cite their sources.
The following problem is considered: given a matrix A in Rm× n, (m rows and n columns), a vector b in Rᵐ, and ε > 0, compute a vector x satisfying \|Ax - b\|₂ ≤ ε if such exists, such that x has the fewest number of non-zero entries over all such vectors. It is shown that the problem is NP-hard, but that the well-known greedy heuristic is good in that it computes a solution with at most 18 Opt(ε/2)\| A⁺\|₂² ln (\| b \|₂/ε) non-zero entries, where Opt(ε/2) is the optimum number of nonzero entries at error ε/2, A is the matrix obtained by normalizing each column of A with respect to the L₂ norm, and A⁺ is its pseudo-inverse.
No takes yet. Share an insight, caveat, or question.
B. K. Natarajan (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: