Uniqueness of the solutions of some completion problems
From MaRDI portal
Recommendations
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position
- The positive definite completion problem revisited
- Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
- Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems
- The Euclidian Distance Matrix Completion Problem
Cites work
- scientific article; zbMATH DE number 4158856 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- Handbook of semidefinite programming. Theory, algorithms, and applications
- On certain linear mappings between inner-product and squared-distance matrices
- On the uniqueness of Euclidean distance matrix completions.
- Semi-Definite Matrix Constraints in Optimization
Cited in
(3)
This page was built for publication: Uniqueness of the solutions of some completion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887497)