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

Lecture 4: Semidefinite Programming

In this lecture we study semidefinite programming (SDP), a generic conic program with a vast area of applications.

4.1 Semidefinite cone and semidefinite programs

4.1.1 Preliminaries

Let S m be the space of symmetric m m matrices and M m,n be the space of rectangular m n matrices with real entries. From the viewpoint of their linear structure (i.e., the operations of addition and multiplication by reals), S m is just the arithmetic linear space R m(m+1)/2 of dimension by arranging the elements of a symmetric m m matrix X in a single column, say, in row-by-row order, you get a usual m 2-dimensional column vector; multiplication of a matrix by a real and addition of matrices correspond to the same operations with the representing vector(s). When X runs through S m, the vector representing X runs through m( m + 1)/2-dimensional subspace of R m 2 consisting of vectors satisfying the symmetry condition-the coordinates coming from symmetric to each other pairs of entries in X are equal to each other. Similarly, M m,n as a linear space is just R m,n, and it is natural to equip M m,n with the inner product defined as the usual inner product of the vectors representing the matrices:


Here Tr stands for the trace-the sum of diagonal elements of a (square) matrix. With this inner...

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: Focal Plane Arrays
Finish!
Privacy Policy

This is embarrasing...

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