Euclidean Distance Matrices and Applications
From MaRDI portal
Publication:2802549
DOI10.1007/978-1-4614-0769-0_30zbMath1334.90109OpenAlexW765936379MaRDI QIDQ2802549
Nathan Krislock, Henry Wolkowicz
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_30
Semidefinite programming (90C22) Applications of mathematical programming (90C90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A penalty method for rank minimization problems in symmetric matrices, Decomposition Methods for Sparse Matrix Nearness Problems, Half thresholding eigenvalue algorithm for semidefinite matrix completion, A facial reduction approach for the single source localization problem, Darwinian evolution as Brownian motion on the simplex: a geometric perspective on stochastic replicator dynamics, 3D genome reconstruction from partially phased Hi-C data, Computing the nearest Euclidean distance matrix with low embedding dimensions, Global solutions of non-Lipschitz \(S_{2}\)-\(S_{p}\) minimization over the positive semidefinite cone, Applicability and interpretability of Ward's hierarchical agglomerative clustering with or without contiguity constraints, A new graph parameter related to bounded rank positive semidefinite matrix completions, On the geometric interpretation of the nonnegative rank, Noisy Euclidean distance matrix completion with a single missing node, Taking All Positive Eigenvectors Is Suboptimal in Classical Multidimensional Scaling, Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree, Facially Dual Complete (Nice) Cones and Lexicographic Tangents, On Optimality Conditions for Nonlinear Conic Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Three theorems with applications to Euclidean distance matrices
- The theory and practice of distance geometry
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Nuclear norm minimization for the planted clique and biclique problems
- Positive definite completions of partial Hermitian matrices
- A remark on the faces of the cone of Euclidean distance matrices
- Sum of squares method for sensor network localization
- Low-dimensional embedding with extra information
- Theory of semidefinite programming for sensor network localization
- Realizability of graphs
- Realizability of graphs in three dimensions
- Equality relating Euclidean distance cone to positive semidefinite cone
- Rigid versus unique determination of protein structures with geometric buildup
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- Properties of Euclidean and non-Euclidean distance matrices
- On certain linear mappings between inner-product and squared-distance matrices
- Minimal vertex separators of chordal graphs
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Problems of distance geometry and convex properties of quadratic maps
- A connection between positive semidefinite and Euclidean distance matrix completion problems
- Semidefinite programming and interior-point approaches for combinatorial optimization problems. 4 papers presented at the workshop on Semidefinite programming and interior-point approaches for combinatorial optimization problems, Fields Institute, Univ. of Toronto, Canada, May 15--17, 1996
- On the uniqueness of Euclidean distance matrix completions.
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position
- Connected rigidity matroids and unique realizations of graphs
- Connections between the real positive semidefinite and distance matrix completion problems
- Circum-Euclidean distance matrices and faces
- Distance geometry optimization for protein structures
- Graph rigidity via Euclidean distance matrices
- On dimensional rigidity of bar-and-joint frameworks
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Invariance and efficiency of convex representations
- Generic global rigidity
- Molecular conformation search by distance matrix perturbations
- On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
- A generalized solution of the orthogonal Procrustes problem
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
- Faces of the cone of Euclidean distance matrices: characterizations, structure and induced geometry
- The cone of distance matrices
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- The orthogonal approximation of an oblique structure in factor analysis
- Exact matrix completion via convex optimization
- Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Algorithm 920
- An SDP-Based Divide-and-Conquer Algorithm for Large-Scale Noisy Anchor-Free Graph Realization
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Iterative Minimization Schemes for Solving the Single Source Localization Problem
- Molecular Embedding via a Second Order Dissimilarity Parameterized Approach
- A semidefinite programming approach to tensegrity theory and realizability of graphs
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
- Computing the Polar Decomposition—with Applications
- Conditions for Unique Graph Realizations
- Interior Point Trajectories in Semidefinite Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Global Continuation for Distance Geometry Problems
- Strong Duality for Semidefinite Programming
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Exact and Approximate Solutions of Source Localization Problems
- The Euclidian Distance Matrix Completion Problem
- The Molecule Problem: Exploiting Structure in Global Optimization
- Reducibility among Combinatorial Problems
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Algorithmic Aspects of Wireless Sensor Networks
- SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Convex Analysis
- On rigidity and realizability of weighted graphs
- Two theorems on Euclidean distance matrices and Gale transform
