Home
Convex Optimization
Convex Optimization Group
Calculus of Inequalities
Conic Independence
Convex Cones
Convex, Affine, Conic Hulls
Convex Functions
Convex Geometry
Distance Geometry
Distance Matrix Cone
Dual Cones
Duality Gap
Euclidean Distance Matrices
Elliptope and Fantope
Extreme Directions
Eigenvalues/Eigenvectors
Farkas Lemma
Face Recognition
Fifth Metric Property
Kissing Number
Linear Algebra
Linear Matrix Inequality
Matrix Calculus
Manifold Learning
Molecular Conformation
Positive Semidefinite Cone
Projection
Quasiconvex Functions
Rank Constraint
Semidefinite Programming
Schoenberg Criterion
Sensor Network Localization
Optimization News
SEO Consultant
Video
Wikimization
Zeros of Polynomials
Contact Us
Wikimization     Meboo     Video     News     Contact     See
Felice crystal
Home arrow Euclidean Distance Matrices
Euclidean Distance Matrix


"These results were obtained by Schoenberg (1935), a surprisingly late date for such a fundamental property of Euclidean geometry."

   cubix

By itself, distance information between many points in Euclidean space is lacking.  We might want to know more; such as, relative or absolute position or dimension of some hull. A question naturally arising in some fields (e.g., geodesy, economics, genetics, psychology, biochemistry, engineering) asks what facts can be deduced given only distance information. What can we know about the underlying points that the distance information purports to describe? We also ask what it means when given distance information is incomplete; or suppose the distance information is not reliable, available, or specified only by certain tolerances (affine inequalities).  These questions motivate a study of interpoint distance, well represented in any spatial dimension by a simple matrix from linear algebra.  In the book, we answer some of these questions via Euclidean distance matrices.

Euclidean space is a finite-dimensional real vector space having an inner product defined on it, hence a metric as well. A Euclidean distance matrix, an EDM, is an exhaustive table of distance-square between points taken by pair from a list of N points; the squared metric, the measure of distance-square.

Read more...

 

The Course

The Videos

See Inside

Convex Optimization

by Stephen Boyd 

& L. Vandenberghe 

Buy Book



See Figures

See Inside

Dattorro

by Dattorro

Buy Book



The Course

Bertsekas

by Dimitri Bertsekas 

Buy Book



See Inside

Hiriart-Urruty & Lemaréchal

by Hiriart-Urruty

& Lemaréchal

Buy Book



See Inside

Rockafellar

by Rockafellar

Buy Book



Optimization Newsletter
Subscription:

Email:

Receive HTML mailings?
Subscribe Unsubscribe