v2007.09.13 - Convex Optimization

v2007.09.13 - Convex Optimization v2007.09.13 - Convex Optimization

convexoptimization.com
from convexoptimization.com More from this publisher
10.07.2015 Views

386 CHAPTER 5. EUCLIDEAN DISTANCE MATRIX

Chapter 6EDM coneFor N > 3, the cone of EDMs is no longer a circular cone andthe geometry becomes complicated...−Hayden, Wells, Liu, & Tarazaga (1991) [133,3]In the subspace of symmetric matrices S N , we know the convex cone ofEuclidean distance matrices EDM N (the EDM cone) does not intersect thepositive semidefinite cone S N + (PSD cone) except at the origin, their onlyvertex; there can be no positive nor negative semidefinite EDM. (902) [170]EDM N ∩ S N + = 0 (978)Even so, the two convex cones can be related. In6.8.1 we prove the newequalityEDM N = S N h ∩ ( )S N⊥c − S N + (1070)2001 Jon Dattorro. CO&EDG version 2007.09.13. All rights reserved.Citation: Jon Dattorro, Convex Optimization & Euclidean Distance Geometry,Meboo Publishing USA, 2005.387

386 CHAPTER 5. EUCLIDEAN DISTANCE MATRIX

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!