Comparing SOS and SDP relaxations of sensor network localization
DOI10.1007/S10589-011-9431-1zbMATH Open1259.90063DBLPjournals/coap/GouveiaP12OpenAlexW2022620382WikidataQ57511245 ScholiaQ57511245MaRDI QIDQ694515FDOQ694515
Authors: João Gouveia, 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-9431-1
Recommendations
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Conditions for correct sensor network localization using SDP relaxation
- Sum of squares method for sensor network localization
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
sensor network localizationsemidefinite programming relaxationindividual tracesum of squares relaxation
Deterministic network models in operations research (90B10) Semidefinite programming (90C22) Continuous location (90B85)
Cites Work
- Explicit sensor network localization using semidefinite representations and facial reductions
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Sum of squares method for sensor network localization
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Theory of semidefinite programming for sensor network localization
- SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
Cited In (6)
- Selected open problems in discrete geometry and optimization
- Efficient Convex Relaxation Methods for Robust Target Localization by a Sensor Network Using Time Differences of Arrivals
- Sum of squares method for sensor network localization
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
Uses Software
This page was built for publication: Comparing SOS and SDP relaxations of sensor network localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694515)
