Pages that link to "Item:Q2181603"
From MaRDI portal
The following pages link to Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints (Q2181603):
Displaying 5 items.
- Computing the nearest Euclidean distance matrix with low embedding dimensions (Q463737) (← links)
- Robust Euclidean embedding via EDM optimization (Q2220896) (← links)
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation (Q2397097) (← links)
- An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling (Q5092555) (← links)
- A facial reduction approach for the single source localization problem (Q6064050) (← links)