
In this paper, we have proved that in every underdetermined linear system $Ax=b$ , there corresponds a constant $p^{*}(A,b)>0$ such that every solution to the $l_{p}$ -norm minimization problem also solves the $l_{0}$ -norm minimization problem whenever $0 . This phenomenon is named $NP/CMP$ equivalence.
sparse recovery, bmjgoldcheck, l p minimization, underdetermined linear system, NotOAChecked, 004, 510, Information processing, I200 - Information systems, sparse representation
sparse recovery, bmjgoldcheck, l p minimization, underdetermined linear system, NotOAChecked, 004, 510, Information processing, I200 - Information systems, sparse representation
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 30 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
