Positive semidefinite cone

From Wikimization

(Difference between revisions)
Jump to: navigation, search
(New page: ''"The cone of positive semidefinite matrices studied in this section is arguably the most important of all non-polyhedral cones whose facial structure we completely understand."'' &nbsp;<...)
Current revision (22:56, 8 July 2011) (edit) (undo)
 
(8 intermediate revisions not shown.)
Line 2: Line 2:
[[Image:psdcone.jpg|right|positive semidefinite cone is a circular cone in 3D]]
[[Image:psdcone.jpg|right|positive semidefinite cone is a circular cone in 3D]]
-
<br />
+
The set of all symmetric positive semidefinite matrices of particular dimension is called the positive semidefinite cone:
-
The set of all symmetric positive semidefinite matrices of particular dimension is called the positive semidefinite cone: <br />
+
 
-
It can be formed by intersection of an infinite number of halfspaces in the vectorized variable matrix from the figure, <br />
+
It can be formed by intersection of an infinite number of halfspaces in the vectorized variable matrix
-
each halfspace having partial boundary containing the origin in an&nbsp;isomorphic subspace. Hence&nbsp;the positive semidefinite cone&nbsp;is convex. It is a unique immutable proper cone in the ambient space of symmetric matrices.
+
<strong>(</strong>as in figure<strong>)</strong>,
-
<br>The positive definite (full-rank) matrices comprise the cone interior, while all singular positive semidefinite matrices <strong>(</strong>having at least one 0 eigenvalue<strong>)</strong> reside on the cone boundary.<br />
+
each halfspace having partial boundary containing the origin in an&nbsp;isomorphic subspace.
-
<br />
+
 
-
The only symmetric positive semidefinite matrix having&nbsp;all zero eigenvalues resides at the origin.
+
Hence the positive semidefinite cone is convex. It is a unique immutable proper cone in the ambient space of symmetric matrices.
-
<br>In low dimension the positive semidefinite cone is a circular cone because there is an isometric isomorphism T relating matrix space to vector space: For a 2×2 symmetric matrix, T is obtained by scaling the ß coordinate by v2 (as in figure). This linear bijective transformation T preserves distance between two points in each respective space; <i>i.e.,</i> ||x - y||<sub>F</sub> = ||Tx - Ty||<sub>2</sub> <strong>(</strong>distance between matrices equals distance between vectorized matrices<strong>)</strong>. In one dimension, the nonnegative ray is a circular cone.
+
 
-
<br>[http://meboo.convexoptimization.com/access.html Read more]...
+
The positive definite <strong>(</strong>full-rank<strong>)</strong> matrices comprise the cone interior, while all singular positive semidefinite matrices <strong>(</strong>having at least one <math>0</math> eigenvalue<strong>)</strong> reside on the cone boundary.
 +
 
 +
The only symmetric positive semidefinite matrix having all <math>0</math> eigenvalues resides at the origin.
 +
 
 +
In low dimension, the positive semidefinite cone is shown to be a circular cone by way of an isometric isomorphism <math>T</math> relating matrix space to vector space:
 +
<ul>
 +
<li>For a 2×2 symmetric matrix, <math>T</math> is obtained by scaling the ß coordinate by &radic;2 <strong>(</strong>as in figure<strong>)</strong>. This linear bijective transformation <math>T</math> preserves distance between two points in each respective space; <i>i.e.,</i> ||<math>x - y</math>||<sub>F</sub> = ||<math>Tx - Ty</math>||<sub>2</sub>
 +
<strong>(</strong>distance between matrices <math>=</math> distance between vectorized matrices<strong>)</strong>.
 +
<li>In one dimension, 1×1 symmetric matrices, the nonnegative ray is a circular cone.
 +
</ul>
 +
 
 +
[http://meboo.convexoptimization.com/access.html Read more...]

Current revision

"The cone of positive semidefinite matrices studied in this section is arguably the most important of all non-polyhedral cones whose facial structure we completely understand."  LaTeX: -Alexander Barvinok

positive semidefinite cone is a circular cone in 3D

The set of all symmetric positive semidefinite matrices of particular dimension is called the positive semidefinite cone:

It can be formed by intersection of an infinite number of halfspaces in the vectorized variable matrix (as in figure), each halfspace having partial boundary containing the origin in an isomorphic subspace.

Hence the positive semidefinite cone is convex. It is a unique immutable proper cone in the ambient space of symmetric matrices.

The positive definite (full-rank) matrices comprise the cone interior, while all singular positive semidefinite matrices (having at least one LaTeX: 0 eigenvalue) reside on the cone boundary.

The only symmetric positive semidefinite matrix having all LaTeX: 0 eigenvalues resides at the origin.

In low dimension, the positive semidefinite cone is shown to be a circular cone by way of an isometric isomorphism LaTeX: T relating matrix space to vector space:

  • For a 2×2 symmetric matrix, LaTeX: T is obtained by scaling the ß coordinate by √2 (as in figure). This linear bijective transformation LaTeX: T preserves distance between two points in each respective space; i.e., ||LaTeX: x - y||F = ||LaTeX: Tx - Ty||2 (distance between matrices LaTeX: = distance between vectorized matrices).
  • In one dimension, 1×1 symmetric matrices, the nonnegative ray is a circular cone.

Read more...

Personal tools