NP/CLP Equivalence: A Phenomenon Hidden Among Sparsity Models for Information Processing
Abstract
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 lp-norm minimization problem also solves the l0-norm minimization problem whenever 0<p<p(A,b). This phenomenon is named NP/CLP equivalence.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.