{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:42:41Z","timestamp":1740134561693,"version":"3.37.3"},"reference-count":15,"publisher":"Wiley","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61172140","A1098522-02","U1233105"],"award-info":[{"award-number":["61172140","A1098522-02","U1233105"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Projects for the Excellent Teaching Team Support","award":["61172140","A1098522-02","U1233105"],"award-info":[{"award-number":["61172140","A1098522-02","U1233105"]}]},{"DOI":"10.13039\/501100007538","name":"Civil Aviation Administration of China","doi-asserted-by":"crossref","award":["61172140","A1098522-02","U1233105"],"award-info":[{"award-number":["61172140","A1098522-02","U1233105"]}],"id":[{"id":"10.13039\/501100007538","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Applied Mathematics"],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>The principal component prsuit with reduced linear measurements (PCP_RLM) has gained great attention in applications, such as machine learning, video, and aligning multiple images. The recent research shows that strongly convex optimization for compressive principal component pursuit can guarantee the exact low-rank matrix recovery and sparse matrix recovery as well. In this paper, we prove that the operator of PCP_RLM satisfies restricted isometry property (RIP) with high probability. In addition, we derive the bound of parameters depending only on observed quantities based on RIP property, which will guide us how to choose suitable parameters in strongly convex programming.<\/jats:p>","DOI":"10.1155\/2013\/959403","type":"journal-article","created":{"date-parts":[[2013,5,23]],"date-time":"2013-05-23T17:01:56Z","timestamp":1369328516000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Restricted Isometry Property of Principal Component Pursuit with Reduced Linear Measurements"],"prefix":"10.1155","volume":"2013","author":[{"given":"Qingshan","family":"You","sequence":"first","affiliation":[{"name":"School of Computer Science, Civil Aviation Flight University of China, GuangHan, Sichuan 618307, China"},{"name":"School of Electronic Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qun","family":"Wan","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiwen","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Civil Aviation Flight University of China, GuangHan, Sichuan 618307, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050258"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1190\/1.1440378"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2008.918455"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2006.881969"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"journal-title":"IEEE International Symposium on Information Theory Proceedings","first-page":"1281","year":"2012","key":"10"},{"journal-title":"IEEE International Symposium on Information Theory Proceedings","first-page":"1276","year":"2012","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2012.6.357"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2013.7.305"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2013.7.305"},{"volume-title":"Guaranteed rank minimization via singular value projection","year":"2010","key":"16"},{"key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1015957395"}],"container-title":["Journal of Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/959403.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/959403.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/959403.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,7,30]],"date-time":"2016-07-30T14:54:57Z","timestamp":1469890497000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/jam\/2013\/959403\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":15,"alternative-id":["959403","959403"],"URL":"https:\/\/doi.org\/10.1155\/2013\/959403","relation":{},"ISSN":["1110-757X","1687-0042"],"issn-type":[{"type":"print","value":"1110-757X"},{"type":"electronic","value":"1687-0042"}],"subject":[],"published":{"date-parts":[[2013]]}}}