Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
From MaRDI portal
Recommendations
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Semidefinite Programming for Sensor Network and Graph Localization
- Comparing SOS and SDP relaxations of sensor network localization
- Conditions for correct sensor network localization using SDP relaxation
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
Cited in
(36)- Accurate time delay estimation based passive localization
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- Visualizing data as objects by DC (difference of convex) optimization
- Geometric buildup algorithms for sensor network localization
- A block coordinate descent method for sensor network localization
- Optimization and operations research in mitigation of a pandemic
- Robust Euclidean embedding via EDM optimization
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
- A DC programming approach for sensor network localization with uncertainties in anchor positions
- Euclidean distance matrices and applications
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- Optimal partial discretization orders for discretizable distance geometry
- Conditions for correct sensor network localization using SDP relaxation
- Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Efficient Convex Relaxation Methods for Robust Target Localization by a Sensor Network Using Time Differences of Arrivals
- Semidefinite Programming Approach for Range-Difference Based Source Localization
- Sensor Selection in Distributed Multiple-Radar Architectures for Localization: A Knapsack Problem Formulation
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- On the exact solution of the distance geometry with interval distances in dimension 1
- A continuation method for large-sized sensor network localization problems
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Localization in wireless sensor networks: classification and evaluation of techniques
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Least-squares approximations in geometric buildup for solving distance geometry problems
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Loraine – an interior-point solver for low-rank semidefinite programming
- Distributed nonlinear conic optimization with partially separable structure
- Comparing SOS and SDP relaxations of sensor network localization
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
- On bar frameworks, stress matrices and semidefinite programming
- Multi-agent discrete-time circular formation control with moving distance constraints
- Sum of squares method for sensor network localization
- Semidefinite programming for approximate maximum likelihood sinusoidal parameter estimation
This page was built for publication: Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629511)
