Euclidean distance matrix completion problems
From MaRDI portal
Publication:5200557
DOI10.1080/10556788.2011.643888zbMath1252.49046OpenAlexW2023059467MaRDI QIDQ5200557
Haw-Ren Fang, Dianne P. O'Leary
Publication date: 6 November 2012
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2011.643888
global optimizationdistance geometrymolecular conformationEuclidean distance matricesdimensionality relaxationmodified Cholesky factorizations
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Newton-type methods (49M15) Methods of quasi-Newton type (90C53) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items
Identifying 3D Genome Organization in Diploid Organisms via Euclidean Distance Geometry, Model-based distance embedding with applications to chromosomal conformation biology, 3D genome reconstruction from partially phased Hi-C data, On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data, Noisy Euclidean distance matrix completion with a single missing node, Quartic first-order methods for low-rank minimization, Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree, On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
Cites Work
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Modified Cholesky algorithms: A catalog with new approaches
- Properties of Euclidean and non-Euclidean distance matrices
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- A stochastic/perturbation global optimization algorithm for distance geometry problems
- On the uniqueness of Euclidean distance matrix completions.
- Distance matrix completion by numerical optimization
- Connections between the real positive semidefinite and distance matrix completion problems
- Distance geometry optimization for protein structures
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- A New Modified Cholesky Factorization
- Molecular Embedding via a Second Order Dissimilarity Parameterized Approach
- Conditions for Unique Graph Realizations
- BFGS with Update Skipping and Varying Memory
- Global Continuation for Distance Geometry Problems
- A Revised Modified Cholesky Factorization Algorithm
- The Euclidian Distance Matrix Completion Problem
- The Molecule Problem: Exploiting Structure in Global Optimization
- Some distance properties of latent root and vector methods used in multivariate analysis
- A Theorem on Boolean Matrices
