Abstract-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 lp-norm minimization problem also solves the l0-norm minimization problem whenever 0 < p < p * (A, b) . This phenomenon is named N P/CM P equivalence.
Furthermore, Peng, Yue and Li REF have proved that there exists a constant p(A, b) > 0, such that every a solution of l p -minimization is also the solution of l 0 -minimization whenever 0 < p < p(A, b).
NP/CMP Equivalence: A Phenomenon Hidden Among Sparsity Models l0 Minimization and p Minimization for Information Processing
IEEE Trans. Inf. Theory
IEEE Trans. Inf. Theory
Mathematics Computer Science