Euclidean distance matrices and applications
From MaRDI portal
Publication:2802549
Recommendations
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Euclidean distance geometry. An introduction
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
- On Euclidean distance matrices of graphs
Cites work
- scientific article; zbMATH DE number 3774424 (Why is no real title available?)
- scientific article; zbMATH DE number 1534304 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 236540 (Why is no real title available?)
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- scientific article; zbMATH DE number 3331438 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
- A connection between positive semidefinite and Euclidean distance matrix completion problems
- A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization
- A generalized solution of the orthogonal Procrustes problem
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- A remark on the faces of the cone of Euclidean distance matrices
- A semidefinite programming approach to tensegrity theory and realizability of graphs
- Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems
- Algorithmic Aspects of Wireless Sensor Networks
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- An SDP-based divide-and-conquer algorithm for large-scale noisy anchor-free graph realization
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
- Circum-Euclidean distance matrices and faces
- Computing the Polar Decomposition—with Applications
- Conditions for Unique Graph Realizations
- Connected rigidity matroids and unique realizations of graphs
- Connections between the real positive semidefinite and distance matrix completion problems
- Convex Analysis
- Distance geometry optimization for protein structures
- Equality relating Euclidean distance cone to positive semidefinite cone
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Exact and Approximate Solutions of Source Localization Problems
- Exact matrix completion via convex optimization
- Explicit sensor network localization using semidefinite representations and facial reductions
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- Faces of the cone of Euclidean distance matrices: characterizations, structure and induced geometry
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Generic global rigidity
- Global Continuation for Distance Geometry Problems
- Graph rigidity via Euclidean distance matrices
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Interior Point Trajectories in Semidefinite Programming
- Invariance and efficiency of convex representations
- Iterative Minimization Schemes for Solving the Single Source Localization Problem
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Low-dimensional embedding with extra information
- Minimal vertex separators of chordal graphs
- Molecular conformation search by distance matrix perturbations
- Molecular embedding via a second order dissimilarity parameterized approach
- Nuclear norm minimization for the planted clique and biclique problems
- On certain linear mappings between inner-product and squared-distance matrices
- On dimensional rigidity of bar-and-joint frameworks
- On rigidity and realizability of weighted graphs
- On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
- On the uniqueness of Euclidean distance matrix completions.
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position
- Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems
- Positive definite completions of partial Hermitian matrices
- Problems of distance geometry and convex properties of quadratic maps
- Properties of Euclidean and non-Euclidean distance matrices
- Realizability of graphs
- Realizability of graphs in three dimensions
- Reducibility among combinatorial problems
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Rigid versus unique determination of protein structures with geometric buildup
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- 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
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization
- Strong Duality for Semidefinite Programming
- Sum of squares method for sensor network localization
- The Euclidian Distance Matrix Completion Problem
- The Molecule Problem: Exploiting Structure in Global Optimization
- The cone of distance matrices
- The orthogonal approximation of an oblique structure in factor analysis
- The theory and practice of distance geometry
- Theory of semidefinite programming for sensor network localization
- Three theorems with applications to Euclidean distance matrices
- Two theorems on Euclidean distance matrices and Gale transform
Cited in
(38)- Computing the nearest Euclidean distance matrix with low embedding dimensions
- On the nonnegative rank of Euclidean distance matrices
- Decomposition methods for sparse matrix nearness problems
- 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
- Euclidean distance matrices: new characterization and boundary properties
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
- A facial reduction approach for the single source localization problem
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
- Euclidean distance matrices, semidefinite programming and sensor network localization
- A genetic algorithm for circulant Euclidean distance matrices
- Realizing Euclidean distance matrices by sphere intersection
- On optimality conditions for nonlinear conic programming
- Assessing congruence among ultrametric distance matrices
- A penalty method for rank minimization problems in symmetric matrices
- scientific article; zbMATH DE number 2096339 (Why is no real title available?)
- The cell matrix closest to a given Euclidean distance matrix
- Robust Euclidean embedding via EDM optimization
- Darwinian evolution as Brownian motion on the simplex: a geometric perspective on stochastic replicator dynamics
- Coordinate difference matrices
- Facially dual complete (nice) cones and lexicographic tangents
- Generalized Euclidean distance matrices
- Euclidean distance geometry. An introduction
- The generalized distance matrix
- On the geometric interpretation of the nonnegative rank
- Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree
- On the eigenvalues of Euclidean distance matrices
- Half thresholding eigenvalue algorithm for semidefinite matrix completion
- Euclidean distance matrix completion problems
- Noisy Euclidean distance matrix completion with a single missing node
- On yielding and jointly yielding entries of Euclidean distance matrices
- Circum-Euclidean distance matrices and faces
- Euclidean distance matrices and their applications in rigidity theory
- Global solutions of non-Lipschitz \(S_{2}\)-\(S_{p}\) minimization over the positive semidefinite cone
- Taking all positive eigenvectors is suboptimal in classical multidimensional scaling
- 3D genome reconstruction from partially phased Hi-C data
- Two theorems on Euclidean distance matrices and Gale transform
This page was built for publication: Euclidean distance matrices and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802549)
