Pages that link to "Item:Q2566758"
From MaRDI portal
The following pages link to Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming (Q2566758):
Displaying 12 items.
- Structure method for solving the nearest Euclidean distance matrix problem (Q261791) (← links)
- Structure methods for solving the nearest correlation matrix problem (Q270046) (← links)
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- Euclidean distance matrices, semidefinite programming and sensor network localization (Q716240) (← links)
- A least-squares approach for discretizable distance geometry problems with inexact distances (Q2174885) (← links)
- Complementarity problems with respect to Loewnerian cones (Q2349522) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)
- Global convergence of the alternating projection method for the Max-Cut relaxation problem (Q5005866) (← links)
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (Q5258947) (← links)
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications (Q6147811) (← links)
