This paper surveys various linear matrix inequality relaxation techniques f
or evaluating the maximum norm vector within the intersection of several el
lipsoids. This difficult nonconvex optimization problem arises frequently i
n robust control synthesis. Two randomized algorithms and several ellipsoid
al approximations are described. Guaranteed approximation bounds are derive
d in order to evaluate the quality of these relaxations.