Algebraic Relaxations and Hardness Results in Polynomial Optimization and Lyapunov Analysis
Abstract
This thesis settles a number of questions related to computational complexity and algebraic, semidefinite programming based relaxations in optimization and control.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.