Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
We consider the problem of computing the global infimum of a real polynomial f on $\mathbb R^n$. Every global minimizer of f lies on its gradient variety, i.e., the algebraic subset of $\mathbb R^n$ where the gradient of f vanishes. If f attains a minimum on $\mathbb R^n$, it is …