On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
From MaRDI portal
Publication:1987024
DOI10.1016/j.laa.2020.01.036zbMath1436.15030OpenAlexW3003641029WikidataQ114152267 ScholiaQ114152267MaRDI QIDQ1987024
Andrés David Báez Sánchez, Carlile C. Lavor
Publication date: 9 April 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.01.036
completion problemspositive semidefinite matrixdistance geometry problemsinterval Euclidean distance
Related Items (4)
A note on the Cayley-Menger determinant and the molecular distance geometry problem ⋮ Unassigned distance geometry and molecular conformation problems ⋮ Distance geometry and data science ⋮ A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discretization orders for protein side chains
- Discretization vertex orders in distance geometry
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- New error measures and methods for realizing protein graphs from distance data
- On the computation of protein backbones by using artificial backbones of hydrogens
- Discretization orders for distance geometry problems
- The discretizable molecular distance geometry problem
- Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis
- Properties of Euclidean and non-Euclidean distance matrices
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Recent advances on the interval distance geometry problem
- Realizing Euclidean distance matrices by sphere intersection
- Minimal NMR distance information for rigidity of protein graphs
- Oriented conformal geometric algebra and the molecular distance geometry problem
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- Tuning interval branch-and-prune for protein structure determination
- Some geometric results in semidefinite programming
- Recent advances on the discretizable molecular distance geometry problem
- A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
- Open research areas in distance geometry
- Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Exact matrix completion via convex optimization
- Six mathematical gems from the history of distance geometry
- Distance Geometry
- Euclidean Distance Matrices and Their Applications in Rigidity Theory
- Clifford algebra and discretizable distance geometry
- An Introduction to Distance Geometry applied to Molecular Geometry
- On a Relationship Between Graph Realizability and Distance Matrix Completion
- Gram spectrahedra
- A Geometric Algebra Invitation to Space-Time Physics, Robotics and Molecular Geometry
- The Euclidian Distance Matrix Completion Problem
- Euclidean distance matrix completion problems
- Euclidean Distance Geometry
- Euclidean Distance Geometry and Applications
- Generalized Inverses and Ranks of Block Matrices
- Conditions for Positive and Nonnegative Definiteness in Terms of Pseudoinverses
This page was built for publication: On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
