Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree

DOI10.1137/16M1092350zbMath1384.15005arXiv1610.06599WikidataQ130208621 ScholiaQ130208621MaRDI QIDQ4606658

Adam Rahman, R. Wayne Oldford

Publication date: 9 March 2018

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.06599

zbMATH Keywords

dimension reductionpoint configurationshigh-dimensional data analysismatrix completion problemsguided random search

Mathematics Subject Classification ID

Uses Software

• Qhull
• vegan
• LBFGS-B

Cites Work

• Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
• Multivariate extensions of Spearman's rho and related statistics
• Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• Distance matrix completion by numerical optimization
• Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample
• Connections between the real positive semidefinite and distance matrix completion problems
• Euclidean Distance Matrices and Applications
• Molecular Embedding via a Second Order Dissimilarity Parameterized Approach
• Algorithm 778: L-BFGS-B
• The quickhull algorithm for convex hulls
• Procrustes Problems
• A Limited Memory Algorithm for Bound Constrained Optimization
• Euclidean distance matrix completion problems
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

This page was built for publication: Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree