scientific article; zbMATH DE number 1182568

MaRDI QIDQ4400638zbMATH OpenFDO

Authors Monique Laurent

Publication date 4 February 1999

zbMATH Keywords

Euclidean distance matricespositive semidefinite matrices

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02) Hermitian, skew-Hermitian, and related matrices (15B57) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Polytopes and polyhedra (52B99)

Recommendations

• 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
• A connection between positive semidefinite and Euclidean distance matrix completion problems

Cited in

(21)

• Exploiting special structure in semidefinite programming: a survey of theory and applications
• A connection between positive semidefinite and Euclidean distance matrix completion problems
• On the uniqueness of Euclidean distance matrix completions.
• Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
• A penalty method for rank minimization problems in symmetric matrices
• Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
• 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
• On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
• Distance geometry for kissing spheres
• Asymptotic Bayesian structure learning using graph supports for Gaussian graphical models
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
• Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems
• Complexity of the positive semidefinite matrix completion problem with a rank constraint
• Sensor network localization, Euclidean distance matrix completions, and graph realization
• Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
• Coordinate shadows of semidefinite and Euclidean distance matrices
• Singularity degree of the positive semidefinite matrix completion problem
• Semidefinite programming for discrete optimization and matrix completion problems
• Matrix completion and decomposition in phase-bounded cones
• Equality relating Euclidean distance cone to positive semidefinite cone

This page was built for publication:

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