Several problems relevant to robust analysis and design of control systems can be formulated in terms of positivity of polynomial forms. Sufficient conditions for testing positivity of polynomials have been recently cast as LMI feasibility tests, thus providing the theoretical basis to devise families of convex relaxations for several classes of nonconvex problems. Therefore, it is now possible to tackle such problems by exploiting efficient convex optimization tools.