A Lagrangian dual approach to the single-source localization problem

IEEE Transactions on Signal Processing

Volumn 61, Issue 15, 2013, Pages 3815-3826

  Qi, Hou Duo ^a   Xiu, Naihua ^b   Yuan, Xiaoming ^c  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b BEIJING JIAOTONG UNIVERSITY   (China)

^c HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

Euclidean distance matrix; Lagrangian duality; low rank approximation; orthogonal projection

Indexed keywords

EUCLIDEAN DISTANCE MATRICES; LAGRANGIAN DUAL PROBLEM; LAGRANGIAN DUALITY; LOW RANK APPROXIMATIONS; MULTIPLE SOURCE LOCALIZATIONS; ORTHOGONAL PROJECTION; SEMI-DEFINITE PROGRAMMING; TRUST-REGION SUBPROBLEM;

SIGNAL PROCESSING;

MATHEMATICAL PROGRAMMING;

EID: 84880528983     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2013.2264814     Document Type: Article

References (30)

1. A. Y. Alfakih, A. Khandani, and H. Wolkowicz, "Solving Euclidean distance matrix completion problems via semidefinite programming," Comput. Optim. Appl., vol. 12, pp. 13-30, 1999. (Pubitemid 129574922)
2. A. Beck andD. Pan, "On the solution of the GPS localization and circle fitting problems," SIAM. J. Optim., vol. 22, pp. 108-134, 2012.
3. A. Beck, P. Stoica, and J. Li, "Exact and approximate solutions of source localization problems," IEEE Trans. Signal Process., vol. 56, pp. 1770-1778, 2008.
4. A. Beck, M. Teboulle, and Z. Chikishev, "Iterative minimization schemes for solving the single source localization problem," SIAM J. Optim., vol. 19, pp. 1397-1416, 2008.
5. P. Biswas, T.-C. Lian, K.-C. Toh, T.-C.Wang, and Y. Ye, "Semidefinite programming based algorithms for sensor network localization," ACM Trans. Sens. Netw., vol. 2, pp. 188-220, 2006. (Pubitemid 44188494)
6. I. Borg and P. J. F. Groenen, Modern Multidimensional Scaling: Theory and Applications, ser. Springer Series in Statistics, 2nd ed. New York, NY, USA: Springer, 2005.
7. K. W. Cheung, H. C. So, W. K. Ma, and Y. T. Chan, "Least squares algorithms for time-of-arrival-based mobile location," IEEE Trans. Signal Process., vol. 52, pp. 1121-1228, 2004.
8. F. H. Clarke, Optimization and Nonsmooth Analysis. NewYork,NY, USA: Wiley, 1983.
9. T. F. Cox and M. A. A. Cox, Multidimensional Scaling, 2nd ed. London, U.K.: Chapman & Hall/CRC, 2001.
10. J. Dattorro, ConvexOptimization and Euclidean DistanceGeometry. New York, NY, USA: Meboo, 2005.
11. C. Fortin and H. Wolkowicz, "The trust region subproblem and semidefinite programming," Optim. Meth. Softw., vol. 19, pp. 41-67, 2004.
12. N. Gaffke and R. Mathar, "A cyclic projection algorithm via duality," Metrika, vol. 36, pp. 29-54, 1989.
13. Y. Gao, "Structured low rank matrix optimization problems: a penalty approach" Ph.D. dissertation, National Univ. Singapore, Singpaore, 2010 [Online]. Available: http://www.maths.edu.sg/~matsundf
14. W. Glunt, T. L. Hayden, S. Hong, and J.Wells, "An alternating projection algorithm for computing the nearest Euclidean distance matrix," SIAM J. Matrix Anal. Appl., vol. 11, pp. 589-600, 1990.
15. W. Glunt, T. L. Hayden, and R. Raydan, "Molecular conformations from distancematrices," J. Comput. Chem., vol. 14, pp. 114-120, 1993.
16. J. C. Gower, "Properties of Euclidean and non-Euclidean distance matrices," Linear Algebra Appl., vol. 67, pp. 81-97, 1985.
17. T. L. Hayden and J. Wells, "Approximation by matrices positive semidefinite on a subspace," Linear Algebra Appl., vol. 109, pp. 115-130, 1988.
18. N. Krislock and H.Wolkowicz, "Euclidean distancematrices and applications," in Handbook of Semidefinite, Cone and PolynomialOptimization, M. Anjos and J. Lasserre, Eds. New York, NY, USA: Springer, 2010, pp. 879-914.
19. A. S. Lewis and M. L. Overton, "Nonsmooth optimization via quasi- Newton methods," Math. Program., to be published.
20. L. Liberti, C. Lavor, N. Maculan, and A. Mucherino, "Euclidean distance geometry and applications," SIAM Rev., to be published.
21. J. J. Moré, "Generalizations of the trust region problems," Optim. Methods Softw., vol. 2, pp. 189-209, 1993.
22. M. L. Overton, Matlab package HANSO: Hybrid algorithm for nonsmooth optimizatio. ver. 2.0.2 [Online]. Available: http://www.cs.nyu.edu/overton/ software/hanso/
23. H.-D. Qi, "A semismooth Newton method for the nearest Euclidean distance matrix problem," SIAM J. Matrix Anal. Appl., vol. 34, pp. 67-93, 2013.
24. H.-D. Qi and X. M. Yuan, "Computing the nearest Euclidean distance matrix with low embedding dimensions," School of Math., Univ. of. Southampton, Southampton, U.K., Sep. 2012.
25. P. Stoica and J. Li, "Source localization from range-difference measurements," IEEE Signal Process. Mag., vol. 23, pp. 63-69, 2006.
26. A. H. Sayed, A. Tarighat, and N. Khajehnouri, "Network-based wireless location," IEEE Signal Process. Mag., vol. 22, pp. 24-40, 2005.
27. I. J. Schoenberg, "Remarks to Maurice Fréchet's article "Sur la définition axiomatque d'une classe d'espaces vectoriels distanciés applicbles vectoriellement sur l'espace de Hilbet"," Ann. Math., vol. 36, pp. 724-732, 1935.
28. K. C. Toh, "An inexact path-following algorithm for convex quadratic SDP," Math. Program., vol. 112, pp. 221-254, 2008.
29. P. Tseng, "Second-order cone programming relaxation of sensor network localization," SIAM J. Optim., vol. 18, pp. 156-185, 2007. (Pubitemid 351271326)
30. G.Young and A. S. Householder, "Discussion of a set of points in terms of their mutual distances," Psychometrika, vol. 3, pp. 19-22, 1938.