scientific article; zbMATH DE number 1182568
From MaRDI portal
Publication:4400638
zbMath0906.05074MaRDI QIDQ4400638
Publication date: 4 February 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Polytopes and polyhedra (52B99) Graph theory (05C99) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02)
Related Items
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 ⋮ 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 ⋮ On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data ⋮ Singularity Degree of the Positive Semidefinite Matrix Completion Problem ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ On the uniqueness of Euclidean distance matrix completions: the case of points in general position ⋮ Asymptotic Bayesian structure learning using graph supports for Gaussian graphical models ⋮ Exploiting special structure in semidefinite programming: a survey of theory and applications ⋮ Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming ⋮ Coordinate Shadows of Semidefinite and Euclidean Distance Matrices ⋮ Distance geometry for kissing spheres ⋮ Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
