{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T18:41:42Z","timestamp":1776364902507,"version":"3.51.2"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T00:00:00Z","timestamp":1550793600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11571234"],"award-info":[{"award-number":["11571234"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"CPSF","award":["NSFC 11701356"],"award-info":[{"award-number":["NSFC 11701356"]}]},{"name":"CPSF","award":["BX201600097"],"award-info":[{"award-number":["BX201600097"]}]},{"name":"CPSF","award":["2016M601562"],"award-info":[{"award-number":["2016M601562"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10898-019-00751-8","type":"journal-article","created":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T23:27:04Z","timestamp":1550791624000},"page":"417-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A hierarchy of semidefinite relaxations for completely positive tensor optimization problems"],"prefix":"10.1007","volume":"75","author":[{"given":"Anwa","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Jinyan","family":"Fan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,22]]},"reference":[{"key":"751_CR1","doi-asserted-by":"publisher","DOI":"10.1142\/5273","volume-title":"Completely Positive Matrices","author":"A Berman","year":"2003","unstructured":"Berman, A., Shaked-Monderer, N.: Completely Positive Matrices. World Scientific, Singapore (2003)"},{"key":"751_CR2","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., Ser. A 120, 479\u2013495 (2009)","journal-title":"Math. Program., Ser. A"},{"key":"751_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/9780470747278","volume-title":"Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multiway Data Analysis and Blind Source Separation","author":"A Cichocki","year":"2009","unstructured":"Cichocki, A., Zdunek, R., Phan, A.H., Amari, S.: Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multiway Data Analysis and Blind Source Separation. Wiley, New York (2009)"},{"key":"751_CR4","first-page":"1","volume-title":"Tensor Decompositions: State of the Art and Applications, Mathematics in Signal Processing, V (Coventry, 2000), Institute for Mathematics and its Apllications Conference Series","author":"P Comon","year":"2002","unstructured":"Comon, P.: Tensor Decompositions: State of the Art and Applications, Mathematics in Signal Processing, V (Coventry, 2000), Institute for Mathematics and its Apllications Conference Series, vol. 71, pp. 1\u201324. Oxford University Press, Oxford (2002)"},{"key":"751_CR5","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/060661569","volume":"30","author":"P Comon","year":"2008","unstructured":"Comon, P., Golub, G., Lim, L.H., Mourrain, B.: Symmetric tensors and symmetric tensor rank. SIAM J. Matrix Anal. Appl. 30, 1254\u20131279 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"751_CR6","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.1137\/140962292","volume":"35","author":"C Cui","year":"2014","unstructured":"Cui, C., Dai, Y., Nie, J.: All real eigenvalues of symmetric tensors. SIAM J. Matrix Anal. Appl. 35, 1582\u20131601 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"751_CR7","first-page":"189","volume":"54","author":"R Curto","year":"2005","unstructured":"Curto, R., Fialkow, L.: Truncated K-moment problems in several variables. J. Oper. Theory 54, 189\u2013226 (2005)","journal-title":"J. Oper. Theory"},{"key":"751_CR8","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10589-013-9594-z","volume":"57","author":"PJ Dickinson","year":"2014","unstructured":"Dickinson, P.J., Gijben, L.: On the computational complexity of membership problems for the completely positive cone and its dual. Comput. Optim. Appl. 57, 403\u2013415 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"751_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-016-9870-9","author":"J Fan","year":"2016","unstructured":"Fan, J., Zhou, A.: A semidefinite algorithm for completely positive tensor decomposition. Comput. Optim. Appl. (2016). \n                    https:\/\/doi.org\/10.1007\/s10589-016-9870-9","journal-title":"Comput. Optim. Appl."},{"key":"751_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1137\/15M1012086","volume":"37","author":"J Fan","year":"2016","unstructured":"Fan, J., Zhou, A.: The CP-matrix approximation problem. SIAM J. Matrix Anal. Appl. 37, 171\u2013194 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"751_CR11","doi-asserted-by":"publisher","first-page":"1682","DOI":"10.1016\/j.jfa.2012.06.004","volume":"263","author":"L Fialkow","year":"2012","unstructured":"Fialkow, L., Nie, J.: The truncated moment problem via homogenization and flat extensions. J. Funct. Anal. 263, 1682\u20131700 (2012)","journal-title":"J. Funct. Anal."},{"key":"751_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/10997703_15","volume-title":"Positive Polynomials in Control","author":"Didier Henrion","year":"2005","unstructured":"Henrion, D., Lasserre, J.: Detecting global optimality and extracting solutions in GloptiPoly, positive polynomials in control. In: Lecture Notes in Control and Information Sciences, vol. 312, pp. 293\u2013310. Springer, Berlin (2005)"},{"key":"751_CR13","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J., Loefberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24, 761\u2013779 (2009)","journal-title":"Optim. Methods Softw."},{"key":"751_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s11425-013-4752-4","volume":"57","author":"Shenglong Hu","year":"2014","unstructured":"Hu, Shenglong, Huang, Zheng-Hai, Qi, Liqun: Strictly nonnegative tensors and nonnegative tensor partition. Sci. China Math. 57, 181\u2013195 (2014)","journal-title":"Sci. China Math."},{"key":"751_CR15","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10898-017-0558-1","volume":"70","author":"X Kuang","year":"2018","unstructured":"Kuang, X., Zuluaga, L.: Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization. J. Glob. Optim. 70, 551\u2013577 (2018)","journal-title":"J. Glob. Optim."},{"key":"751_CR16","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"Tamara G Kolda","year":"2009","unstructured":"Kolda, Tamara G., Bader, Brett W.: Tensor decompositions and applications. SIAM Rev. 51, 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"751_CR17","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1137\/100801482","volume":"32","author":"Tamara G Kolda","year":"2011","unstructured":"Kolda, Tamara G., Mayo, J.R.: Shifted power method for computing tensor eigenpairs. SIAM J. Matrix Anal. Appl. 32, 1095\u20131124 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"751_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-015-0895-0","volume":"151","author":"Tamara G Kolda","year":"2015","unstructured":"Kolda, Tamara G.: Numerical optimization for symmetric tensor decomposition. Math. Program., Ser. B 151, 225\u2013248 (2015)","journal-title":"Math. Program., Ser. B"},{"key":"751_CR19","doi-asserted-by":"publisher","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. Imperial College Press, London (2009)"},{"key":"751_CR20","first-page":"157","volume-title":"Emerging Applications of Algebraic Geometry, IMA Volumes in Mathematics and its Applications","author":"M Laurent","year":"2009","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, IMA Volumes in Mathematics and its Applications, vol. 149, pp. 157\u2013270. Springer, Berlin (2009)"},{"key":"751_CR21","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1137\/15M1025220","volume":"37","author":"Z Luo","year":"2016","unstructured":"Luo, Z., Qi, L.: Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations. SIAM J. Matrix Anal. Appl. 37, 1675\u20131698 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"751_CR22","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1007\/s10208-014-9225-9","volume":"14","author":"J Nie","year":"2014","unstructured":"Nie, J.: The \n                    \n                      \n                    \n                    $$\\cal{A}$$\n                    \n                      \n                        A\n                      \n                    \n                  -truncated K-moment problem. Found. Comput. Math. 14, 1243\u20131276 (2014)","journal-title":"Found. Comput. Math."},{"key":"751_CR23","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-014-0797-6","volume":"153","author":"J Nie","year":"2015","unstructured":"Nie, J.: Linear optimization with cones of moments and nonnegative polynomials. Math. Program., Ser. B 153, 247\u2013274 (2015)","journal-title":"Math. Program., Ser. B"},{"key":"751_CR24","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10107-013-0680-x","volume":"146","author":"J Nie","year":"2014","unstructured":"Nie, J.: Optimality conditions and finite convergence of Lasserre\u2019s hierarchy. Math. Program., Ser. A 146, 97\u2013121 (2014)","journal-title":"Math. Program., Ser. A"},{"key":"751_CR25","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/130935112","volume":"35","author":"J Nie","year":"2014","unstructured":"Nie, J., Wang, L.: Semidefinite relaxations for best rank-1 tensor approximations. SIAM J. Matrix Anal. Appl. 35, 1155\u20131179 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"751_CR26","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10208-015-9291-7","volume":"17","author":"J Nie","year":"2017","unstructured":"Nie, J.: Generating polynomials and symmetric tensor decompositions. Found. Comput. Math. 17, 423\u2013465 (2017)","journal-title":"Found. Comput. Math."},{"key":"751_CR27","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.jco.2006.07.002","volume":"23","author":"J Nie","year":"2007","unstructured":"Nie, J., Schweighofer, M.: On the complexity of Putinar\u2019s Positivstellensatz. J. Complex. 23, 135\u2013150 (2007)","journal-title":"J. Complex."},{"key":"751_CR28","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.C., Zuluaga, L.F.: Completely positive reformulations for polynomial optimization. Math. Program., Ser. B 151, 405\u2013431 (2015)","journal-title":"Math. Program., Ser. B"},{"key":"751_CR29","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putinar","year":"1993","unstructured":"Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42, 969\u2013984 (1993)","journal-title":"Indiana Univ. Math. J."},{"key":"751_CR30","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 an hierarchical elimination algorithm. SIAM J. Matrix Anal. Appl. 35, 1227\u20131241 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"751_CR31","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.laa.2013.03.015","volume":"439","author":"L Qi","year":"2013","unstructured":"Qi, L.: Symmetric nonnegative tensors and copositive tensors. Linear Algebra Appl. 439, 228\u2013238 (2013)","journal-title":"Linear Algebra Appl."},{"key":"751_CR32","doi-asserted-by":"crossref","unstructured":"Shashua, A., Hazan, T.: Non-negative tensor factorization with applications to statistics and computer vision. In: ACM International Conference Proceeding Series: Proceedings of the 22nd International Conference on Machine Learning, vol. 119, pp. 792\u2013799 (2005)","DOI":"10.1145\/1102351.1102451"},{"key":"751_CR33","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/11744085_46","volume-title":"Computer Vision \u2013 ECCV 2006","author":"Amnon Shashua","year":"2006","unstructured":"Shashua, A., Zass, R., Hazan, T.: Multiway clustering using supersymmetric nonnegative tensor factorization. In: Proceedings of the European Conference on Computer Vision, pp. 595\u2013608 (2006)"},{"key":"751_CR34","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11 & 12","author":"J\u00a0F Sturm","year":"1999","unstructured":"Sturm, J\u00a0.F.: SeDuMi 1.02: A MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11 & 12, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"751_CR35","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.laa.2016.08.016","volume":"510","author":"C Xu","year":"2016","unstructured":"Xu, C., Luo, Z., Qi, L., Chen, Z.: \n                    \n                      \n                    \n                    $$\\{0,1\\}$$\n                    \n                      \n                        \n                          {\n                          0\n                          ,\n                          1\n                          }\n                        \n                      \n                    \n                   completely positive tensors and multi-hypergraphs. Linear Algebra Appl. 510, 110\u2013123 (2016)","journal-title":"Linear Algebra Appl."},{"key":"751_CR36","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1137\/130919490","volume":"35","author":"A Zhou","year":"2014","unstructured":"Zhou, A., Fan, J.: The CP-matrix completion problem. SIAM J. Matrix Anal. Appl. 35, 127\u2013142 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00751-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00751-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00751-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T19:07:07Z","timestamp":1582312027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00751-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,22]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["751"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00751-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,22]]},"assertion":[{"value":"2 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}