Second‐Order Cone Programming Relaxation of Sensor Network Localization
From MaRDI portal
Publication:5444286
DOI10.1137/050640308zbMath1176.90454OpenAlexW2009271970MaRDI QIDQ5444286
Publication date: 25 February 2008
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050640308
approximation algorithmerror boundsensor network localizationsemidefinite programsecond-order cone program
Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A block coordinate descent method for sensor network localization, Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction, Sum of squares method for sensor network localization, Optimality conditions and optimization methods for quartic polynomial optimization, Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems, 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 DC programming approach for sensor network localization with uncertainties in anchor positions, Geometric buildup algorithms for sensor network localization, Asynchronous distributed localization in networks with communication delays and packet losses, (Robust) edge-based semidefinite programming relaxation of sensor network localization, Localization in wireless sensor networks: Classification and evaluation of techniques, Visualizing data as objects by DC (difference of convex) optimization, Global optimization of general nonconvex problems with intermediate polynomial substructures, 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, Euclidean Distance Matrices and Applications, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, Distributed localization of wireless sensor network using communication wheel, An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications
Uses Software
