Algebraic Relaxations and Hardness Results in Polynomial Optimization and Lyapunov Analysis

Details Algebraic Relaxations and Hardness Results in Polynomial Optimization and Lyapunov Analysis Algebraic Relaxations and Hardness Results in Polynomial Optimization and Lyapunov Analysis

2012-01-13

arxiv.org/abs/1201.2892v1

Mathematics

Optimization and Control

PhD Thesis, MIT, September, 2011

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Algebraic Relaxations and Hardness Results in Polynomial Optimization and Lyapunov Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algebraic Relaxations and Hardness Results in Polynomial Optimization and Lyapunov Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic Relaxations and Hardness Results in Polynomial Optimization and Lyapunov Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-472087