Euclidean distance cone faces

From Wikimization

(Difference between revisions)
Jump to: navigation, search
Current revision (15:42, 11 November 2009) (edit) (undo)
m (Protected "Euclidean distance cone faces" [edit=autoconfirmed:move=autoconfirmed])
 
(5 intermediate revisions not shown.)
Line 7: Line 7:
For a better explanation, see section 6.5.3 in [http://meboo.convexoptimization.com/BOOK/ConeDistanceMatrices.pdf Cone of Distance Matrices].
For a better explanation, see section 6.5.3 in [http://meboo.convexoptimization.com/BOOK/ConeDistanceMatrices.pdf Cone of Distance Matrices].
-
Definition of ''exposure'' is in [http://meboo.convexoptimization.com/BOOK/convexgeometry.pdf Convex Geometry].
+
Definition of ''exposure'' is in [http://meboo.convexoptimization.com/BOOK/convexgeometry.pdf Convex Geometry].
 +
 
 +
Basically, the question asks whether all faces of <math>\,\mathbb{EDM}^N\!</math> can be defined by intersection with a supporting hyperplane; that intersection is termed ''exposure.''

Current revision

The question remains open whether all faces of the cone of Euclidean distance matrices LaTeX: \,\mathbb{EDM}^N\!

(whose dimension is less than dimension of the cone)

are exposed like they are for the positive semidefinite cone.

For a better explanation, see section 6.5.3 in Cone of Distance Matrices.

Definition of exposure is in Convex Geometry.

Basically, the question asks whether all faces of LaTeX: \,\mathbb{EDM}^N\! can be defined by intersection with a supporting hyperplane; that intersection is termed exposure.

Personal tools