Home
Wikimization
Contact Us
Accumulator error feedback
CVX Download
Calculus of Inequalities
Chromosome Structure EDM
Complementarity problem
Compressive Sampling
Compressed Sensing
Conic Independence
Convex Cones
Convex Functions
Convex Geometry
Convex Optimization
Convex Iteration
Convex, Affine, Conic Hulls
Convex Optimization Group
Distance Geometry
Distance Matrix Cone
Dual Cones
Duality Gap
Eigenvalues/Eigenvectors
Elliptope and Fantope
Euclidean Distance Matrices
EDM cone faces
Extreme Directions
Face Recognition
Farkas Lemma
Fermat point
Fifth Metric Property
Jensen's Inequality
Jobs in Optimization
Kissing Number
Harold W. Kuhn
Linear Algebra
Linear Matrix Inequality
Manifold Learning
MATLAB for Optimization
Matrix Calculus
Molecular Conformation
Moreau's theorem
Isaac Newton
Angelia Nedic
Open Problems
Positive Matrix Factorization
Positive Semidefinite Cone
Projection
Projection on Cone
Proximity Problems
PY4SCIENCE
Quasiconvex Functions
Rank Constraint
Rockafellar
Michael Saunders
Schoenberg Criterion
Semidefinite Programming
Sensor Network Localization
SEO Consultant
Smallest Simplex
Systems Optimization Lab
Talks on Optimization
Video
Wikimization     Meboo     SOL      Video     CVX     Contact     
Felice crystal
Home arrow Positive Semidefinite Cone
Positive Semidefinite Cone

"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."

     positive semidefinite cone


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 from the 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 0 eigenvalue) reside on the cone boundary.

The only symmetric positive semidefinite matrix having all zero eigenvalues resides at the origin.

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 √2 (as in figure). This linear bijective transformation T preserves distance between two points in each respective space; i.e., ||x - y||F = ||Tx - Ty||2 (distance between matrices equals distance between vectorized matrices). In one dimension, the nonnegative ray is a circular cone.

Read more...

 
Course,   Video
Convex Optimization
     convex optimization
Stephen Boyd 
L. Vandenberghe 


Dattorro      convex optimization & Euclidean distance geometry
Dattorro


Course
Bertsekas
     books by Bertsekas
Dimitri Bertsekas 


See Inside Hiriart-Urruty & Lemaréchal
Hiriart-Urruty
& Lemaréchal


See Inside
Rockafellar Rockafellar

     
Optimization Newsletter
Subscription:

Email:

Receive HTML mailings?
Subscribe Unsubscribe