Pages that link to "Item:Q716240"
From MaRDI portal
The following pages link to Euclidean distance matrices, semidefinite programming and sensor network localization (Q716240):
Displaying 9 items.
- Structure methods for solving the nearest correlation matrix problem (Q270046) (← links)
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Comparing SOS and SDP relaxations of sensor network localization (Q694515) (← links)
- A penalty method for rank minimization problems in symmetric matrices (Q1616933) (← links)
- Two relaxation methods for rank minimization problems (Q2198528) (← links)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754) (← links)
- Iterative universal rigidity (Q2351022) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Euclidean distance matrix completion problems (Q5200557) (← links)
