Pages that link to "Item:Q2802549"
From MaRDI portal
The following pages link to Euclidean Distance Matrices and Applications (Q2802549):
Displaying 28 items.
- Computing the nearest Euclidean distance matrix with low embedding dimensions (Q463737) (← links)
- Global solutions of non-Lipschitz \(S_{2}\)-\(S_{p}\) minimization over the positive semidefinite cone (Q476270) (← links)
- Assessing congruence among ultrametric distance matrices (Q734390) (← links)
- Half thresholding eigenvalue algorithm for semidefinite matrix completion (Q887385) (← links)
- On the nonnegative rank of Euclidean distance matrices (Q977487) (← links)
- On the eigenvalues of Euclidean distance matrices (Q1001750) (← links)
- A genetic algorithm for circulant Euclidean distance matrices (Q1294348) (← links)
- A penalty method for rank minimization problems in symmetric matrices (Q1616933) (← links)
- On yielding and jointly yielding entries of Euclidean distance matrices (Q1668992) (← links)
- The generalized distance matrix (Q1713290) (← links)
- Realizing Euclidean distance matrices by sphere intersection (Q1728090) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- Circum-Euclidean distance matrices and faces (Q1906789) (← links)
- Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
- Applicability and interpretability of Ward's hierarchical agglomerative clustering with or without contiguity constraints (Q2236777) (← links)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754) (← links)
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming (Q2566758) (← links)
- Taking all positive eigenvectors is suboptimal in classical multidimensional scaling (Q2828334) (← links)
- Euclidean distance matrices: new characterization and boundary properties (Q3399120) (← links)
- Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
- Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree (Q4606658) (← links)
- Facially Dual Complete (Nice) Cones and Lexicographic Tangents (Q5234283) (← links)
- On Optimality Conditions for Nonlinear Conic Programming (Q5868952) (← links)
- Generalized Euclidean distance matrices (Q5888877) (← links)
- Two theorems on Euclidean distance matrices and Gale transform (Q5956246) (← links)
- A facial reduction approach for the single source localization problem (Q6064050) (← links)
- Darwinian evolution as Brownian motion on the simplex: a geometric perspective on stochastic replicator dynamics (Q6103971) (← links)
- 3D genome reconstruction from partially phased Hi-C data (Q6192541) (← links)
