Second‐Order Cone Programming Relaxation of Sensor Network Localization
From MaRDI portal
Recommendations
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Theory of semidefinite programming for sensor network localization
- Semidefinite Programming for Sensor Network and Graph Localization
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Explicit sensor network localization using semidefinite representations and facial reductions
Cited in
(29)- Optimality conditions and optimization methods for quartic polynomial optimization
- Asynchronous distributed localization in networks with communication delays and packet losses
- 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
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction
- Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
- 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
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- A feasible method for sensor network localization
- An inexact augmented Lagrangian method for second-order cone programming with applications
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Localization in wireless sensor networks: classification and evaluation of techniques
- Distributed localization of wireless sensor network using communication wheel
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Hessian barrier algorithms for non-convex conic optimization
- Distributed nonlinear conic optimization with partially separable structure
- A trust region SQP-filter method for nonlinear second-order cone programming
- Comparing SOS and SDP relaxations of sensor network localization
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
- Set-membership localization via range measurements
- Bilevel programming optimization of floorplanning layout based on memristive reinforcement learning with strategy of neurodynamic estimate
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Sum of squares method for sensor network localization
This page was built for publication: Second‐Order Cone Programming Relaxation of Sensor Network Localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5444286)
