{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:40Z","timestamp":1750307020583,"version":"3.41.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004084","name":"Korea Science and Engineering Foundation","doi-asserted-by":"publisher","award":["KOSEF 2009-007-1314"],"award-info":[{"award-number":["KOSEF 2009-007-1314"]}],"id":[{"id":"10.13039\/501100004084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19310096","21710148","20003236"],"award-info":[{"award-number":["19310096","21710148","20003236"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2012,8]]},"abstract":"<jats:p>SFSDP is a Matlab package for solving sensor network localization (SNL) problems. These types of problems arise in monitoring and controlling applications using wireless sensor networks. SFSDP implements the semidefinite programming (SDP) relaxation proposed in Kim et al. [2009] for sensor network localization problems, as a sparse version of the full semidefinite programming relaxation (FSDP) by Biswas and Ye [2004]. To improve the efficiency of FSDP, SFSDP exploits the aggregated and correlative sparsity of a sensor network localization problem. As a result, SFSDP can handle much larger problems than other software as well as three-dimensional anchor-free problems. SFSDP analyzes the input data of a sensor network localization problem, solves the problem, and displays the computed locations of sensors. SFSDP also includes the features of generating test problems for numerical experiments.<\/jats:p>","DOI":"10.1145\/2331130.2331135","type":"journal-article","created":{"date-parts":[[2012,9,4]],"date-time":"2012-09-04T12:50:47Z","timestamp":1346763047000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Algorithm 920"],"prefix":"10.1145","volume":"38","author":[{"given":"Sunyoung","family":"Kim","sequence":"first","affiliation":[{"name":"Ewha W. University"}]},{"given":"Masakazu","family":"Kojima","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}]},{"given":"Hayato","family":"Waki","sequence":"additional","affiliation":[{"name":"University of Electro-Communications"}]},{"given":"Makato","family":"Yamashita","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}]}],"member":"320","published-online":{"date-parts":[[2012,8]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008655427845"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984630"},{"key":"e_1_2_2_3_1","unstructured":"Biswas P. and Ye Y. 2006. A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization. In Multiscale Optimization Methods and Applications. Springer. Biswas P. and Ye Y. 2006. A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization. In Multiscale Optimization Methods and Applications . Springer."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2006.877401"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1149283.1149286"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/05062754X"},{"key":"e_1_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Blair J. R. S. and Peyton B. 1993. An introduction to chordal graphs and clique trees. In Graph Theory and Sparse Matrix Computation A. George J. R. Gilbert and J. W. H. Liu des Eds. Springer 1--29. Blair J. R. S. and Peyton B. 1993. An introduction to chordal graphs and clique trees. In Graph Theory and Sparse Matrix Computation A. George J. R. Gilbert and J. W. H. Liu des Eds. Springer 1--29.","DOI":"10.1007\/978-1-4613-8369-7_1"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/040621600"},{"volume":"3","volume-title":"Proceedings of the 20th IEEE INFOCOM Conference.","author":"Doherty L.","key":"e_1_2_2_9_1"},{"volume":"4","volume-title":"Proceedings of the IEEE INFOCOM Conference","author":"Eren T.","key":"e_1_2_2_10_1"},{"key":"e_1_2_2_11_1","unstructured":"Fujisawa K. Fukuda M. Kobayashi K. Kojima M. Nakata K. Nakata M. and Yamashita M. 2008. Sdpa (semidefinite programming algorithm) user\u2019s manual---version 7.0.5. Tech. rep. B-448 Department of Mathematical and Computing Sciences Tokyo Institute of Technology. Fujisawa K. Fukuda M. Kobayashi K. Kojima M. Nakata K. Nakata M. and Yamashita M. 2008. Sdpa (semidefinite programming algorithm) user\u2019s manual---version 7.0.5. Tech. rep. B-448 Department of Mathematical and Computing Sciences Tokyo Institute of Technology."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366218"},{"key":"e_1_2_2_13_1","unstructured":"Ganesan D. Krishnamachari B. Woo A. Culler D. Estrin D. and Wicker S. 2002. An empirical study of epidemic algorithms in large scale multihop wireless network. Tech. rep. IRB-TR-02-003 Intel Corporation. Ganesan D. Krishnamachari B. Woo A. Culler D. Estrin D. and Wicker S. 2002. An empirical study of epidemic algorithms in large scale multihop wireless network. Tech. rep. IRB-TR-02-003 Intel Corporation."},{"volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic M. C.","key":"e_1_2_2_14_1"},{"volume":"2","volume-title":"Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems.","author":"Howard A.","key":"e_1_2_2_15_1"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/080713380"},{"key":"e_1_2_2_17_1","unstructured":"Kim S. Kojima M. and Waki H. 2009b. User\u2019s manual for sfsdp: A sparse version of full semidefinite programming relaxation for sensor network localization problems. Tech. rep. B-449 Department of Mathematical and Computing Sciences Tokyo Institute of Technology. Kim S. Kojima M. and Waki H. 2009b. User\u2019s manual for sfsdp: A sparse version of full semidefinite programming relaxation for sensor network localization problems. Tech. rep. B-449 Department of Mathematical and Computing Sciences Tokyo Institute of Technology."},{"key":"e_1_2_2_18_1","unstructured":"Kim S. Kojima M. Mevissen M. and Yamashita M. 2009c. User\u2019s manual for sparsecolo: Conversion methods for sparse conic-form linear optimization problems. Tech. rep. B-453 Department of Mathematical and Computing Sciences Tokyo Institute of Technology. Kim S. Kojima M. Mevissen M. and Yamashita M. 2009c. User\u2019s manual for sparsecolo: Conversion methods for sparse conic-form linear optimization problems. Tech. rep. B-453 Department of Mathematical and Computing Sciences Tokyo Institute of Technology."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0402-6"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00245-007-9030-9"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733103"},{"key":"e_1_2_2_22_1","unstructured":"Lian T.-C. Wang T.-C. and Ye Y. 2004. A gradient search method to round the semidefinite programming relaxation solution for ad hoc wireless sensor network localization. Tech. rep. Department of Management Science and Engineering Stanford University. Lian T.-C. Wang T.-C. and Ye Y. 2004. A gradient search method to round the semidefinite programming relaxation solution for ad hoc wireless sensor network localization. Tech. rep. Department of Management Science and Engineering Stanford University."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0351-9"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-007-9131-z"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0338-x"},{"key":"e_1_2_2_26_1","unstructured":"SDPA Homepage. 2009. SDPA 7.3.1 http:\/\/sdpa.sourceforge.net\/. SDPA Homepage. 2009. SDPA 7.3.1 http:\/\/sdpa.sourceforge.net\/."},{"key":"e_1_2_2_27_1","unstructured":"SeDuMi Homepage. 2011. http:\/\/sedumi.mcmaster.ca. SeDuMi Homepage. 2011. http:\/\/sedumi.mcmaster.ca."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805766"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/050640308"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0347-5"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/050623802"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/060669395"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2331130.2331135","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2331130.2331135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:12Z","timestamp":1750236552000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2331130.2331135"}},"subtitle":["SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems"],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["10.1145\/2331130.2331135"],"URL":"https:\/\/doi.org\/10.1145\/2331130.2331135","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"type":"print","value":"0098-3500"},{"type":"electronic","value":"1557-7295"}],"subject":[],"published":{"date-parts":[[2012,8]]},"assertion":[{"value":"2009-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}