scientific article; zbMATH DE number 5066620
From MaRDI portal
Publication:5393827
zbMath1100.90029MaRDI QIDQ5393827
Publication date: 24 October 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A block coordinate descent method for sensor network localization, Fast implementation for semidefinite programs with positive matrix completion, Multiple Round Random Ball Placement: Power of Second Chance, Sensor network localization, Euclidean distance matrix completions, and graph realization, Approximation accuracy, gradient methods, and error bound for structured convex optimization, (Robust) edge-based semidefinite programming relaxation of sensor network localization, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation, Comparing SOS and SDP relaxations of sensor network localization, Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints, The discretizable molecular distance geometry problem, On the uniqueness of Euclidean distance matrix completions: the case of points in general position, On bar frameworks, stress matrices and semidefinite programming, Euclidean Distance Matrices and Applications, Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers, A Euclidean distance matrix model for protein molecular conformation, Theoretical aspects of connectivity-based multi-hop positioning
