Semidefinite Programming for Sensor Network and Graph Localization
DOI10.1007/0-387-28654-3_11zbMATH Open1155.90438OpenAlexW157874714MaRDI QIDQ3592852FDOQ3592852
Authors: Yinyu Ye 
Publication date: 24 September 2007
Published in: Robust Optimization-Directed Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/0-387-28654-3_11
Recommendations
- Theory of semidefinite programming for sensor network localization
- Theory of semidefinite programming for sensor network localization
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Explicit sensor network localization using semidefinite representations and facial reductions
- Sensor network localization, Euclidean distance matrix completions, and graph realization
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (21)
- Explicit sensor network localization using semidefinite representations and facial reductions
- Conditions for correct sensor network localization using SDP relaxation
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
- A continuation method for large-sized sensor network localization problems
- A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization
- Nodes locating algorithm based on local semi-definite programming for large scale wireless sensor networks
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- A DC programming approach for sensor network localization with uncertainties in anchor positions
- Multiscale semidefinite programming approach to positioning problems with pairwise structure
- Solving the ad hoc wireless sensor network localization problem with sum of squares method
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Localization from incomplete noisy distance measurements
- Theory of semidefinite programming for sensor network localization
- Semi-definite programming based approaches for real-time tractor localization in port container terminals
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Global registration of multiple point clouds using semidefinite programming
- Theory of semidefinite programming for sensor network localization
This page was built for publication: Semidefinite Programming for Sensor Network and Graph Localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3592852)
