Pages that link to "Item:Q1365058"
From MaRDI portal
The following pages link to Cuts, matrix completions and graph rigidity (Q1365058):
Displaying 11 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices (Q979016) (← links)
- A parameterization of positive definite matrices in terms of partial correlation vines (Q1410721) (← links)
- Graph rigidity via Euclidean distance matrices (Q1978125) (← links)
- Phase retrieval of complex and vector-valued functions (Q2155281) (← links)
- Weak Rigidity Theory and Its Application to Formation Stabilization (Q4569571) (← links)
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)
- Iterated linear optimization (Q5157412) (← links)
- On rigidity and realizability of weighted graphs (Q5932187) (← links)
- The Euclidean distance degree of an algebraic variety (Q5963081) (← links)
- Cycle-based formulations in distance geometry (Q6114894) (← links)
