Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree
From MaRDI portal
Publication:4606658
DOI10.1137/16M1092350zbMath1384.15005arXiv1610.06599WikidataQ130208621 ScholiaQ130208621MaRDI QIDQ4606658
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
dimension reductionpoint configurationshigh-dimensional data analysismatrix completion problemsguided random search
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
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