The following pages link to (Q4400638):
Displayed 15 items.
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Equality relating Euclidean distance cone to positive semidefinite cone (Q924334) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- A penalty method for rank minimization problems in symmetric matrices (Q1616933) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position (Q1774976) (← links)
- Distance geometry for kissing spheres (Q2348019) (← links)
- Asymptotic Bayesian structure learning using graph supports for Gaussian graphical models (Q2507765) (← links)
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming (Q2566758) (← links)
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (Q5258947) (← links)
- Singularity Degree of the Positive Semidefinite Matrix Completion Problem (Q5737737) (← links)