{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:41:55Z","timestamp":1761896515884,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T00:00:00Z","timestamp":1488758400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T00:00:00Z","timestamp":1488758400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1300193"],"award-info":[{"award-number":["CMMI-1300193"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s11590-017-1123-z","type":"journal-article","created":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T19:33:33Z","timestamp":1488828813000},"page":"1229-1241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Completely positive reformulations of polynomial optimization problems with linear constraints"],"prefix":"10.1007","volume":"11","author":[{"given":"Wei","family":"Xia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis F.","family":"Zuluaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,6]]},"reference":[{"key":"1123_CR1","doi-asserted-by":"publisher","first-page":"2320","DOI":"10.1137\/120890636","volume":"23","author":"N Arima","year":"2013","unstructured":"Arima, N., Kim, S., Kojima, M.: A quadratically constrained quadratic optimization model for completely positive cone programming. SIAM J. Optim. 23, 2320\u20132340 (2013)","journal-title":"SIAM J. Optim."},{"key":"1123_CR2","unstructured":"Arima, N., Kim, S., Kojima, M.: Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization. J. Optim. Theory Appl. 168(3), 1\u201317 (2016)"},{"key":"1123_CR3","doi-asserted-by":"crossref","unstructured":"Bai, L., Mitchell, J.E., Pang, J.: On conic qpccs, conic qcqps and completely positive programs. Math. Program. 159(1\u20132), 1\u201328 (2016)","DOI":"10.1007\/s10107-015-0951-9"},{"key":"1123_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.ejor.2011.04.026","volume":"216","author":"IM Bomze","year":"2012","unstructured":"Bomze, I.M.: Copositive optimization-recent developments and applications. Eur. J. Oper. Res. 216, 509\u2013520 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"1123_CR5","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10898-011-9749-3","volume":"52","author":"IM Bomze","year":"2012","unstructured":"Bomze, I.M., Schachinger, W., Uchida, G.: Think co (mpletely) positive! matrix properties, examples and a clustered bibliography on copositive optimization. J. Glob. Optim. 52, 423\u2013445 (2012)","journal-title":"J. Glob. Optim."},{"key":"1123_CR6","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120, 479\u2013495 (2009)","journal-title":"Math. Program."},{"key":"1123_CR7","doi-asserted-by":"crossref","unstructured":"Burer, S.: Copositive programming. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, pp. 201\u2013218. Springer, New York (2012)","DOI":"10.1007\/978-1-4614-0769-0_8"},{"key":"1123_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.orl.2012.02.001","volume":"40","author":"S Burer","year":"2012","unstructured":"Burer, S., Dong, H.: Representing quadratically constrained quadratic programs as generalized copositive programs. Oper. Res. Lett. 40, 203\u2013206 (2012)","journal-title":"Oper. Res. Lett."},{"key":"1123_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/110834524","volume":"22","author":"B Chen","year":"2012","unstructured":"Chen, B., He, S., Li, Z., Zhang, S.: Maximum block improvement and polynomial optimization. SIAM J. Optim. 22, 87\u2013107 (2012)","journal-title":"SIAM J. Optim."},{"key":"1123_CR10","doi-asserted-by":"publisher","first-page":"1850","DOI":"10.1137\/100813816","volume":"23","author":"H Dong","year":"2013","unstructured":"Dong, H.: Symmetric tensor approximation hierarchies for the completely positive cone. SIAM J. Optim. 23, 1850\u20131866 (2013)","journal-title":"SIAM J. Optim."},{"key":"1123_CR11","unstructured":"D\u00fcr, M.: Copositive programming\u2013a survey. In: Diehl, M., Glineur, F., Jarlebring, E., Michiels, W. (eds.) Recent Advances in Optimization and its Applications in Engineering, pp. 3\u201320. Springer, Berlin, Heidelberg (2010)"},{"key":"1123_CR12","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"1123_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10898-008-9394-7","volume":"45","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J.B.: Moments and sums of squares for polynomial optimization and related problems. J. Glob. Optim. 45, 39\u201361 (2009a)","journal-title":"J. Glob. Optim."},{"key":"1123_CR14","doi-asserted-by":"crossref","DOI":"10.1142\/p665","volume-title":"Moments, Positive Polynomials and Their Applications","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J.B.: Moments, Positive Polynomials and Their Applications, vol. 1. World Scientific, Singapore (2009b)"},{"key":"1123_CR15","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, pp. 157\u2013270. Springer, Berlin (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"1123_CR16","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s11425-014-4930-z","volume":"58","author":"Z Luo","year":"2015","unstructured":"Luo, Z., Qi, L., Ye, Y.: Linear operators and positive semidefiniteness of symmetric tensor spaces. Sci. China Math. 58, 197\u2013212 (2015)","journal-title":"Sci. China Math."},{"key":"1123_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is np-hard. J. Glob. Optim. 1, 15\u201322 (1991)","journal-title":"J. Glob. Optim."},{"key":"1123_CR18","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10107-014-0822-9","volume":"151","author":"J Pe\u00f1a","year":"2015","unstructured":"Pe\u00f1a, J., Vera, J., Zuluaga, L.F.: Completely positive reformulations for polynomial optimization. Math. Program. 151, 405\u2013431 (2015)","journal-title":"Math. Program."},{"key":"1123_CR19","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1137\/13092232X","volume":"35","author":"L Qi","year":"2014","unstructured":"Qi, L., Xu, C., Xu, Y.: Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm. SIAM J. Matrix Anal. Appl. 35, 1227\u20131241 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1123_CR20","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis, vol. 317. Springer, Berlin (2009)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1123-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1123-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1123-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T17:46:36Z","timestamp":1589651196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1123-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,6]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["1123"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1123-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2017,3,6]]},"assertion":[{"value":"9 June 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}