Peng, Jigen, Yue, Shigang and Li, Haiyang (2015) NP/CMP equivalence: a phenomenon hidden among sparsity models l_{0} minimization and l_{p} minimization for information processing. IEEE Transactions on Information Theory, 61 (7). pp. 4028-4033. ISSN 0018-9448
Full content URL: https://doi.org/10.1109/TIT.2015.2429611
| Documents |
|
| ||||||||
![[img]](http://eprints.lincoln.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
2015 JigenPeng&ShigangYue&HaiyangLi sparse information processing IEEE TIT -downloaded.pdf - Whole Document Restricted to Repository staff only 953kB | |
|
PDF
17877 small p-equivalence single_SJF edit 041215.pdf - Whole Document 3MB |
| Item Type: | Article |
|---|---|
| Item Status: | Live Archive |
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 l p-norm minimization problem also solves the l0-norm minimization problem whenever 0 <; p <; p*(A, b). This phenomenon is named NP/CMP equivalence.
| Keywords: | Information processing, sparse representation, sparse recovery, l p minimization, underdetermined linear system, bmjgoldcheck, NotOAChecked |
|---|---|
| Subjects: | G Mathematical and Computer Sciences > G500 Information Systems |
| Divisions: | College of Science > School of Computer Science |
| Related URLs: | |
| ID Code: | 17877 |
| Deposited On: | 17 Jul 2015 07:51 |
Repository Staff Only: item control page