加载中…
2012-01-13
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本