Comparing SOS and SDP relaxations of sensor network localization
We investigate the relationships between various sum of squares (SOS) and semidefinite programming (SDP) relaxations for the sensor network localization problem. In particular, we show that Biswas and Ye’s SDP relaxation is equivalent to the degree one SOS relaxation of Kim et al. We also show that Nie’s sparse-SOS relaxation is stronger than the edge-based semidefinite programming (ESDP) relaxation, and that the trace test for accuracy, which is very useful for SDP and ESDP relaxations, can be extended to the sparse-SOS relaxation. Copyright Springer Science+Business Media, LLC 2012
Volume (Year): 52 (2012)
Issue (Month): 3 (July)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/math/journal/10589|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Jiawang Nie, 2009. "Sum of squares method for sensor network localization," Computational Optimization and Applications, Springer, vol. 43(2), pages 151-179, June.
When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:52:y:2012:i:3:p:609-627. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.