Pages that link to "Item:Q4588863"
From MaRDI portal
The following pages link to Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863):
Displaying 11 items.
- Level-set methods for convex optimization (Q1739042) (← links)
- Low-rank matrix completion using nuclear norm minimization and facial reduction (Q1756746) (← links)
- Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
- A least-squares approach for discretizable distance geometry problems with inexact distances (Q2174885) (← links)
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints (Q2181603) (← links)
- Robust principal component analysis using facial reduction (Q2218887) (← links)
- Robust Euclidean embedding via EDM optimization (Q2220896) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction (Q2364497) (← links)
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications (Q6147811) (← links)
- Multiscale semidefinite programming approach to positioning problems with pairwise structure (Q6629219) (← links)
