Theory of semidefinite programming for sensor network localization
From MaRDI portal
Recommendations
- Theory of semidefinite programming for sensor network localization
- Semidefinite Programming for Sensor Network and Graph Localization
- A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization
- Explicit sensor network localization using semidefinite representations and facial reductions
- Sensor network localization, Euclidean distance matrix completions, and graph realization
Cites work
- scientific article; zbMATH DE number 501471 (Why is no real title available?)
- scientific article; zbMATH DE number 2079367 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- Algorithmic Aspects of Wireless Sensor Networks
- Conditions for Unique Graph Realizations
- Connected rigidity matroids and unique realizations of graphs
- Convergence behavior of interior-point algorithms
- Distance matrix completion by numerical optimization
- Extensions of classical multidimensional scaling via variable reduction
- Global Continuation for Distance Geometry Problems
- Graph rigidity via Euclidean distance matrices
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior Point Trajectories in Semidefinite Programming
- Linear Matrix Inequalities in System and Control Theory
- Low-dimensional embedding with extra information
- Multidimensional scaling. I: Theory and method
- On rigidity and realizability of weighted graphs
- Problems of distance geometry and convex properties of quadratic maps
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Some distance properties of latent root and vector methods used in multivariate analysis
- The Molecule Problem: Exploiting Structure in Global Optimization
- The geometry of graphs and some of its algorithmic applications
- Two theorems on Euclidean distance matrices and Gale transform
Cited in
(89)- Stability of sequential lateration and of stress minimization in the presence of noise
- Global registration of multiple point clouds using semidefinite programming
- Exact SDP relaxations for quadratic programs with bipartite graph structures
- Covariate-assisted matrix completion with multiple structural breaks
- Explicit sensor network localization using semidefinite representations and facial reductions
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Conditions for correct sensor network localization using SDP relaxation
- An adaptation for iterative structured matrix completion
- Characterizing the universal rigidity of generic frameworks
- Retracting Graphs to Cycles
- Sequential localization of sensor networks
- A Riemannian dimension-reduced second-order method with application in sensor network localization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Recent advances on the interval distance geometry problem
- Comparing SOS and SDP relaxations of sensor network localization
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
- Algorithmic Aspects of Wireless Sensor Networks
- The SDP-based algorithm for localization problem in wireless sensor networks
- A block coordinate descent method for sensor network localization
- A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization
- Exact recovery with symmetries for procrustes matching
- A feasible method for sensor network localization
- Sensitivity of low-rank matrix recovery
- A penalty method for rank minimization problems in symmetric matrices
- Diagonally dominant programming in distance geometry
- Matrix completion and decomposition in phase-bounded cones
- The discretizable molecular distance geometry problem
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Selected open problems in discrete geometry and optimization
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Semidefinite Programming for Sensor Network and Graph Localization
- Visualizing data as objects by DC (difference of convex) optimization
- Molecular distance geometry methods: from continuous to discrete
- Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
- Single-cell 3D genome reconstruction in the haploid setting using rigidity theory
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- Six mathematical gems from the history of distance geometry
- Exact matrix completion via convex optimization
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Mathematical programming techniques for sensor networks
- Sum of squares method for sensor network localization
- Characterizing the universal rigidity of generic tensegrities
- Spectrally constrained optimization
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- A DC programming approach for sensor network localization with uncertainties in anchor positions
- On the efficiency of routing in sensor networks
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting
- Perturbation bounds for procrustes, classical scaling, and trilateration, with applications to manifold learning
- Robust low-rank matrix completion by Riemannian optimization
- Distributed nonlinear conic optimization with partially separable structure
- Multiscale semidefinite programming approach to positioning problems with pairwise structure
- Generically globally rigid graphs have generic universally rigid frameworks
- A facial reduction approach for the single source localization problem
- Global optimization approaches to sensor placement: model versions and illustrative results
- A note on probably certifiably correct algorithms
- Discretization orders for distance geometry problems
- Realizable dimension of periodic frameworks
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
- Phase retrieval via sensor network localization
- Least-squares approximations in geometric buildup for solving distance geometry problems
- Formal theory of noisy sensor network localization
- Dealing with missing information in data envelopment analysis by means of low-rank matrix completion
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- scientific article; zbMATH DE number 6896614 (Why is no real title available?)
- Localization from incomplete noisy distance measurements
- Hilbert mobile beacon for localisation and coverage in sensor networks
- An approximation theory of matrix rank minimization and its application to quadratic equations
- Euclidean distance matrices and applications
- Algorithmic aspects of sensor localization
- Distributed localization with mixed measurements under switching topologies
- Sensor network localization on the group of three-dimensional displacements
- Loraine – an interior-point solver for low-rank semidefinite programming
- Theory of semidefinite programming for sensor network localization
- Arithmetic modeling of random processes and \(r\)-algorithms
- Semi-definite programming based approaches for real-time tractor localization in port container terminals
- Semidefinite Programming Approach for Range-Difference Based Source Localization
- Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
- Stable camera motion estimation using convex programming
- Universal rigidity of complete bipartite graphs
- The discretizable distance geometry problem
- Truncated sparse approximation property and truncated \(q\)-norm minimization
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Exact matrix completion based on low rank Hankel structure in the Fourier domain
- Algorithm 1055: HDSDP: software for semidefinite programming
- On bar frameworks, stress matrices and semidefinite programming
- Global strong convexity and characterization of critical points of time-of-arrival-based source localization
- Approximation Newton method for low-rank matrix completion
This page was built for publication: Theory of semidefinite programming for sensor network localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868476)
