Noisy Euclidean distance matrix completion with a single missing node
type: Item
instance of: scholarly article
title: Noisy Euclidean distance matrix completion with a single missing node
zbMATH Open document ID: 1433.90108
author: Stefan Sremac
author: Fei Wang
author: Henry Wolkowicz
author: Lucas Pettersson
published in: Journal of Global Optimization
publication date: 2019-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 15A83
Mathematics Subject Classification ID: 62P30
zbMATH DE Number: 7139389
zbMATH Keywords: single source localization
zbMATH Keywords: noise
zbMATH Keywords: Euclidean distance matrix completion
zbMATH Keywords: semidefinite programming
zbMATH Keywords: wireless communication
zbMATH Keywords: facial reduction
zbMATH Keywords: generalized trust region subproblem
MaRDI profile type: Publication
full work available at URL: s10898-019-00825-7
OpenAlex ID: W2970165350
cites work: Euclidean Distance Matrices and Their Applications in Rigidity Theory
cites work: Solving Euclidean distance matrix completion problems via semidefinite progrmming
cites work: Exact and Approximate Solutions of Source Localization Problems
cites work: Iterative Minimization Schemes for Solving the Single Source Localization Problem
cites work: Stable signal recovery from incomplete and inaccurate measurements
cites work: Least Squares Algorithms for Time-of-Arrival-Based Mobile Location
cites work: Q5461825
cites work: Q3793551
cites work: Equality relating Euclidean distance cone to positive semidefinite cone
cites work: Sensor network localization, Euclidean distance matrix completions, and graph realization
cites work: Benchmarking optimization software with performance profiles.
cites work: Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
cites work: Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
cites work: Euclidean distance matrix completion problems
cites work: Q5689624
cites work: Properties of Euclidean and non-Euclidean distance matrices
cites work: The cone of distance matrices
cites work: Q4273942
cites work: Euclidean Distance Matrices and Applications
cites work: Euclidean Distance Geometry and Applications
cites work: On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
cites work: The generalized trust region subproblem
cites work: A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem
cites work: Computing the nearest Euclidean distance matrix with low embedding dimensions
cites work: Trust Region Problems and Nonsymmetric Eigenvalue Perturbations
cites work: Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications
cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
cites work: Polyhedral and semidefinite programming methods in combinatorial optimization
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
DOI: 10.1007/S10898-019-00825-7
description: scientific article; zbMATH DE number 7139389