Linear matrix inequalities (LMIs) comprise a large class of convex constraints. Boxes, ellipsoids, and linear constraints can be represented by LMIs. The intersection of LMIs are also classified as LMIs. Interior-point methods are able to minimize or maximize any linear criterion of LMIs with complexity, which is polynomial regarding to the number of variables. As a consequence, as shown in this paper, it is possible to build optimal contractors for sets represented by LMIs. When solving a set of nonlinear constraints, one may extract from all constraints that are LMIs in order to build a single optimal LMI contractor. A combination of all contractors obtained for other non-LMI constraints can thus be performed up to the fixed point. The resulting propogation is shown to be more efficient than other conventional contractor-based approaches. Read More: http://ascelibrary.org/doi/abs/10.1115/1.4030781