{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:47Z","timestamp":1740124007255,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,8,13]],"date-time":"2015-08-13T00:00:00Z","timestamp":1439424000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (KR)","doi-asserted-by":"publisher","award":["2012-R1A1A2-038982,2014-R1A2A1A11049618"],"award-info":[{"award-number":["2012-R1A1A2-038982,2014-R1A2A1A11049618"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10957-015-0794-9","type":"journal-article","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T11:49:29Z","timestamp":1439380169000},"page":"884-900","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Extension of Completely Positive Cone Relaxation to Moment Cone Relaxation for Polynomial Optimization"],"prefix":"10.1007","volume":"168","author":[{"given":"Naohiko","family":"Arima","sequence":"first","affiliation":[]},{"given":"Sunyoung","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Masakazu","family":"Kojima","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"key":"794_CR1","doi-asserted-by":"crossref","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 program. SIAM J. Optim. 23, 2320\u20132340 (2013)","journal-title":"SIAM J. Optim."},{"key":"794_CR2","first-page":"437","volume":"10","author":"N Arima","year":"2014","unstructured":"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\u2013451 (2014)","journal-title":"Pac. J. Optim."},{"key":"794_CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., de Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Glob. Optim. 24, 163\u2013185 (2002)","journal-title":"J. Glob. Optim."},{"key":"794_CR4","doi-asserted-by":"crossref","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 non-convex quadratic programs. Math. Program. 120, 479\u2013495 (2009)","journal-title":"Math. Program."},{"key":"794_CR5","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1007\/s11590-012-0450-3","volume":"7","author":"G Eichfelder","year":"2013","unstructured":"Eichfelder, G., Povh, J.: On the set-semidefinite representation of non-convex quadratic programs over arbitrary feasible sets. Optim. Lett. 7, 1373\u20131386 (2013)","journal-title":"Optim. Lett."},{"key":"794_CR6","unstructured":"Bai, L., Mitchell, J.E., Pang, J.: On QPCCs, QCQPs and copositive programs. Technical report. Rensselaer Polytechnic Institute (2014)"},{"key":"794_CR7","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problems of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"794_CR8","unstructured":"Pe\u00f1a, 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)"},{"key":"794_CR9","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10107-014-0822-9","volume":"151","author":"J Pe\u00f1a","year":"2015","unstructured":"Pe\u00f1a, J., Vera, J.C., Zuluaga, L.F.: Completely positive reformulations for polynomial optimization. Math. Program. 151, 405\u2013431 (2015)","journal-title":"Math. Program."},{"key":"794_CR10","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex analysis. Princeton University Press, Princeton (1970)"},{"key":"794_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.: Variational analysis. Springer, Berlin (1998)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-015-0794-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-015-0794-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-015-0794-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:58:44Z","timestamp":1559455124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-015-0794-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,13]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["794"],"URL":"https:\/\/doi.org\/10.1007\/s10957-015-0794-9","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2015,8,13]]}}}