Uniqueness of the solutions of some completion problems

DOI10.1016/J.LAA.2004.06.002MaRDI QIDQ1887497zbMATH OpenOpenAlexFDO

Authors Chi-Kwong Li, Thomas Milligan

Publication date 26 November 2004

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2004.06.002

zbMATH Keywords

algorithmcompletion problemscontractive matrixEuclidean square distance matrixnumerical examplespositive semi-definite matrixsemi-definite programming

Mathematics Subject Classification ID

Inverse problems in linear algebra (15A29) Positive matrices and their generalizations; cones of matrices (15B48) General theory of distance geometry (51K05) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Review text

The authors determine conditions for uniqueness of the solutions of several completion problems (positive semi-definite completion, distance matrix completion, contractive matrix completion), that depend on the existence of a positive semi-definite matrix satisfying certain linear constraints. An algorithm is given to check these conditions numerically. The theory is illustrated via several numerical examples.

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

• Handbook of semidefinite programming. Theory, algorithms, and applications
• scientific article; zbMATH DE number 4158856 (Why is no real title available?)
• scientific article; zbMATH DE number 3080144 (Why is no real title available?)
• 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)

• Uniqueness of completions and related topics
• A note on completing quasi-distance and distance matrices
• On the solvability of derived matrix problems, including completions and duals

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)