Pages that link to "Item:Q5200557"
From MaRDI portal
The following pages link to Euclidean distance matrix completion problems (Q5200557):
Displaying 16 items.
- Solving Euclidean distance matrix completion problems via semidefinite progrmming (Q1294802) (← links)
- On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
- Distance matrix completion by numerical optimization (Q1588838) (← links)
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position (Q1774976) (← links)
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data (Q1987024) (← links)
- A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix (Q1993487) (← links)
- Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
- Quartic first-order methods for low-rank minimization (Q2031993) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- Model-based distance embedding with applications to chromosomal conformation biology (Q2170380) (← links)
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints (Q2181603) (← links)
- Robust Euclidean embedding via EDM optimization (Q2220896) (← links)
- Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree (Q4606658) (← links)
- The Euclidean distance completion problem: cycle completability (Q4853938) (← links)
- Identifying 3D Genome Organization in Diploid Organisms via Euclidean Distance Geometry (Q5065472) (← links)
- 3D genome reconstruction from partially phased Hi-C data (Q6192541) (← links)
