Change search
Link to record
Permanent link

Direct link
BETA
Publications (1 of 1) Show all publications
Sremac, S., Wang, F., Wolkowicz, H. & Pettersson, L. (2019). Noisy Euclidean Distance Matrix Completion with a Single Missing Node. Journal of Global Optimization
Open this publication in new window or tab >>Noisy Euclidean Distance Matrix Completion with a Single Missing Node
2019 (English)In: Journal of Global Optimization, ISSN 0925-5001, E-ISSN 1573-2916Article in journal (Refereed) Submitted
Abstract [en]

We present several solution techniques for the noisy single source localization problem, i.e. the Euclidean distance matrix completion problem with a single missing node to locate under noisy data. For the case that the sensor locations are fixed, we show that this problem is implicitly convex, and we provide a purification algorithm along with the SDP relaxation to solve it efficiently and accurately. For the case that the sensor locations are relaxed, we study a model based on facial reduction. We present several approaches to solve this problem efficiently, and we compare their performance with existing techniques in the literature. Our tools are semidefinite programming, Euclidean distance matrices, facial reduction, and the generalized trust region subproblem. We include extensive numerical tests.

National Category
Natural Sciences
Identifiers
urn:nbn:se:kth:diva-247942 (URN)10.1007/s10898-019-00825-7 (DOI)000496694500004 ()2-s2.0-85071485649 (Scopus ID)
Note

QS 20190403

Available from: 2019-03-28 Created: 2019-03-28 Last updated: 2019-12-19Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0001-8978-5649

Search in DiVA

Show all publications