Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints

DOI10.1007/s10589-011-9447-6zbMath1259.90089OpenAlexW2164916373WikidataQ57511237 ScholiaQ57511237MaRDI QIDQ694528

Ting Kei Pong

Publication date: 12 December 2012

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-011-9447-6

zbMATH Keywords

error boundsemidefinite programming relaxationsensor network localizationcoordinate gradient descentlog-barrier

Mathematics Subject Classification ID

Semidefinite programming (90C22) Deterministic network models in operations research (90B10)

Related Items (2)

Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation ⋮ Robust Euclidean embedding via EDM optimization

Uses Software

• SeDuMi
• SFSDP
• SNLSDP

Cites Work

• Unnamed Item
• Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
• Sensor network localization, Euclidean distance matrix completions, and graph realization
• (Robust) edge-based semidefinite programming relaxation of sensor network localization
• Sum of squares method for sensor network localization
• Theory of semidefinite programming for sensor network localization
• Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
• Global Continuation for Distance Geometry Problems
• Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
• Algorithmic Aspects of Wireless Sensor Networks
• SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization
• Second‐Order Cone Programming Relaxation of Sensor Network Localization

This page was built for publication: Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints