The positive semidefinite cone in the real vector space of symmetric matrices is
Equivalently, every eigenvalue is nonnegative. Nonnegative combinations preserve each quadratic-form inequality, proving convexity and the cone property. For each fixed the test is continuous, so their intersection is closed.[ref]
Positive semidefiniteness is different from entrywise nonnegativity. The matrix
is positive semidefinite because its quadratic form is , despite its negative off-diagonal entries. Conversely, the entrywise positive matrix with diagonal one and off-diagonal two is indefinite: its quadratic form at is negative.
For a -by- symmetric matrix , the condition is and . This is equivalent to
a second-order cone condition. Larger matrix constraints are central to semidefinite programming. The cone is a self-dual cone under the Frobenius inner product, while the copositive cone only tests nonnegative vectors.
The set of real positive semidefinite matrices with unit diagonal. Equivalently, its members are Gram matrices of unit vectors, by the real spectral theorem. Every two-by-two principal minor gives , so the set is bounded; it is also closed, hence compact in finite dimension. This gives attainment of linear objectives used in semidefinite programming.
For an integer , the fantope is the convex hull of rank- orthogonal projection matrices in . Equivalently, it consists of real symmetric matrices with eigenvalues in and matrix trace . To prove the equivalence, apply the spectral theorem for real symmetric matrices and express the eigenvalue vector as a convex combination of the zero-one extreme points of the capped simplex. The sum of the largest eigenvalues is its support function.
For a positive semidefinite matrix, a trace bound is a bound on the sum of its nonnegative eigenvalues.
The positive semidefinite trace ball of radius is
It is closed and convex, and for every .
Let be a real symmetric matrix with eigenpairs , and take trace radius . Its Frobenius norm projection onto the positive semidefinite trace ball is obtained by thresholding its eigenvalues. If , the projection is zero. If , it is . Otherwise and
In this last case is unique: the left side is continuous, strictly decreasing while positive, starts above at zero and reaches zero at .
To prove the reduction, use an orthonormal eigenbasis of . Replacing a feasible matrix by its diagonal part in that basis preserves nonnegative diagonal entries and the trace, hence remains positive semidefinite, while deleting off-diagonal entries decreases the squared Frobenius distance. The problem becomes projection of onto . Its multiplier equations give with the stated inactive-constraint case.
For and , the threshold gives . At radius zero the threshold itself need not be unique, although the projected matrix is; this is why that case is stated separately.

Articles by others on the same topic (0)

There are currently no matching articles.