Abstract
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.
Similar content being viewed by others
References
Arima, N., Kim, S., Kojima, M.: A quadratically constrained quadratic optimization model for completely positive cone program. SIAM J. Optim. 23, 2320–2340 (2013)
Arima, N., Kim, S., Kojima, M.: Simplified copositive and Lagrangian relaxations for linearly constrained QOPs in continuous and binary variables. Pac. J. Optim. 10, 437–451 (2014)
Bomze, I.M., de Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Glob. Optim. 24, 163–185 (2002)
Burer, S.: On the copositive representation of binary and continuous non-convex quadratic programs. Math. Program. 120, 479–495 (2009)
Eichfelder, G., Povh, J.: On the set-semidefinite representation of non-convex quadratic programs over arbitrary feasible sets. Optim. Lett. 7, 1373–1386 (2013)
Bai, L., Mitchell, J.E., Pang, J.: On QPCCs, QCQPs and copositive programs. Technical report. Rensselaer Polytechnic Institute (2014)
Lasserre, J.B.: Global optimization with polynomials and the problems of moments. SIAM J. Optim. 11, 796–817 (2001)
Peña, J., Vera, J.C., Zuluaga, L.F.: Positive polynomiale on unbounded equality-constrained domains. http://www.optimization-online.org/DB_FILE/2011/05/3047 (2011)
Peña, J., Vera, J.C., Zuluaga, L.F.: Completely positive reformulations for polynomial optimization. Math. Program. 151, 405–431 (2015)
Rockafellar, R.T.: Convex analysis. Princeton University Press, Princeton (1970)
Rockafellar, R.T., Wets, R.: Variational analysis. Springer, Berlin (1998)
Acknowledgments
The research of Sunyoung Kim was supported by NRF 2012-R1A1A2-038982 and NRF 2014-R1A2A1A11049618.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Arima, N., Kim, S. & Kojima, M. Extension of Completely Positive Cone Relaxation to Moment Cone Relaxation for Polynomial Optimization. J Optim Theory Appl 168, 884–900 (2016). https://doi.org/10.1007/s10957-015-0794-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-015-0794-9