Polynomial optimization with applications to stability analysis and control - Alternatives to sum of squares

Reza Kamyar, Matthew Peet

Research output: Contribution to journalArticlepeer-review

27 Scopus citations


In this paper, we explore the merits of various algorithms for solving polynomial optimization and optimization of polynomials, focusing on alternatives to sum of squares programming. While we refer to advantages and disadvantages of Quantifier Elimination, Reformulation Linear Techniques, Blossoming and Groebner basis methods, our main focus is on algorithms defined by Polya's theorem, Bernstein's theorem and Handelman's theorem. We first formulate polynomial optimization problems as verifying the feasibility of semi-algebraic sets. Then, we discuss how Polya's algorithm, Bernstein's algorithm and Handelman's algorithm reduce the intractable problem of feasibility of semi-algebraic sets to linear and/or semi-definite programming. We apply these algorithms to different problems in robust stability analysis and stability of nonlinear dynamical systems. As one contribution of this paper, we apply Polya's algorithm to the problem of H control of systems with parametric uncertainty. Numerical examples are provided to compare the accuracy of these algorithms with other polynomial optimization algorithms in the literature.

Original languageEnglish (US)
Pages (from-to)2383-2417
Number of pages35
JournalDiscrete and Continuous Dynamical Systems - Series B
Issue number8
StatePublished - Oct 1 2015


  • Convex optimization
  • Handelman's theorem
  • Lyapunov stability analysis
  • Polya's theorem
  • Polynomial optimization

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Polynomial optimization with applications to stability analysis and control - Alternatives to sum of squares'. Together they form a unique fingerprint.

Cite this