Euclidean Distance Matrices and Applications (Q2802549)

From MaRDI portal

Revision as of 20:34, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Euclidean Distance Matrices and Applications	scientific article

Statements

scholarly article

0 references

Euclidean Distance Matrices and Applications (English)

0 references

Nathan Krislock

0 references

Henry Wolkowicz

0 references

International Series in Operations Research & Management Science

0 references

publication date

26 April 2016

0 references

zbMATH Keywords

Euclidean distance matrix (EDM)

0 references

semidefinite programming

0 references

sensor network localization

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-1-4614-0769-0_30

0 references

Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming

0 references

Euclidean distance matrices, semidefinite programming and sensor network localization

0 references

Solving Euclidean distance matrix completion problems via semidefinite progrmming

0 references

0 references

Graph rigidity via Euclidean distance matrices

0 references

On rigidity and realizability of weighted graphs

0 references

On the uniqueness of Euclidean distance matrix completions.

0 references

On the uniqueness of Euclidean distance matrix completions: the case of points in general position

0 references

On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices

0 references

A remark on the faces of the cone of Euclidean distance matrices

0 references

On dimensional rigidity of bar-and-joint frameworks

0 references

Two theorems on Euclidean distance matrices and Gale transform

0 references

Nuclear norm minimization for the planted clique and biclique problems

0 references

Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach

0 references

Algorithmic Aspects of Wireless Sensor Networks

0 references

Low-dimensional embedding with extra information

0 references

The Euclidian Distance Matrix Completion Problem

0 references

Problems of distance geometry and convex properties of quadratic maps

0 references

Exact and Approximate Solutions of Source Localization Problems

0 references

Iterative Minimization Schemes for Solving the Single Source Localization Problem

0 references

Realizability of graphs in three dimensions

0 references

Realizability of graphs

0 references

A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation

0 references

0 references

0 references

0 references

Exact matrix completion via convex optimization

0 references

SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization

0 references

Invariance and efficiency of convex representations

0 references

Generic global rigidity

0 references

0 references

On certain linear mappings between inner-product and squared-distance matrices

0 references

Equality relating Euclidean distance cone to positive semidefinite cone

0 references

Sensor network localization, Euclidean distance matrix completions, and graph realization

0 references

A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances

0 references

A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data

0 references

Extending the geometric build-up algorithm for the molecular distance geometry problem

0 references

Molecular conformation search by distance matrix perturbations

0 references

Three theorems with applications to Euclidean distance matrices

0 references

Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework

0 references

An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Interior Point Trajectories in Semidefinite Programming

0 references

0 references

0 references

Properties of Euclidean and non-Euclidean distance matrices

0 references

The orthogonal approximation of an oblique structure in factor analysis

0 references

Positive definite completions of partial Hermitian matrices

0 references

Molecular Embedding via a Second Order Dissimilarity Parameterized Approach

0 references

The theory and practice of distance geometry

0 references

The cone of distance matrices

0 references

Conditions for Unique Graph Realizations

0 references

The Molecule Problem: Exploiting Structure in Global Optimization

0 references

Computing the Polar Decomposition—with Applications

0 references

Connected rigidity matroids and unique realizations of graphs

0 references

Connections between the real positive semidefinite and distance matrix completion problems

0 references

Reducibility among Combinatorial Problems

0 references

Exploiting Sparsity in SDP Relaxation for Sensor Network Localization

0 references

0 references

Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions

0 references

Minimal vertex separators of chordal graphs

0 references

A connection between positive semidefinite and Euclidean distance matrix completion problems

0 references

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

0 references

Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems

0 references

An SDP-Based Divide-and-Conquer Algorithm for Large-Scale Noisy Anchor-Free Graph Realization

0 references

Global Continuation for Distance Geometry Problems

0 references

Distance geometry optimization for protein structures

0 references

Sum of squares method for sensor network localization

0 references

(Robust) edge-based semidefinite programming relaxation of sensor network localization

0 references

Strong Duality for Semidefinite Programming

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

Convex Analysis

0 references

0 references

Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert''

0 references

A generalized solution of the orthogonal Procrustes problem

0 references

A semidefinite programming approach to tensegrity theory and realizability of graphs

0 references

Theory of semidefinite programming for sensor network localization

0 references

Faces of the cone of Euclidean distance matrices: characterizations, structure and induced geometry

0 references

Circum-Euclidean distance matrices and faces

0 references

Second‐Order Cone Programming Relaxation of Sensor Network Localization

0 references

Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization

0 references

An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data

0 references

Rigid versus unique determination of protein structures with geometric buildup

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-1-4614-0769-0_30

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2802549

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2802549&oldid=36245020"