Second‐Order Cone Programming Relaxation of Sensor Network Localization
- 1 January 2007
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 18 (1), 156-185
- https://doi.org/10.1137/050640308
Abstract
The sensor network localization problem has been much studied. Recently Biswas and Ye proposed a semidefinite programming (SDP) relaxation of this problem which has various nice properties and for which a number of solution methods have been proposed. Here, we study a second-order cone programming (SOCP) relaxation of this problem, motivated by its simpler structure and its potential to be solved faster than SDP. We show that the SOCP relaxation, though weaker than the SDP relaxation, has nice properties that make it useful as a problem preprocessor. In particular, sensors that are uniquely positioned among interior solutions of the SOCP relaxation are accurate up to the square root of the distance error. Thus, these sensors, which are easily identified, are accurately positioned. In our numerical simulation, the interior solution found can accurately position up to 80-90% of the sensors. We also propose a smoothing coordinate gradient descent method for finding an interior solution that is faster than an interior-point method.Keywords
This publication has 12 references indexed in Scilit:
- Asymptotic behavior of the central path for a special class of degenerate SDP problemsMathematical Programming, 2004
- Second Order Cone Programming Relaxation of a Positive Semidefinite ConstraintOptimization Methods and Software, 2003
- Geographic routing without location informationPublished by Association for Computing Machinery (ACM) ,2003
- ForewordMathematical Programming, 2003
- Second-order cone programmingMathematical Programming, 2003
- Graph rigidity via Euclidean distance matricesLinear Algebra and its Applications, 2000
- An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow ProblemsSIAM Journal on Optimization, 1997
- Global Continuation for Distance Geometry ProblemsSIAM Journal on Optimization, 1997
- Extension of Hoffman’s Error Bound to Polynomial SystemsSIAM Journal on Optimization, 1994
- Global error bounds for convex quadratic inequality systems*Optimization, 1994