Noisy Euclidean distance matrix completion with a single missing node

DOI10.1007/S10898-019-00825-7zbMATH Open1433.90108OpenAlexW2970165350MaRDI QIDQ2010104FDOQ2010104

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

Recommendations

• Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
• Sensor network localization, Euclidean distance matrix completions, and graph realization
• Explicit sensor network localization using semidefinite representations and facial reductions
• Localization from incomplete noisy distance measurements
• Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems

zbMATH Keywords

noisesemidefinite programminggeneralized trust region subproblemfacial reductionwireless communicationsingle source localizationEuclidean distance matrix completion

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Quadratic programming (90C20) Matrix completion problems (15A83) Semidefinite programming (90C22)

Cites Work

• Title not available (Why is that?)
• Benchmarking optimization software with performance profiles.
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Stable signal recovery from incomplete and inaccurate measurements
• Title not available (Why is that?)
• The generalized trust region subproblem
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• Euclidean Distance Geometry and Applications
• Title not available (Why is that?)
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Equality relating Euclidean distance cone to positive semidefinite cone
• Properties of Euclidean and non-Euclidean distance matrices
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Least Squares Algorithms for Time-of-Arrival-Based Mobile Location
• On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
• Polyhedral and semidefinite programming methods in combinatorial optimization
• Sensor network localization, Euclidean distance matrix completions, and graph realization
• Computing the nearest Euclidean distance matrix with low embedding dimensions
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• The cone of distance matrices
• Exact and Approximate Solutions of Source Localization Problems
• Euclidean Distance Matrices and Applications
• A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem
• Title not available (Why is that?)
• Iterative Minimization Schemes for Solving the Single Source Localization Problem
• Euclidean distance matrix completion problems
• Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
• Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
• Trust Region Problems and Nonsymmetric Eigenvalue Perturbations
• Euclidean Distance Matrices and Their Applications in Rigidity Theory

Cited In (1)

• A facial reduction approach for the single source localization problem

This page was built for publication: Noisy Euclidean distance matrix completion with a single missing node

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010104)