The Euclidian Distance Matrix Completion Problem

DOI10.1137/S0895479893249757MaRDI QIDQ4835417zbMATH OpenOpenAlexFDO

Authors Mihály Bakonyi, Charles R. Johnson

Publication date 5 November 1995

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895479893249757

zbMATH Keywords

chordal graphcompletion of partial Euclidean distance matricesdistance matrix completionsmolecular mapping problempositive semidefinite completionundirected graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Canonical forms, reductions, classification (15A21)

Recommendations

• The Euclidean distance completion problem: cycle completability
• 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
• On the uniqueness of Euclidean distance matrix completions: the case of points in general position
• Connections between the real positive semidefinite and distance matrix completion problems

Cited in

(41)

• Structural conditions for cycle completable graphs
• Positive definite completions and determinant maximization
• Matrix sandwich problems
• Cuts, matrix completions and graph rigidity
• A connection between positive semidefinite and Euclidean distance matrix completion problems
• On the uniqueness of Euclidean distance matrix completions.
• Matrix completions and chordal graphs
• Distance matrix completion by numerical optimization
• On the uniqueness of Euclidean distance matrix completions: the case of points in general position
• Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
• Uniqueness of the solutions of some completion problems
• Connections between the real positive semidefinite and distance matrix completion problems
• The positive definite completion problem relative to a subspace
• On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
• Central limit theorems for classical multidimensional scaling
• A note on completing quasi-distance and distance matrices
• Matrix estimation by universal singular value thresholding
• Matrix completions for linear matrix equations
• Molecular conformation search by distance matrix perturbations
• Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems
• Euclidean distance matrices and applications
• A Lipschitzian error bound for convex quadratic symmetric cone programming
• Decomposition methods for sparse matrix nearness problems
• Sensor network localization, Euclidean distance matrix completions, and graph realization
• On a relationship between graph realizability and distance matrix completion
• Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree
• scientific article; zbMATH DE number 2096339 (Why is no real title available?)
• The Euclidean distance completion problem: cycle completability
• Bicompletions of distance matrices
• Euclidean distance matrix completion problems
• Coordinate shadows of semidefinite and Euclidean distance matrices
• The elliptic matrix completion problem
• A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs
• On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials
• Stability of sequential lateration and of stress minimization in the presence of noise
• An inexact spectral bundle method for convex quadratic semidefinite programming
• Statistical Inference for Hüsler–Reiss Graphical Models Through Matrix Completions
• Semidefinite programming for discrete optimization and matrix completion problems
• Matrix completion and decomposition in phase-bounded cones
• Euclidean distance matrices, semidefinite programming and sensor network localization
• A semi-smooth Newton method for general projection equations applied to the nearest correlation matrix problem

This page was built for publication: The Euclidian Distance Matrix Completion Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835417)