Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications

Recall the criterion of positive definiteness of a symmetric matrix:
[Sylvester's Rule] A symmetric m m matrix A = [a ij] m i,j =1 is positive definite if and only if all angular minors
are positive.
| Exercise 4.1. | Prove that a symmetric m m matrix A is positive semidefinite if and only if all its principal minors (i.e., determinants of square submatrices symmetric with respect to the diagonal) are nonnegative. Hint. Look at the angular minors of the matrices A + ? I n for small positive ?. Demonstrate by an example that nonnegativity of angular minors of a symmetric matrix is not sufficient for the positive semidefiniteness of the matrix. |
|
| Exercise 4.2. | Diagonal-dominant matrices. Let a symmetric matrix A = [a ij] m i,j =1 satisfy the relation Prove that A is positive semidefinite. Diagonalization |
|
| Exercise 4.3. | Prove the following standard facts from linear algebra:
|