Pages that link to "Item:Q1381268"
From MaRDI portal
The following pages link to A connection between positive semidefinite and Euclidean distance matrix completion problems (Q1381268):
Displaying 11 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- On completion problems for various classes of \(P\)-matrices (Q819137) (← links)
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming (Q999796) (← links)
- Phase retrieval of complex and vector-valued functions (Q2155281) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming (Q2566758) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Completion of Hankel partial contractions of extremal type (Q2872430) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- On the equivalence between low-rank matrix completion and tensor rank (Q4640079) (← links)
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (Q5258947) (← links)