A brief introduction to sums of squares (Q6573218)

This chapter from the book \textit{Sum of squares: theory and applications} provides an introduction to the theory of nonnegative polynomials and the sums of squares (SOS) cone, emphasizing its historical evolution and theoretical foundations. It serves as an effective guide for understanding how the subsequent chapters build upon the concepts introduced here.\N\NThe chapter addresses two central questions:\N\begin{itemize}\N\item[1.] Are representations of nonnegative polynomials as SOS always possible?\N\item[2.] If a polynomial is a sum of squares, how can its SOS decomposition be found?\N\end{itemize}\N\NThe author presents known results related to these questions. In particular, the connection between SOS cones and the cones of positive semidefinite matrices is illustrated in this chapter. In addition, the chapter introduces related topics such as the degree bounds for SOS certificates, the relationships between SOS and semidefinite programming (SDP), and optimization problems involving constraints defined by algebraic sets (given by polynomial equalities) or semialgebraic sets (given by polynomial inequalities).\N\NFor the entire collection see [Zbl 1451.11010].