Comparing SOS and SDP relaxations of sensor network localization
From MaRDI portal
Publication:694515
DOI10.1007/s10589-011-9431-1zbMath1259.90063OpenAlexW2022620382WikidataQ57511245 ScholiaQ57511245MaRDI QIDQ694515
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-9431-1
semidefinite programming relaxationsensor network localizationsum of squares relaxationindividual trace
Semidefinite programming (90C22) Continuous location (90B85) Deterministic network models in operations research (90B10)
Related Items (2)
Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation ⋮ Selected Open Problems in Discrete Geometry and Optimization
Uses Software
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
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Sum of squares method for sensor network localization
- Theory of semidefinite programming for sensor network localization
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- 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: Comparing SOS and SDP relaxations of sensor network localization
