Semidefinite Programming for GPS

Ning Wang and Liuqing Yang

Abstract:	As a powerful tool to convert non-convex problems into convex ones, semidefinite programming (SDP) has been introduced to both cooperative and non-cooperative positioning systems. In this paper, we propose an SDP approach to solve GPS problems. Compared with conventional algorithms, the SDP approach has an overall improved performance in terms of both accuracy and efficiency. Besides, as a global optimization technique, SDP does not require any smart initial values and can avoid local minima. Simulations will be carried out to corroborate our analyses and comparisons.
Published in:	Proceedings of the 24th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS 2011) September 20 - 23, 2011 Oregon Convention Center, Portland, Oregon Portland, OR
Pages:	2120 - 2126
Cite this article:	Wang, Ning, Yang, Liuqing, "Semidefinite Programming for GPS," Proceedings of the 24th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS 2011), Portland, OR, September 2011, pp. 2120-2126.
Full Paper:	ION Members/Non-Members: 1 Download Credit Sign In