Sensor Network Localization, Euclidean Distance Matrix completions, and graph realization
- 19 November 2008
- journal article
- Published by Springer Science and Business Media LLC in Optimization and Engineering
- Vol. 11 (1), 45-66
- https://doi.org/10.1007/s11081-008-9072-0
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic ConstraintsSIAM Journal on Optimization, 2007
- Semidefinite Programming Approaches for Sensor Network Localization With Noisy Distance MeasurementsIEEE Transactions on Automation Science and Engineering, 2006
- A Distributed Method for Solving Semidefinite Programs Arising from Ad Hoc Wireless Sensor Network LocalizationPublished by Springer Science and Business Media LLC ,2006
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programmingLinear Algebra and its Applications, 2005
- Semidefinite programming for ad hoc wireless sensor network localizationPublished by Association for Computing Machinery (ACM) ,2004
- Local results for the Gauss-Newton method on constrained rank-deficient nonlinear least squaresMathematics of Computation, 2003
- Solving Euclidean Distance Matrix Completion Problems Via Semidefinite ProgrammingComputational Optimization and Applications, 1999
- A tour d’horizon on positive semidefinite and Euclidean distance matrix completion problemsPublished by American Mathematical Society (AMS) ,1998
- The Euclidian Distance Matrix Completion ProblemSIAM Journal on Matrix Analysis and Applications, 1995
- Facial reduction for a cone-convex programming problemJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1980