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

4.10: Exercises to Lecture 4

4.10 Exercises to Lecture 4

4.10.1 Around positive semidefiniteness, eigenvalues, and ?ordering

Criteria for positive semidefiniteness

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:

  1. If A is a symmetric positive semidefinite m m matrix and P is an n m matrix, then the matrix P AP T is positive semidefinite.

  2. A symmetric m m matrix A is positive semidefinite if and only if it can be represented as A = Q ?Q T, where Q is orthogonal (Q TQ = I) and ? is diagonal with nonnegative diagonal entries. What are these entries? What...

UNLIMITED FREE
ACCESS
TO THE WORLD'S BEST IDEAS

SUBMIT
Already a GlobalSpec user? Log in.

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.

Customize Your GlobalSpec Experience

Category: Commercial Matrix Displays
Finish!
Privacy Policy

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.