Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization

DOI10.1137/060669395zbMath1173.90498OpenAlexW2065569293WikidataQ90326127 ScholiaQ90326127MaRDI QIDQ3629511

Song Zheng, Yinyu Ye, Zizhuo Wang, Stephen P. Boyd

Publication date: 27 May 2009

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2d771ef487aaa762c828d1ce41029facd050f7da

zbMATH Keywords

semidefinite programmingchordal graphsecond-order cone programmingprincipal submatrixsensor network localization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Numerical methods of relaxation type (49M20)

Related Items (26)

A block coordinate descent method for sensor network localization ⋮ Optimization and operations research in mitigation of a pandemic ⋮ Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation ⋮ Sensor network localization, Euclidean distance matrix completions, and graph realization ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier ⋮ A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem ⋮ Least-squares approximations in geometric buildup for solving distance geometry problems ⋮ On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1 ⋮ A DC programming approach for sensor network localization with uncertainties in anchor positions ⋮ Geometric buildup algorithms for sensor network localization ⋮ (Robust) edge-based semidefinite programming relaxation of sensor network localization ⋮ Robust Euclidean embedding via EDM optimization ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures ⋮ Localization in wireless sensor networks: Classification and evaluation of techniques ⋮ Visualizing data as objects by DC (difference of convex) optimization ⋮ Comparing SOS and SDP relaxations of sensor network localization ⋮ Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints ⋮ Semidefinite programming for approximate maximum likelihood sinusoidal parameter estimation ⋮ Exploiting Sparsity in SDP Relaxation for Sensor Network Localization ⋮ On bar frameworks, stress matrices and semidefinite programming ⋮ Euclidean Distance Matrices and Applications ⋮ On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications ⋮ Loraine – an interior-point solver for low-rank semidefinite programming ⋮ Optimal partial discretization orders for discretizable distance geometry ⋮ Accurate time delay estimation based passive localization

Uses Software

• SeDuMi
• COL
• SNLSDP

This page was built for publication: Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization