Connections between the real positive semidefinite and distance matrix completion problems

DOI10.1016/0024-3795(95)00096-AzbMath0827.15032MaRDI QIDQ1894505

Charles R. Johnson, Pablo Tarazaga

Publication date: 17 December 1995

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

zbMATH Keywords

positive semidefinite matrixdistance matrix completionpartial symmetric matrix

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (24)

Better initial configurations for metric multidimensional scaling ⋮ On cell matrices: a class of Euclidean distance matrices ⋮ On Cartesian product of Euclidean distance matrices ⋮ Euclidean distance matrix completion problems ⋮ Phase retrieval of complex and vector-valued functions ⋮ Circum-Euclidean distance matrices and faces ⋮ Sensor network localization, Euclidean distance matrix completions, and graph realization ⋮ On Euclidean distance matrices ⋮ Generically globally rigid graphs have generic universally rigid frameworks ⋮ Hyperspherical embedding of graphs and networks in communicability spaces ⋮ The Euclidean distance completion problem: cycle completability ⋮ Characterization of multispherical and block structures of Euclidean distance matrices ⋮ Computing the nearest Euclidean distance matrix with low embedding dimensions ⋮ Majorization for the eigenvalues of Euclidean distance matrices ⋮ Graph rigidity via Euclidean distance matrices ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Moore-Penrose inverse of a Euclidean distance matrix ⋮ Multispherical Euclidean distance matrices ⋮ Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix ⋮ Euclidean Distance Matrices and Applications ⋮ The cell matrix closest to a given Euclidean distance matrix ⋮ Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree ⋮ Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming ⋮ Faces of the cone of Euclidean distance matrices: characterizations, structure and induced geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Positive definite completions of partial Hermitian matrices
• The best Euclidean fit to a given distance matrix in prescribed dimensions
• Properties of Euclidean and non-Euclidean distance matrices
• On certain linear mappings between inner-product and squared-distance matrices
• Approximation by matrices positive semidefinite on a subspace
• Positive definite completions and determinant maximization
• The real positive definite completion problem for a simple cycle
• Distance matrices and regular figures
• The cone of distance matrices
• Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
• The Euclidian Distance Matrix Completion Problem
• The Euclidean distance completion problem: cycle completability
• The real positive definite completion problem: cycle completability

This page was built for publication: Connections between the real positive semidefinite and distance matrix completion problems