Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
From MaRDI portal
Recommendations
- Comparing SOS and SDP relaxations of sensor network localization
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Semidefinite Programming for Sensor Network and Graph Localization
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- 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
Cited in
(25)- Exact SDP relaxations for quadratic programs with bipartite graph structures
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Rank-one matrix completion via high-rank matrices in sum-of-squares relaxations
- Comparing SOS and SDP relaxations of sensor network localization
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
- A block coordinate descent method for sensor network localization
- Selected open problems in discrete geometry and optimization
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Efficient Convex Relaxation Methods for Robust Target Localization by a Sensor Network Using Time Differences of Arrivals
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- A DC programming approach for sensor network localization with uncertainties in anchor positions
- A facial reduction approach for the single source localization problem
- 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
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- Geometric buildup algorithms for sensor network localization
- Euclidean distance matrices and applications
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
- Complexity of chordal conversion for sparse semidefinite programs with small treewidth
This page was built for publication: Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189557)
