Sum of squares method for sensor network localization

Computational Optimization and Applications

Volumn 43, Issue 2, 2009, Pages 151-179

  Nie, Jiawang ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Distance geometry; Error bound; Graph realization; Polynomials; Semidefinite program (SDP); Sensor network localization; Sum of squares (SOS)

Indexed keywords

DISTANCE GEOMETRY; ERROR BOUND; GRAPH REALIZATION; SEMIDEFINITE PROGRAM (SDP); SENSOR NETWORK LOCALIZATION; SUM OF SQUARES (SOS);

POLYNOMIALS; QUADRATIC PROGRAMMING;

SENSOR NETWORKS;

EID: 67349132549     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9131-z     Document Type: Article

References (32)

1. Aspnes, J., Goldberg, D., Yang, Y.R.: On the Computational Complexity of Sensor Network Localization. Lecture Notes in Computer Science, vol. 3121, pp. 32-44. Springer, Berlin (2004) (Pubitemid 38999494)
2. 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)
3. 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)
4. S.J. Benson Y. Ye X. Zhang 2000 Solving large-scale sparse semidefinite programs for combinatorial optimization SIAM J. Optim. 10 443 461
5. 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-30. Springer, Berlin (1993)
6. Blekherman, G.: Volumes of nonnegative polynomials, sums of squares, and powers of linear forms, preprint, arXiv:math.AG/0402158
7. Blumenthal, L.: Theory and Applications of Distance Geometry. Chelsea Publishing Company, Bronx (1970)
8. Biswas, P., Ye, Y.: Semidefinite programming for ad hoc wireless sensor network localization. In: Proc. 3rd IPSN, pp. 46-54 (2004)
9. P. Biswas T.C. Liang K.C. Toh T.C. Wang Y. Ye 2006 Semidefinite Programming Approaches for Sensor Network Localization with Noisy Distance Measurements IEEE Trans. Automat. Sci. Eng. 3 4 360 371 (Pubitemid 44574330)
10. R.E. Curto L.A. Fialkow 2000 The truncated complex K-moment problem Trans. Am. Math. Soc. 352 2825 2855
11. L. Doherty K.S.J. Pister L. El Ghaoui 2001 Convex Position Estimation in Wireless Sensor Networks Proc. 20th IEEE Infocom 3 1655 1663
12. K. Gatermann P. Parrilo 2004 Symmetry groups, semidefinite programs, and sums of squares J. Pure Appl. Algebra 192 1-3 95 128 (Pubitemid 38773555)
13. D. Henrion J. Lasserre 2003 GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi ACM Trans. Math. Soft. 29 165 194
14. 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)
15. 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/
16. Kojima, M., Kim, S., Waki, H.: Sparsity in sums of squares of polynomials. Math. Program. 103(1), 45-62
17. J. Lasserre 2001 Global optimization with polynomials and the problem of moments SIAM J. Optim. 11 3 796 817 (Pubitemid 33312508)
18. A. Man-cho So Y. Ye 2007 The theory of semidefinite programming for sensor network localization Math. Program. Ser. B 109 367 384 (Pubitemid 46197861)
19. J. Moré Z. Wu 1997 Global continuation for distance geometry problems SIAM J. Optim. 7 814 836 (Pubitemid 127108820)
20. J. Nie J. Demmel B. Sturmfels 2006 Minimizing polynomials via sum of squares over the gradient ideal Math. Program. Ser. A 106 3 587 606 (Pubitemid 43296490)
21. P. Parrilo 2003 Semidefinite Programming relaxations for semialgebraic problems Math. Program. Ser. B 96 2 293 320
22. Parrilo, P.: Exploiting structure in sum of squares programs. In: Proceedings for the 42nd IEEE Conference on Decision and Control. Maui, Hawaii (2003)
23. 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-100. American Mathematical Society, Providence (2003)
24. Prajna, S., Papachristodoulou, A., Parrilo, P.: SOSTOOLS User's Guide. Website: http://www.mit.edu/~parrilo/SOSTOOLS/
25. B. Reznick 1978 Extremal psd forms with few terms Duke Math. J. 45 363 374
26. 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-489 (1979)
27. J.F. Sturm 1999 SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones Optim. Methods Soft. 11&12 625 653
28. Sturmfels, B.: Solving systems of polynomial equations. Am. Math. Soc., CBMS regional conferences series, No. 97, Providence, Rhode Island, 2002
29. P. Tseng 2007 Second-order cone programming relaxation of sensor network localization SIAM J. Optim. 18 1 156 185
30. H. Waki S. Kim M. Kojima M. Muramatsu 2006 Sums of squares and semidefinite programming relaxations for polynomial optimization problems with structured sparsity SIAM J. Optim. 17 1 218 242 (Pubitemid 46279501)
31. Waki, H., Kim, S., Kojima, M., Muramatsu, M.: SparsePOP:∈a sparse semidefinite programming relaxation of polynomial optimization problems. http://www.is.titech.ac.jp/~kojima
32. Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Kluwer Academic, Dordrecht (2000)