{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T15:27:20Z","timestamp":1774452440983,"version":"3.50.1"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/infcom.2013.6567056","type":"proceedings-article","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T20:12:57Z","timestamp":1375387977000},"page":"2499-2507","source":"Crossref","is-referenced-by-count":33,"title":["Beyond convex relaxation: A polynomial-time non-convex optimization approach to network localization"],"prefix":"10.1109","author":[{"given":"Senshan","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kam-Fung","family":"Sze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zirui","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony Man-Cho","family":"So","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934976"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.11.002"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033811"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0338-x"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581085"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-008-9072-0"},{"key":"34","author":"bertsimas","year":"1997","journal-title":"Introduction to Linear Optimization"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462057"},{"key":"13","first-page":"192","volume":"20","author":"kim","year":"2009","journal-title":"Exploiting sparsity in SDP relaxation for sensor network localization"},{"key":"14","first-page":"228","article-title":"On the use of convex optimization in sensor network localization and synchronization","author":"shames","year":"2009","journal-title":"Proc 1st IFAC Workshop on Estimation and Control of Networked Systems"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0040-1"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1137\/05062754X"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805766"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984630"},{"key":"22","year":"0","journal-title":"Low-rank Matrix Recovery and Completion Via Convex Optimization"},{"key":"23","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1214\/10-AOS860","article-title":"Estimation of high-dimensional low-rank matrices","volume":"39","author":"rohde","year":"2011","journal-title":"Ann Stat"},{"key":"24","author":"yue","year":"2012","journal-title":"A Perturbation Inequality for the Schatten P-Quasi-Norm and Its Applications to Low-Rank Matrix Recovery"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0470-2"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706969"},{"key":"27","author":"lai","year":"2012","journal-title":"Low-Rank Matrix Recovery Using Unconstrained Smoothed-lQ Minimization"},{"key":"28","article-title":"Low-rank matrix recovery via efficient schatten p-norm minimization","author":"nie","year":"2012","journal-title":"Proc AAAI-12"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159959"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2005.1458287"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2004.18"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1149283.1149286"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2011.2114734"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2007916"},{"key":"7","first-page":"32","article-title":"On the computational complexity of sensor network localization","author":"aspnes","year":"2004","journal-title":"Proceedings of ALGOSENSORS 2004"},{"key":"6","first-page":"480","article-title":"Embeddability of weighted graphs in k-space is strongly NP-hard","author":"saxe","year":"1979","journal-title":"Proc 17th Allerton Conf Commun Control and Comput"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581726"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2008.2008853"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2153848"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2005.1458275"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916662"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7371-9"}],"event":{"name":"IEEE INFOCOM 2013 - IEEE Conference on Computer Communications","location":"Turin, Italy","start":{"date-parts":[[2013,4,14]]},"end":{"date-parts":[[2013,4,19]]}},"container-title":["2013 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6556116\/6566708\/06567056.pdf?arnumber=6567056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T17:14:19Z","timestamp":1498065259000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6567056\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/infcom.2013.6567056","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}