Pages that link to "Item:Q1810881"
From MaRDI portal
The following pages link to Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems (Q1810881):
Displaying 24 items.
- Least-squares approximations in geometric buildup for solving distance geometry problems (Q637550) (← links)
- Discretization orders for distance geometry problems (Q691496) (← links)
- The discretizable molecular distance geometry problem (Q694593) (← links)
- Rigid versus unique determination of protein structures with geometric buildup (Q941022) (← links)
- On the nonnegative rank of Euclidean distance matrices (Q977487) (← links)
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation (Q1048270) (← links)
- Solving Euclidean distance matrix completion problems via semidefinite progrmming (Q1294802) (← links)
- A connection between positive semidefinite and Euclidean distance matrix completion problems (Q1381268) (← links)
- On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
- Distance matrix completion by numerical optimization (Q1588838) (← links)
- Recent advances on the interval distance geometry problem (Q1683318) (← links)
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position (Q1774976) (← links)
- Uniqueness of the solutions of some completion problems (Q1887497) (← links)
- Connections between the real positive semidefinite and distance matrix completion problems (Q1894505) (← links)
- The discretizable distance geometry problem (Q1926615) (← 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)
- Phase retrieval of complex and vector-valued functions (Q2155281) (← links)
- A note on completing quasi-distance and distance matrices (Q2302875) (← links)
- A Euclidean distance matrix model for protein molecular conformation (Q2307747) (← links)
- Approximating the problem, not the solution: an alternative view of point set matching (Q2369583) (← links)
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming (Q2566758) (← links)
- Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems (Q2706294) (← links)
- Euclidean distance matrix completion problems (Q5200557) (← links)
