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 25 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)
- Computing the nearest Euclidean distance matrix with low embedding dimensions (Q463737) (← links)
- Euclidean distance matrices, semidefinite programming and sensor network localization (Q716240) (← links)
- Approximation by matrices positive semidefinite on a subspace (Q1117291) (← links)
- Solving Euclidean distance matrix completion problems via semidefinite progrmming (Q1294802) (← links)
- A connection between positive semidefinite and Euclidean distance matrix completion problems (Q1381268) (← links)
- On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
- Distance matrix completion by numerical optimization (Q1588838) (← links)
- Connections between the real positive semidefinite and distance matrix completion problems (Q1894505) (← links)
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data (Q1987024) (← links)
- A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix (Q1993487) (← 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)
- Solution of the embedding problem and decomposition of symmetric matrices. (Q3692713) (← links)
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)
- Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree (Q4606658) (← links)
- The Euclidean distance completion problem: cycle completability (Q4853938) (← links)
- Global convergence of the alternating projection method for the Max-Cut relaxation problem (Q5005866) (← links)
- Euclidean distance matrix completion problems (Q5200557) (← 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)
