Explicit sensor network localization using emidefinite representations and facial reductions

SIAM Journal on Optimization

Volumn 20, Issue 5, 2010, Pages 2679-2708

  Krislock, Nathan ^a   Wolkowicz, Henry ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Euclidean distance matrix completions; Loss of the Slater constraint qualification; Semidefinite programming; Sensor network localization

Indexed keywords

COMPLETION PROBLEM; CONSTRAINT QUALIFICATION; EMBEDDING DIMENSIONS; EUCLIDEAN DISTANCE MATRICES; FEASIBLE SET; INTERIOR POINT; LINEAR MAPPING; LOW DIMENSIONAL; MATRIX REPRESENTATION; NP-HARD PROBLEM; PRIMAL-DUAL; RADIO RANGE; SDP RELAXATION; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE MATRIX; SENSOR NETWORK LOCALIZATION; SOLUTION TECHNIQUES; WIRELESS SENSOR;

MATHEMATICAL PROGRAMMING; SENSOR NETWORKS; SPATIAL VARIABLES MEASUREMENT;

MATRIX ALGEBRA;

EID: 77956091432     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/090759392     Document Type: Article

References (29)

1. S. Al-Homidan and H. Wolkowicz, Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming, Linear Algebra Appl., 406 (2005), pp. 109-141.
2. A. Alfakih, M. F. Anjos, V. Piccialli, and H. Wolkowicz, Euclidean distance matrices, semidefinite programming, and sensor network localization, Port. Math., to appear.
3. A. Alfakih, A. Khandani, and H. Wolkowicz, Solving Euclidean distance matrix completion problems via semidefinite programming, Comput. Optim. Appl., 12 (1999), pp. 13-30.
4. B. Ames and S. A. Vavasis, Nuclear Norm Minimization for the Planted Clique and Biclique Problems, available online from http://arxiv.org/abs/0901. 3348.
5. P. Biswas, Semidefinite Programming Approaches to Distance Geometry Problems, Ph.D. thesis, Stanford University, Stanford, CA, 2007.
6. P. Biswas, T.-C. Liang, K.-C. Toh, T.-C. Wang, and Y. Ye, Semidefinite programming approaches for sensor network localization with noisy distance measurements, IEEE Trans. Autom. Sci. Eng., 3 (2006), pp. 360-371.
7. P. Biswas, K.-C. Toh, and Y. Ye, A distributed SDP approach for large-scale noisy anchorfree graph reailzation with applications to molecular conformation, SIAM J. Sci. Comput., 30 (2008), pp. 1251-1277.
8. P. Biswas, T.-C. Lian, T.-C. Wang, and Y. Ye, Semidefinite programming for ad hoc wireless sensor network localization, ACM Trans. Sen. Netw., 2 (2006), pp. 188-220.
9. P. Biswas and Y. Ye, A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization, in Multiscale Optimization Methods and Applications, Nonconvex Optim. Appl. 82, Springer, New York, 2006, pp. 69-84.
10. M. W. Carter, H. H. Jin, M. A. Saunders, and Y. Ye, SpaseLoc: An adaptive subproblem algorithm for scalable wireless sensor network localization, SIAM J. Optim., 17 (2006), pp. 1102-1128.
11. A. Cassioli, Global Optimization of Highly Multimodal Problems, Ph.D. thesis, Universita di Firenze, Firenze, Italy, 2008.
12. J. Dattorro, Convex Optimization & Euclidean Distance Geometry, Meboo Publishing, Palo Alto, CA, 2005.
13. Y. Ding, N. Krislock, J. Qian, and H. Wolkowicz, Sensor network localization, Euclidean distance matrix completions, and graph realization, Optim. Eng., 11 (2010), pp. 45-66.
14. T. Eren, D. K. Goldenberg,W.Whiteley, Y. R. Yang, A. S.Morse, B. D. O. Anderson, and P. N. Belhumeur, Rigidity, computation, and randomization in network localization, in IEEE INFOCOM 2004-The Conference on Computer Communications, 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, 4 (2004), pp. 2673-2684.
15. U. Feige and R Krauthgamer, Finding and certifying a large hidden clique in a semi-random graph, Random Structures Algorithms, 16 (2000), pp. 195-202.
16. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
17. B. Hendrickson, The Molecule Problem: Determining Conformation from Pairwise Distances, Ph.D. thesis, Cornell University, Ithaca, NY, 1991.
18. B. Hendrickson, Conditions for unique graph realizations, SIAM J. Comput., 21 (1992), pp. 65-84.
19. H. Jin, Scalable Sensor Localization Algorithms for Wireless Sensor Networks, Ph.D. thesis, Toronto University, Toronto, Ontario, Canada, 2005.
20. S. Kim, M. Kojima, and H. Waki, Exploiting sparsity in SDP relaxation for sensor network localization, SIAM J. Optim., 20 (2009), pp. 192-215.
21. S. Kim, M. Kojima, H. Waki, and M. Yamashita, A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems, Technical Report B- 457, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo, 2009.
22. G. Pataki, Geometry of semidefinite programming, in Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, H.Wolkowicz, R. Saigal, and L. Vandenberghe, eds., Kluwer Academic Publishers, Boston, MA, 2000.
23. T. Pong and P. Tseng, (Robust) Edge-based semidefinite programming relaxation of sensor network localization, Math. Program., published online (2010
24. J. B. Saxe, Embeddability of weighted graphs in k-space is strongly NP-hard, in Proceedings of the 17th Allerton Conference on Communications, Control, and Computing, University of Illinois at Urbana-Champaign, 1979, pp. 480-489.
25. A. M.-C. So and Y. Ye, Theory of semidefinite programming for sensor network localization, Math. Program., 109 (2007), pp. 367-384.
26. P. Tseng, Second-order cone programming relaxation of sensor network localization, SIAM J. Optim., 18 (2007), pp. 156-185.
27. R. J. Vanderbei and Y. Bing, The simplest semidefinite programs are trivial, Math. Oper. Res., 20 (1995), pp. 590-596.
28. Z. Wang, S. Zheng, Y. Ye, and S. Boyd, Further relaxations of the semidefinite programming approach to sensor network localization, SIAM J. Optim., 19 (2008), pp. 655-673.
29. H. Wolkowicz, Explicit solutions for interval semidefinite linear programs, Linear Algebra Appl., 236 (1996), pp. 95-104.