Title:  Rank Minimization over Affine Sets (II)

                 	Ben Recht
   Center for the Mathematics of Information
       California Institute of Technology

ABSTRACT:  Last week I presented a heuristic for the affine rank
minimization problem and showed that if a certain restricted isometry
property held for the affine set then the heuristic succeeded.  This week I
will present a collection of random affine sets for which the restricted
isometry property holds with overwhelming probability.  I will also discuss
algorithmic approaches for solving the rank minimization heuristic
efficiently.