Random search of stable member in a matrix polytope

Given a matrix polytope we consider the existence problem of a stable member in it. We suggest an algorithm in which part of uncertainty parameters is chosen randomly. Applications to affine families and 3×33×3 interval families are considered. A necessary and sufficient condition for the existence of a stable member is given for general interval families with nonnegative off-diagonal intervals.