The following pages link to (Q5393827):
Displaying 17 items.
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- (Robust) edge-based semidefinite programming relaxation of sensor network localization (Q652286) (← links)
- Comparing SOS and SDP relaxations of sensor network localization (Q694515) (← links)
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints (Q694528) (← links)
- The discretizable molecular distance geometry problem (Q694593) (← links)
- On bar frameworks, stress matrices and semidefinite programming (Q717126) (← links)
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position (Q1774976) (← links)
- A block coordinate descent method for sensor network localization (Q2119759) (← links)
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers (Q2302834) (← links)
- A Euclidean distance matrix model for protein molecular conformation (Q2307747) (← links)
- Theoretical aspects of connectivity-based multi-hop positioning (Q2575092) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Fast implementation for semidefinite programs with positive matrix completion (Q3458828) (← links)
- An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation (Q4558538) (← links)
- Multiple Round Random Ball Placement: Power of Second Chance (Q5323092) (← links)
