Algebraic Relaxations and Hardness Results in Polynomial Optimization and Lyapunov Analysis

preprint2012arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.