I'm reading texts about optimization when given a set of polynomial constraints, like $f_1=\cdots=f_m=0$ and $q_1\ge 0,\ldots,q_\ell\ge 0$, over the reals.
I have encountered statements about "the cone" of a polynomial or a set of polynomials.
For example, sometimes the cone is defined to be the minimal set $C$ that contains a given collection $f_1,...,f_m$ of polynomials, such that if $g,h\in C$ then $g\cdot h\in C$, and $ag+bh\in C$, for $a,b$ positive scalars in $\mathbb{R}$. Here is an example use of the term cone that is undefined: here
Question: What is a cone (in the context of polynomial equations, optimization and SDP)? What is $\operatorname{cone}(f)$ for $f$ a polynomial? And what is $\operatorname{cone}(S)$ for $S$ a set of polynomials?