Algebraic Relaxations and Hardness Results in Polynomial Optimization and Lyapunov Analysis

Amir Ali Ahmadi

This thesis settles a number of questions related to computational complexity and algebraic, semidefinite programming based relaxations in optimization and control.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment