Semidefinite Programming for Sensor Network and Graph Localization
From MaRDI portal
Publication:3592852
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
Cited in
(21)- Theory of semidefinite programming for sensor network localization
- Global registration of multiple point clouds using semidefinite programming
- 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
- Localization from incomplete noisy distance measurements
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- 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
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)