{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T19:26:17Z","timestamp":1773170777513,"version":"3.50.1"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11131006"],"award-info":[{"award-number":["11131006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271297"],"award-info":[{"award-number":["11271297"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"EU FP7 EYE2E Project","award":["269118"],"award-info":[{"award-number":["269118"]}]},{"name":"LIVCODE Project","award":["295151"],"award-info":[{"award-number":["295151"]}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2013CB329404"],"award-info":[{"award-number":["2013CB329404"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1109\/tit.2015.2429611","type":"journal-article","created":{"date-parts":[[2015,5,5]],"date-time":"2015-05-05T18:51:47Z","timestamp":1430851907000},"page":"4028-4033","source":"Crossref","is-referenced-by-count":33,"title":["$NP\/CMP$  Equivalence: A Phenomenon Hidden Among Sparsity Models $l_{0}$  Minimization and $l_{p}$  Minimization for Information Processing"],"prefix":"10.1109","volume":"61","author":[{"given":"Jigen","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigang","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiyang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.959265"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0502269102"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0437847100"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.09.001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-011-9871-x"},{"key":"ref16","author":"goemans","year":"2009","journal-title":"Linear Programming and Polyhedral Combinatorics"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/78.558475"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0019-9","author":"gr\u00fcnbaum","year":"2003","journal-title":"Convex Polytopes"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820031"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","article-title":"$L_{1\/2}$ regularization: A thresholding representation theory and a fast solver","volume":"23","author":"xu","year":"2012","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159959"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/060657704"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20303"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2007.898300"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01236933"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016030"},{"key":"ref1","author":"aliprantis","year":"2006","journal-title":"Infinite Dimensional Analysis A Hitchhiker&#x2019;s Guide"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2278179"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-008-0103-8"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/090775397"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511910135"},{"key":"ref23","first-page":"3885","article-title":"Stable sparse approximations via nonconvex optimization","author":"saab","year":"2008","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref26","article-title":"Sparsityaware learning and compressed sensing: An overview","author":"theodoridis","year":"2012"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2011.07.001"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7122957\/07101837.pdf?arnumber=7101837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:01:49Z","timestamp":1642003309000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7101837\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":28,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2429611","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7]]}}}