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

preprint2015arXivOpen access

It is proved in this paper that to 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<p<p(A,b)$ . This phenomenon is named $NP/CLP$ equivalence.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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