Pages that link to "Item:Q5200557"
From MaRDI portal
The following pages link to Euclidean distance matrix completion problems (Q5200557):
Displayed 8 items.
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data (Q1987024) (← 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)
- Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree (Q4606658) (← 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)