Noisy Euclidean distance matrix completion with a single missing node

DOI10.1007/S10898-019-00825-7MaRDI QIDQ2010104zbMATH OpenOpenAlexFDO

Authors Stefan Sremac, Fei Wang, Henry Wolkowicz, Lucas Pettersson

Publication date 3 December 2019

Published in Journal of Global Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10898-019-00825-7

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)

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

Cites work

• scientific article; zbMATH DE number 4058669 (Why is no real title available?)
• scientific article; zbMATH DE number 477581 (Why is no real title available?)
• scientific article; zbMATH DE number 2188749 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A semismooth Newton method for the nearest Euclidean distance matrix problem
• Benchmarking optimization software with performance profiles.
• Computing the nearest Euclidean distance matrix with low embedding dimensions
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Coordinate shadows of semidefinite and Euclidean distance matrices
• Equality relating Euclidean distance cone to positive semidefinite cone
• Euclidean distance geometry and applications
• Euclidean distance matrices and applications
• Euclidean distance matrices and their applications in rigidity theory
• Euclidean distance matrix completion problems
• Exact and Approximate Solutions of Source Localization Problems
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• Iterative Minimization Schemes for Solving the Single Source Localization Problem
• Least Squares Algorithms for Time-of-Arrival-Based Mobile Location
• Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
• On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
• Polyhedral and semidefinite programming methods in combinatorial optimization
• Properties of Euclidean and non-Euclidean distance matrices
• Sensor network localization, Euclidean distance matrix completions, and graph realization
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• Stable signal recovery from incomplete and inaccurate measurements
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• The cone of distance matrices
• The generalized trust region subproblem
• Trust Region Problems and Nonsymmetric Eigenvalue Perturbations

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)