{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T17:51:21Z","timestamp":1771955481161,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,11,20]],"date-time":"2007-11-20T00:00:00Z","timestamp":1195516800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10589-007-9131-z","type":"journal-article","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T09:33:01Z","timestamp":1195464781000},"page":"151-179","source":"Crossref","is-referenced-by-count":81,"title":["Sum of squares method for sensor network localization"],"prefix":"10.1007","volume":"43","author":[{"given":"Jiawang","family":"Nie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,20]]},"reference":[{"key":"9131_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/978-3-540-27820-7_5","volume-title":"On the Computational Complexity of Sensor Network Localization","author":"J. Aspnes","year":"2004","unstructured":"Aspnes, J., Goldberg, D., Yang, Y.R.: On the Computational Complexity of Sensor Network Localization. Lecture Notes in Computer Science, vol. 3121, pp. 32\u201344. Springer, Berlin (2004)"},{"key":"9131_CR2","unstructured":"Benson, S.J., Ye, Y.: DSDP3: Dual scaling algorithm for general positive semidefinite programming. Tech. Report ANL\/MCS-P851-1000, Mathematics and Computer Science Division, Argonne National Laboratory (Feb. 2001)"},{"key":"9131_CR3","unstructured":"Benson, S.J., Ye, Y.: DSDP5: A software package implementing the dual-scaling algorithm for semidefinite programming. Tech. Report ANL\/MCS-TM-255, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (June 2002)"},{"key":"9131_CR4","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/S1052623497328008","volume":"10","author":"S.J. Benson","year":"2000","unstructured":"Benson, S.J., Ye, Y., Zhang, X.: Solving large-scale sparse semidefinite programs for combinatorial optimization. SIAM J. Optim. 10, 443\u2013461 (2000)","journal-title":"SIAM J. Optim."},{"key":"9131_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4613-8369-7_1","volume-title":"Graph Theory and Sparse Matrix Computations","author":"J. Blair","year":"1993","unstructured":"Blair, J., Peyton, B.: An introduction to chordal graphs and clique trees. In George, J., Gilbert, J., Liu, J. (eds.) Graph Theory and Sparse Matrix Computations, pp. 1\u201330. Springer, Berlin (1993)"},{"key":"9131_CR6","unstructured":"Blekherman, G.: Volumes of nonnegative polynomials, sums of squares, and powers of linear forms, preprint, arXiv:math.AG\/0402158"},{"key":"9131_CR7","volume-title":"Theory and Applications of Distance Geometry","author":"L. Blumenthal","year":"1970","unstructured":"Blumenthal, L.: Theory and Applications of Distance Geometry. Chelsea Publishing Company, Bronx (1970)"},{"key":"9131_CR8","doi-asserted-by":"crossref","unstructured":"Biswas, P., Ye, Y.: Semidefinite programming for ad hoc wireless sensor network localization. In: Proc. 3rd IPSN, pp. 46\u201354 (2004)","DOI":"10.1145\/984622.984630"},{"issue":"4","key":"9131_CR9","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/TASE.2006.877401","volume":"3","author":"P. Biswas","year":"2006","unstructured":"Biswas, P., Liang, T.C., Toh, K.C., Wang, T.C., Ye, Y.: Semidefinite Programming Approaches for Sensor Network Localization with Noisy Distance Measurements. IEEE Trans. Automat. Sci. Eng. 3(4), 360\u2013371 (2006)","journal-title":"IEEE Trans. Automat. Sci. Eng."},{"key":"9131_CR10","doi-asserted-by":"crossref","first-page":"2825","DOI":"10.1090\/S0002-9947-00-02472-7","volume":"352","author":"R.E. Curto","year":"2000","unstructured":"Curto, R.E., Fialkow, L.A.: The truncated complex K-moment problem. Trans. Am. Math. Soc. 352, 2825\u20132855 (2000)","journal-title":"Trans. Am. Math. Soc."},{"key":"9131_CR11","first-page":"1655","volume":"3","author":"L. Doherty","year":"2001","unstructured":"Doherty, L., Pister, K.S.J., El Ghaoui, L.: Convex Position Estimation in Wireless Sensor Networks. Proc. 20th IEEE Infocom 3, 1655\u20131663 (2001)","journal-title":"Proc. 20th IEEE Infocom"},{"issue":"1\u20133","key":"9131_CR12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.jpaa.2003.12.011","volume":"192","author":"K. Gatermann","year":"2004","unstructured":"Gatermann, K., Parrilo, P.: Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192(1\u20133), 95\u2013128 (2004)","journal-title":"J. Pure Appl. Algebra"},{"key":"9131_CR13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/779359.779363","volume":"29","author":"D. Henrion","year":"2003","unstructured":"Henrion, D., Lasserre, J.: GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. ACM Trans. Math. Soft. 29, 165\u2013194 (2003)","journal-title":"ACM Trans. Math. Soft."},{"key":"9131_CR14","series-title":"Lecture Notes on Control and Information Sciences","doi-asserted-by":"crossref","DOI":"10.1007\/b96977","volume-title":"Positive Polynomials in Control","author":"D. Henrion","year":"2005","unstructured":"Henrion, D., Lasserre, J.: Detecting global optimality and extracting solutions in GloptiPoly. In: Henrion, D., Garulli, A. (eds.) Positive Polynomials in Control. Lecture Notes on Control and Information Sciences. Springer, Berlin (2005)"},{"key":"9131_CR15","unstructured":"Krislock, N., Piccialli, V., Wolkowicz, H.: Robust semidefinite programming approaches for sensor network localization with anchors. CORR 2006-12, May 2006. http:\/\/orion.uwaterloo.ca\/~hwolkowi\/"},{"key":"9131_CR16","doi-asserted-by":"crossref","unstructured":"Kojima, M., Kim, S., Waki, H.: Sparsity in sums of squares of polynomials. Math. Program. 103(1), 45\u201362","DOI":"10.1007\/s10107-004-0554-3"},{"issue":"3","key":"9131_CR17","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J. Lasserre","year":"2001","unstructured":"Lasserre, J.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"9131_CR18","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10107-006-0040-1","volume":"109","author":"A. Man-cho So","year":"2007","unstructured":"Man-cho So, A., Ye, Y.: The theory of semidefinite programming for sensor network localization. Math. Program. Ser. B 109, 367\u2013384 (2007)","journal-title":"Math. Program. Ser. B"},{"key":"9131_CR19","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1137\/S1052623495283024","volume":"7","author":"J. Mor\u00e9","year":"1997","unstructured":"Mor\u00e9, J., Wu, Z.: Global continuation for distance geometry problems. SIAM J. Optim. 7, 814\u2013836 (1997)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9131_CR20","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10107-005-0672-6","volume":"106","author":"J. Nie","year":"2006","unstructured":"Nie, J., Demmel, J., Sturmfels, B.: Minimizing polynomials via sum of squares over the gradient ideal. Math. Program. Ser. A 106(3), 587\u2013606 (2006)","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"9131_CR21","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"P. Parrilo","year":"2003","unstructured":"Parrilo, P.: Semidefinite Programming relaxations for semialgebraic problems. Math. Program. Ser. B 96(2), 293\u2013320 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"9131_CR22","doi-asserted-by":"crossref","unstructured":"Parrilo, P.: Exploiting structure in sum of squares programs. In: Proceedings for the 42nd IEEE Conference on Decision and Control. Maui, Hawaii (2003)","DOI":"10.1109\/CDC.2003.1272305"},{"key":"9131_CR23","first-page":"83","volume-title":"Proceedings of the DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, March 2001","author":"P. Parrilo","year":"2003","unstructured":"Parrilo, P., Sturmfels, B.: Minimizing polynomial functions. In: Basu, S., Gonzalez-Vega, L. (eds.) Proceedings of the DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, March 2001, pp. 83\u2013100. American Mathematical Society, Providence (2003)"},{"key":"9131_CR24","unstructured":"Prajna, S., Papachristodoulou, A., Parrilo, P.: SOSTOOLS User\u2019s Guide. Website: http:\/\/www.mit.edu\/~parrilo\/SOSTOOLS\/"},{"key":"9131_CR25","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1215\/S0012-7094-78-04519-2","volume":"45","author":"B. Reznick","year":"1978","unstructured":"Reznick, B.: Extremal psd forms with few terms. Duke Math. J. 45, 363\u2013374 (1978)","journal-title":"Duke Math. J."},{"key":"9131_CR26","unstructured":"Saxe, J.: Embeddability of weighted graphs in k-space is strongly NP-hard. In: Proc. 17th Allerton Conference in Communications, Control, and Computing, Monticello, IL, pp. 480\u2013489 (1979)"},{"key":"9131_CR27","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11&12","author":"J.F. Sturm","year":"1999","unstructured":"Sturm, J.F.: SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Soft. 11&12, 625\u2013653 (1999)","journal-title":"Optim. Methods Soft."},{"key":"9131_CR28","doi-asserted-by":"crossref","unstructured":"Sturmfels, B.: Solving systems of polynomial equations. Am. Math. Soc., CBMS regional conferences series, No. 97, Providence, Rhode Island, 2002","DOI":"10.1090\/cbms\/097"},{"issue":"1","key":"9131_CR29","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1137\/050640308","volume":"18","author":"P. Tseng","year":"2007","unstructured":"Tseng, P.: Second-order cone programming relaxation of sensor network localization. SIAM J. Optim. 18(1) 156\u2013185 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9131_CR30","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/050623802","volume":"17","author":"H. Waki","year":"2006","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M.: Sums of squares and semidefinite programming relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17(1), 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"key":"9131_CR31","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M.: SparsePOP:\u2009a sparse semidefinite programming relaxation of polynomial optimization problems. http:\/\/www.is.titech.ac.jp\/~kojima"},{"key":"9131_CR32","volume-title":"Handbook of Semidefinite Programming","year":"2000","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Kluwer Academic, Dordrecht (2000)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9131-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9131-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9131-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:33Z","timestamp":1559288193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9131-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,20]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9131"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9131-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,20]]}}}