Iterative minimization schemes for solving the single source localization problem

SIAM Journal on Optimization

Volumn 19, Issue 3, 2008, Pages 1397-1416

  Beck, Amir ^a   Teboulle, Marc ^b   Chikishev, Zahar ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Fixed point methods; Generalized trust region; Nonlinear least squares; Nonsmooth and nonconvex minimization; Semidefinite relaxation; Single source location problem; Weiszfield algorithm

Indexed keywords

FIXED-POINT METHODS; GENERALIZED TRUST REGION; NONLINEAR LEAST SQUARES; NONSMOOTH AND NONCONVEX MINIMIZATION; SEMIDEFINITE RELAXATION; SINGLE SOURCE LOCATION PROBLEM; WEISZFIELD ALGORITHM;

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; LOCATION; MAXIMUM LIKELIHOOD ESTIMATION; OPTIMIZATION;

PROBLEM SOLVING;

EID: 69749088560     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/070698014     Document Type: Article

References (17)

1. A. Beck, P. Stoica, and J. Li, Exact and approximate solutions of source localization problems, IEEE Trans. Signal Process., 56 (2008), pp. 1770-1778.
2. D. P. Bertsekas, Nonlinear Programming, 2nd ed., Athena Scientific, Belmont, MA, 1999.
3. P. Biswas, T. C. Lian, T. C. Wang, and Y. Ye, Semidefinite programming based algorithms for sensor network localization, ACM Trans. Sen. Netw., 2 (2006), pp. 188-220.
4. K. W. Cheung, W. K. Ma, and H. C. So, Accurate approximation algorithm for TOA-based maximum likelihood mobile location using semidefinite programming, in Proceedings of the ICASSP, Vol. 2, 2004, pp. 145-148.
5. K. W. Cheung, H. C. So, W. K. Ma, and Y. T. Chan, Least squares algorithms for time-ofarrival-based mobile location, IEEE Trans. Signal Process., 52 (2004), pp. 1121-1228.
6. C. Fortin and H. Wolkowicz, The trust region subproblem and semidefinite programming, Optim. Methods Softw., 19 (2004), pp. 41-67.
7. H. W. Kuhn, A note on Fermat's problem, Math. Program., 4 (1973), pp. 98-107.
8. J. J. Moré and D. C. Sorensen, Computing a trust region step, SIAM J. Sci. Stat. Comput., 4 (1983), pp. 553-572.
9. J. J. Moré, Generalizations of the trust region subproblem, Optim. Methods Softw., 2 (1993), pp. 189-209.
10. L. M. Ostresh, On the convergence of a class of iterative methods for solving the Weber location problem, Oper. Res., 26 (1978), pp. 597-609.
11. J. G. Morris, R. F. Love, and G. O. Wesolowsky, Facilities Location: Models and Methods, North-Holland, New York, 1988.
12. A. H. Sayed, A. Tarighat, and N. Khajehnouri, Network-based wireless location, IEEE Signal Proces. Mag., 22 (2005), pp. 24-40.
13. P. Stoica and J. Li, Source localization from range-difference measurements, IEEE Signal Process. Mag., 23 (2006), pp. 63-65, 69.
14. J. F. Sturm, Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones, Optim. Methods Softw., 11 12 (1999), pp. 625-653.
15. Y. Vardi and C. H. Zhang, A modified Weiszfield algorithm for the Fermat-Weber location problem, Math. Program. Ser. A, 90 (2001), pp. 559-566.
16. E. Weiszfeld, Sur le point pour lequel la somme des distances de n points donnés est minimum, Tohoku Math. J., 43 (1937), pp. 355-386.
17. http://www.fcc.gov/911/enhanced/.