  In this article we provide an experimental algorithm that in many cases gives
us an upper bound of the global infimum of a real polynomial on $\R^{n}$. It is
very well known that to find the global infimum of a real polynomial on
$\R^{n}$, often reduces to solve a hierarchy of positive semidefinite programs,
called moment relaxations. The algorithm that we present involves to solve a
series of positive semidefinite programs whose feasible set is included in the
feasible set of a moment relaxation. Our additional constraint try to provoke a
flatness condition, like used by Curto and Fialkow, for the computed moments.
At the end we present numerical results of the application of the algorithm to
nonnegative polynomials which are not sums of squares. We also provide
numerical results for the application of a version of the algorithm based on
the method proposed by Nie, Demmel and Sturmfels for the problem of minimizing
a polynomial over its gradient variety.
