Faces of the cone of Euclidean distance matrices: characterizations, structure and induced geometry
This paper deals with the faces of the cone of Euclidean distance matrices. A known result tells us how to identify every distance matrix in a particular face using the column space of the coordinate matrices. The author changes from characterizing faces based on ranges of matrices to a new characterization based on null spaces. For every Euclidean distance matrix \(D\) the author defines a new subspace, \(LGS(D)\), in the following way: \(LGS(D)=N(D)\) if \(D\) is spherical and \(LGS(D)=N(D)\oplus \langle x\rangle\) otherwise, with \(x\) solution of \(Dx=e\), where \(N(D)\) denotes the null space of \(D\), \(\langle x\rangle\) the subspace generated by \(x\) and \(e\) the vector with all ones. This subspace contains information about the location of the matrix and the geometrical structure of the configuration of points. In addition, this subspace contains the null space of \(D\), and becomes a tool to describe faces and determine their structure. The subspace \(LGS(D)\) is also related to the centered preimage of \(D\), as well as to any centered coordinate matrix. Given a Euclidean distance matrix \(D\) in the boundary of the cone, \(LGS(D)\) allows us to identify a set of supporting hyperplanes and to obtain a characterization of the minimal face that contains \(D\). A new face characterization based in coordinate matrices is related also to \(LGS(D)\) and state in term of homogeneous linear constraints, a description for optimization problems. Finally on a different direction, from \(LGS(D)\) the author determines basic geometric properties for matrices in the minimal face containing \(D\). In other words, given \(D\), the corresponding \(LGS(D)\) provides basic geometric properties of every configuration of points, whose distance matrix is on that face.
- A remark on the faces of the cone of Euclidean distance matrices
- On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
- The cone of distance matrices
- Circum-Euclidean distance matrices and faces
- Coordinate shadows of semidefinite and Euclidean distance matrices
- Circum-Euclidean distance matrices and faces
- Connections between the real positive semidefinite and distance matrix completion problems
- Properties of Euclidean and non-Euclidean 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 cone of distance matrices
- Circum-Euclidean distance matrices and faces
- Moore-Penrose inverse of a Euclidean distance matrix
- Linear spectral sets and their extremal varieties
- On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
- A variance inequality ensuring that a pre-distance matrix is Euclidean
- On cell matrices: a class of Euclidean distance matrices
- Euclidean distance matrices and applications
- Euclidean distance matrices: new characterization and boundary properties
- On Flattenability of Graphs
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- Coordinate shadows of semidefinite and Euclidean distance matrices
- Group Average Representations in Euclidean Distance Cones
- A facial reduction approach for the single source localization problem
- Geometric algebra and distance matrices
- Majorization for the eigenvalues of Euclidean distance matrices
- A remark on the faces of the cone of Euclidean distance matrices
- Critical angles in polyhedral convex cones: Numerical and statistical considerations
- A group majorization ordering for Euclidean distance matrices
- Multispherical Euclidean distance matrices
This page was built for publication: Faces of the cone of Euclidean distance matrices: characterizations, structure and induced geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568355)
