Solving Euclidean distance matrix completion problems via semidefinite progrmming

DOI10.1023/A:1008655427845zbMath1040.90537OpenAlexW2125947724MaRDI QIDQ1294802

Abdo Y. Alfakih, Henry Wolkowicz, Amir K. Khandani

Publication date: 1999

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008655427845

zbMATH Keywords

semidefinite programmingEuclidean distance matricescompletion problemsprimal-dual interior-point method

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25)

Related Items (58)

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

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