Chapter 3: Polynomial Optimization, Sums of Squares, and Applications

Pablo A. ParriloSociety 2012 · DOI · OpenAlex

Abstract

We begin the study of one of the main themes of the book, namely, the relationships between nonnegative polynomials, sums of squares, and semidefinite programming. The two key ideas around which this chapter is structured are sum of squares decompositions of polynomials can be computed using semidefinite programming, and the search for infeasibility certificates for real polynomial systems is a convex problem. Given an upper bound on the degree of the certificates, they can be found by solving a sum of squares program.
BibTeX
@inproceedings{parrilo2012chapter,
  author = {Pablo A. Parrilo},
  title = {{Chapter 3: Polynomial Optimization, Sums of Squares, and Applications}},
  booktitle = {Society},
  year = {2012},
  doi = {10.1137/1.9781611972290.ch3},
}

Loading related content...

Figure