Optimization problems with polynomial have wide applications in
industry and engineering and are very hard to solve due to
nonconvexity of the objective function and/or the feasible set.
Recently, some relaxation methods for this class of problems are
proposed such as linear programming approximation and
semi-definite programming approximation. We will study some
new relaxation strategies for the problems.