English

$NP/CLP$ Equivalence: A Phenomenon Hidden Among Sparsity Models for Information Processing

Information Theory 2015-01-12 v1 math.IT

Abstract

It is proved in this paper that to every underdetermined linear system Ax=bAx=b there corresponds a constant p(A,b)>0p(A,b)>0 such that every solution to the lpl_p-norm minimization problem also solves the l0l_0-norm minimization problem whenever 0<p<p(A,b)0<p<p(A,b). This phenomenon is named NP/CLPNP/CLP equivalence.

Cite

@article{arxiv.1501.02018,
  title  = {$NP/CLP$ Equivalence: A Phenomenon Hidden Among Sparsity Models for Information Processing},
  author = {Jigen Peng and Shigang Yue and Haiyang Li},
  journal= {arXiv preprint arXiv:1501.02018},
  year   = {2015}
}

Comments

submitted to IEEE Transactions on Information Theory in June 2014

R2 v1 2026-06-22T07:55:47.134Z