Algebraic Relaxations and Hardness Results in Polynomial Optimization   and Lyapunov Analysis
  This thesis settles a number of questions related to computational complexity and algebraic, semidefinite programming based relaxations in optimization and control. 
Amir Ali Ahmadi
math.OC cs.CC cs.DS