TY - GEN
T1 - Semidefinite programming for GPS
AU - Wang, Ning
AU - Yang, Liuqing
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
KW - Global Positioning System (GPS)
KW - Semidefinite Programming (SDP)
UR - http://www.scopus.com/inward/record.url?scp=84861376242&partnerID=8YFLogxK
M3 - Conference Paper published in a book
AN - SCOPUS:84861376242
SN - 9781618394750
T3 - 24th International Technical Meeting of the Satellite Division of the Institute of Navigation 2011, ION GNSS 2011
SP - 2120
EP - 2126
BT - 24th International Technical Meeting of the Satellite Division of the Institute of Navigation 2011, ION GNSS 2011
T2 - 24th International Technical Meeting of the Satellite Division of the Institute of Navigation 2011, ION GNSS 2011
Y2 - 19 September 2011 through 23 September 2011
ER -