The cone of distance matrices

DOI10.1016/0024-3795(91)90068-8zbMath0718.15011OpenAlexW2053254742MaRDI QIDQ2639130

Pablo Tarazaga, Wei-min Liu, Thomas L. Hayden, James H. Wells

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0024-3795(91)90068-8

zbMATH Keywords

positive semidefinite matricesEuclidean distance matrixembedding dimensioncone of matrices

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (24)

Spectral classification of convex cones ⋮ Application of cut polyhedra. I ⋮ Connections between the real positive semidefinite and distance matrix completion problems ⋮ On a positive semidefinite relaxation of the cut polytope ⋮ Circum-Euclidean distance matrices and faces ⋮ Nonlinear eigenvector algorithms for local optimization in multivariate data analysis ⋮ Finite metric spaces of strictly negative type ⋮ Sensor network localization, Euclidean distance matrix completions, and graph realization ⋮ Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier ⋮ On the uniqueness of Euclidean distance matrix completions. ⋮ Equality relating Euclidean distance cone to positive semidefinite cone ⋮ Majorization for the eigenvalues of Euclidean distance matrices ⋮ Graph rigidity via Euclidean distance matrices ⋮ Minimal Euclidean representations of graphs ⋮ Noisy Euclidean distance matrix completion with a single missing node ⋮ On the uniqueness of Euclidean distance matrix completions: the case of points in general position ⋮ A variance inequality ensuring that a pre-distance matrix is Euclidean ⋮ On (super-)spherical distance matrices and two results from Schoenberg ⋮ Euclidean Distance Matrices and Applications ⋮ A genetic algorithm for circulant Euclidean distance matrices ⋮ 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 ⋮ Coordinate Shadows of Semidefinite and Euclidean Distance Matrices ⋮ Distance matrices and regular figures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonmetric individual differences multidimensional scaling: An alternating least squares method with optimal scaling features
• Convergence of the majorization method for multidimensional scaling
• The theory and practice of distance geometry
• On the completely positive and positive-semidefinite-preserving cones
• The best Euclidean fit to a given distance matrix in prescribed dimensions
• Properties of Euclidean and non-Euclidean distance matrices
• Shortest-path problems and molecular conformation
• On certain linear mappings between inner-product and squared-distance matrices
• Approximation by matrices positive semidefinite on a subspace
• A cyclic projection algorithm via duality
• Theory of cones
• The embedding problem for predistance matrices
• Criteria for the global consistency of two-threshold preference relations in terms of forbidden subconfigurations
• On the cone of positive semidefinite matrices
• Cones of diagonally dominant matrices
• Positive operators and an inertia theorem
• An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix

This page was built for publication: The cone of distance matrices