We propose the moment cone relaxation for a class of polynomial optimization problems to extend the results on the completely positive cone programming relaxation for the quadratic optimization model by Arima, Kim and Kojima. The moment cone relaxation is constructed to take advantage of sparsity of the polynomial optimization problems, so that efficient numerical methods can be developed in the future. We establish the equivalence between the optimal value of the polynomial optimization problem and that of the moment cone relaxation under conditions similar to the ones assumed in the quadratic optimization model.
- Completely positive programming
- Copositive programming
- Moment cone relaxation
- Polynomial optimization