the talk will give an introduction to this new branch of compressed sensing. one has an affine subspace intersect the positive semideinite (psd) matrices and wishes to find a smallest rank matrix therein. this is a highly nonconvex problem. minimizing the trace is a convex problem which often gives the correct answer. there is an elegant probablistic analysis which applies in some situations. the talk gives an exposition of this.