Solving Euclidean distance matrix completion problems via semidefinite progrmming

Recommendations

Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
On the uniqueness of Euclidean distance matrix completions: the case of points in general position
Euclidean distance matrix completion problems

Cited in

(62)

Theory of semidefinite programming for sensor network localization
A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
A remark on the faces of the cone of Euclidean distance matrices
A novel approach for solving semidefinite programs
On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
Positive semidefinite relaxations for distance geometry problems.
A semismooth Newton method for the nearest Euclidean distance matrix problem
Decomposition methods for sparse matrix nearness problems
An implementable proximal point algorithmic framework for nuclear norm minimization
Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
A Riemannian dimension-reduced second-order method with application in sensor network localization
Recent advances on the interval distance geometry problem
Comparing SOS and SDP relaxations of sensor network localization
Least-squares orthogonalization using semidefinite programming
On the uniqueness of Euclidean distance matrix completions.
A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix
Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications
Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree
Matrix estimation by universal singular value thresholding
Diagonally dominant programming in distance geometry
Comparison of public-domain software for black box global optimization^∗
Noisy Euclidean distance matrix completion with a single missing node
Semidefinite programming for discrete optimization and matrix completion problems
Preprocessing and regularization for degenerate semidefinite programs
Euclidean distance matrices, semidefinite programming and sensor network localization
On dimensional rigidity of bar-and-joint frameworks
Local, dimensional and universal rigidities: a unified Gram matrix approach
A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
On stress matrices of \((d + 1)\)-lateration frameworks in general position
Graph rigidity via Euclidean distance matrices
Six mathematical gems from the history of distance geometry
Characterizing graphs with convex and connected Cayley configuration spaces
Distance geometry and data science
An inexact primal-dual path following algorithm for convex quadratic SDP
Sensor network localization, Euclidean distance matrix completions, and graph realization
On the uniqueness of Euclidean distance matrix completions: the case of points in general position
A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
Exploiting low-rank structure in semidefinite programming by approximate operator splitting
3D genome reconstruction from partially phased Hi-C data
Generically globally rigid graphs have generic universally rigid frameworks
Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
Model-based distance embedding with applications to chromosomal conformation biology
The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
Conditional quadratic semidefinite programming: examples and methods
Localization from incomplete noisy distance measurements
Solving partial differential equations on manifolds from incomplete interpoint distance
Euclidean distance matrices and applications
Central limit theorems for classical multidimensional scaling
Scalable semidefinite programming
Identifying 3D Genome Organization in Diploid Organisms via Euclidean Distance Geometry
Distance geometry algorithms in molecular modelling of polymer and composite systems.
Minimal Euclidean representations of graphs
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
New error measures and methods for realizing protein graphs from distance data
Euclidean distance matrix completion problems
QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
A new graph parameter related to bounded rank positive semidefinite matrix completions
On bar frameworks, stress matrices and semidefinite programming
Universal rigidity of bar frameworks via the geometry of spectrahedra

This page was built for publication: Solving Euclidean distance matrix completion problems via semidefinite progrmming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294802)