Noisy Euclidean distance matrix completion with a single missing node
From MaRDI portal
Publication:2010104
DOI10.1007/s10898-019-00825-7zbMath1433.90108OpenAlexW2970165350MaRDI QIDQ2010104
Fei Wang, Lucas Pettersson, Stefan Sremac, Henry Wolkowicz
Publication date: 3 December 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00825-7
noisesemidefinite programmingwireless communicationgeneralized trust region subproblemfacial reductionsingle source localizationEuclidean distance matrix completion
Applications of statistics in engineering and industry; control charts (62P30) Semidefinite programming (90C22) Quadratic programming (90C20) Matrix completion problems (15A83)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- The generalized trust region subproblem
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Equality relating Euclidean distance cone to positive semidefinite cone
- Properties of Euclidean and non-Euclidean distance matrices
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The cone of distance matrices
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Euclidean Distance Matrices and Applications
- Iterative Minimization Schemes for Solving the Single Source Localization Problem
- Trust Region Problems and Nonsymmetric Eigenvalue Perturbations
- Euclidean Distance Matrices and Their Applications in Rigidity Theory
- Exact and Approximate Solutions of Source Localization Problems
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Euclidean distance matrix completion problems
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
- A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem
- Least Squares Algorithms for Time-of-Arrival-Based Mobile Location
- Euclidean Distance Geometry and Applications
- Stable signal recovery from incomplete and inaccurate measurements
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Benchmarking optimization software with performance profiles.
