Sum of squares method for sensor network localization
From MaRDI portal
Publication:839485
DOI10.1007/S10589-007-9131-ZzbMATH Open1170.90510arXivmath/0605652OpenAlexW2070503827MaRDI QIDQ839485FDOQ839485
Authors: Jiawang Nie 
Publication date: 2 September 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Abstract: This paper has been withdrawn by the author due to its publication
Full work available at URL: https://arxiv.org/abs/math/0605652
Recommendations
- Comparing SOS and SDP relaxations of sensor network localization
- Solving the ad hoc wireless sensor network localization problem with sum of squares method
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
sensor network localizationerror boundpolynomialsdistance geometrygraph realizationsum of squares (SOS)semidefinite program (SDP)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- GloptiPoly
- Semidefinite programming relaxations for semialgebraic problems
- Symmetry groups, semidefinite programs, and sums of squares
- Minimizing polynomials via sum of squares over the gradient ideal
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Handbook of semidefinite programming. Theory, algorithms, and applications
- SOSTOOLS and Its Control Applications
- The truncated complex $K$-moment problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global Continuation for Distance Geometry Problems
- Extremal psd forms with few terms
- Sparsity in sums of squares of polynomials
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Theory of semidefinite programming for sensor network localization
- Algorithmic Aspects of Wireless Sensor Networks
- Exploiting Algebraic Structure in Sum of Squares Programs
Cited In (25)
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- 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
- A feasible method for sensor network localization
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- The moment-SOS hierarchy: applications and related topics
- Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- 3D genome reconstruction from partially phased Hi-C data
- Multiscale semidefinite programming approach to positioning problems with pairwise structure
- Solving the ad hoc wireless sensor network localization problem with sum of squares method
- QUAD: quadrant-based relative location estimates for representative topologies in wireless sensor networks
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
- Completely positive reformulations for polynomial optimization
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- Geometric buildup algorithms for sensor network localization
- Euclidean distance matrices and applications
- Further results on sum-of-squares tensors
- Identifying 3D Genome Organization in Diploid Organisms via Euclidean Distance Geometry
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- Global strong convexity and characterization of critical points of time-of-arrival-based source localization
- Optimality conditions and optimization methods for quartic polynomial optimization
Uses Software
This page was built for publication: Sum of squares method for sensor network localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839485)
