Approximation of the Stability Number of a Graph via Copositive Programming
SIAM Journal on Optimization
On the complexity of Schmüdgen's positivstellensatz
Journal of Complexity
Optimization of Polynomials on Compact Semialgebraic Sets
SIAM Journal on Optimization
A quantitative Pólya's Theorem with corner zeros
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Journal of Symbolic Computation
Stabilizing polynomial approximation of explicit MPC
Automatica (Journal of IFAC)
Hi-index | 0.00 |
We consider homogeneous polynomials f@?R[x"1,...,x"n] which are non-negative on the standard simplex in R^n, and we obtain sufficient conditions for such an f to be Polya semi-positive, that is, all the coefficients of (x"1+...+x"n)^Nf are non-negative for all sufficiently large positive integers N. Such sufficient conditions are expressed in terms of the vanishing orders of the monomial terms of f along the faces of the simplex. Our result also gives effective estimates on N under such conditions. Moreover, we also show that any Polya semi-positive polynomial necessarily satisfies a slightly weaker condition. In particular, our results lead to a simple characterization of the Polya semi-positive polynomials in the low dimensional case when n=