Conditions for Correct Sensor Network Localization Using SDP Relaxation

DOI10.1007/978-3-319-00200-2_16zbMath1277.90095arXiv1010.2262OpenAlexW2120276394MaRDI QIDQ2849004

Nicole Taheri, Davood Shamsi, Yinyu Ye, Zhisu Zhu

Publication date: 13 September 2013

Published in: Discrete Geometry and Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.2262

zbMATH Keywords

semidefinite programminggraph realizationsensor network localization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of mathematical programming (90C90) Optimality conditions and duality in mathematical programming (90C46) Communication networks in operations research (90B18)

Related Items (2)

Localization from incomplete noisy distance measurements ⋮ Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs

This page was built for publication: Conditions for Correct Sensor Network Localization Using SDP Relaxation