Optimization over Polynomials for Analysis of Polynomial Vector Fields
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Mustapha Amrani.
Polynomial Optimisation
We present complexity results and semidefinite programming (SDP) based algorithms for stability analysis of polynomial differential equations. We show that deciding asymptotic stability of homogeneous cubic vector fields is strongly NP-hard. We then settle some of the converse questions on existence of polynomial and sum of squares Lyapunov functions.
This talk is part of the Isaac Newton Institute Seminar Series series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|