{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T18:41:44Z","timestamp":1776364904063,"version":"3.51.2"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T00:00:00Z","timestamp":1473724800000},"content-version":"unspecified","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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10589-016-9870-9","type":"journal-article","created":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T13:57:43Z","timestamp":1473775063000},"page":"267-283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A semidefinite algorithm for completely positive tensor decomposition"],"prefix":"10.1007","volume":"66","author":[{"given":"Jinyan","family":"Fan","sequence":"first","affiliation":[]},{"given":"Anwa","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,13]]},"reference":[{"key":"9870_CR1","doi-asserted-by":"crossref","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":"9870_CR2","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 nonconvex quadratic programs. Math. Programm. Ser. A 120, 479\u2013495 (2009)","journal-title":"Math. Programm. Ser. A"},{"key":"9870_CR3","doi-asserted-by":"crossref","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":"9870_CR4","doi-asserted-by":"crossref","unstructured":"Comon, P.: Tensor decompositions: state of the art and applications. Math. Signal Process. V (Coventry, 2000), 1\u201324, The Institute of Mathematics and its Applications Conference Series, New Series 71, Oxford University Press, Oxford (2002)","DOI":"10.1093\/oso\/9780198507345.003.0001"},{"key":"9870_CR5","doi-asserted-by":"crossref","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":"9870_CR6","doi-asserted-by":"crossref","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":"9870_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":"9870_CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971446","volume-title":"Applied Numerical Linear Algebra","author":"J Demmel","year":"1997","unstructured":"Demmel, J.: Applied Numerical Linear Algebra. SIAM, Philadelphia (1997)"},{"key":"9870_CR9","doi-asserted-by":"crossref","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":"9870_CR10","doi-asserted-by":"crossref","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":"9870_CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"PE Gill","year":"2005","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47, 99\u2013131 (2005)","journal-title":"SIAM Rev."},{"key":"9870_CR12","volume-title":"Users Guide for SNOPT Version 7: Software for Large-Scale Nonlinear Programming","author":"PE Gill","year":"2008","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: Users Guide for SNOPT Version 7: Software for Large-Scale Nonlinear Programming. University of California, San Diego (2008)"},{"key":"9870_CR13","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"9870_CR14","doi-asserted-by":"crossref","unstructured":"Henrion, D., Lasserre, J.: Detecting Global Optimality and Extracting Solutions in GloptiPoly, Positive Polynomials in Control, Lecture Notes in Control and Information Sciences, vol. 312, pp. 293\u2013310. Springer, Berlin (2005)","DOI":"10.1007\/10997703_15"},{"key":"9870_CR15","doi-asserted-by":"crossref","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":"9870_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s11425-013-4752-4","volume":"57","author":"SL Hu","year":"2014","unstructured":"Hu, S.L., Huang, Z.H., Qi, L.Q.: Strictly nonnegative tensors and nonnegative tensor partition. Sci. China Math. 57, 181\u2013195 (2014)","journal-title":"Sci. China Math."},{"key":"9870_CR17","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51, 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"9870_CR18","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1137\/100801482","volume":"32","author":"TG Kolda","year":"2011","unstructured":"Kolda, T.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":"9870_CR19","doi-asserted-by":"crossref","unstructured":"Kuang, D., Ding, C., Park, H.: Symmetric nonnegative matrix factorization for graph clustering. In: Proceedings of 2012 SIAM International Conference on Data Mining (SDM \u201912), Anaheim, CA, pp. 106\u2013117 (2012)","DOI":"10.1137\/1.9781611972825.10"},{"key":"9870_CR20","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 problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"9870_CR21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10107-006-0085-1","volume":"112","author":"JB Lasserre","year":"2008","unstructured":"Lasserre, J.B.: A semidefinite programming approach to the generalized problem of moments. Math. Programm. Ser. B 112, 65\u201392 (2008)","journal-title":"Math. Programm. Ser. B"},{"key":"9870_CR22","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. Imperial College Press, Singapore (2009)"},{"key":"9870_CR23","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, Vol. 149 of IMA Volumes in Mathematics and Its Applications, pp. 157\u2013270. Springer, New York (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"9870_CR24","unstructured":"Luo, Z., Qi, L.: Doubly nonnegative tensors and completely positive tensors, arXiv:1504.07806 (2015)"},{"key":"9870_CR25","doi-asserted-by":"crossref","unstructured":"Nie, J.: The $${\\cal A}$$ A -truncated K-moment problem. Found. Comput. Math. 14, 1243\u20131276 (2014)","DOI":"10.1007\/s10208-014-9225-9"},{"key":"9870_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9291-7","author":"J Nie","year":"2014","unstructured":"Nie, J.: Generating polynomials and symmetric tensor decompositions. Found. Comput. Math. (2014). doi: 10.1007\/s10208-015-9291-7","journal-title":"Found. Comput. Math."},{"key":"9870_CR27","doi-asserted-by":"crossref","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. Programm. Ser. B 153, 247\u2013274 (2015)","journal-title":"Math. Programm. Ser. B"},{"key":"9870_CR28","doi-asserted-by":"crossref","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":"9870_CR29","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. Programm. Ser. B 151, 405\u2013431 (2015)","journal-title":"Math. Programm. Ser. B"},{"key":"9870_CR30","doi-asserted-by":"crossref","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":"9870_CR31","doi-asserted-by":"crossref","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 Its Appl. 439, 228\u2013238 (2013)","journal-title":"Linear Algebra Its Appl."},{"key":"9870_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":"9870_CR33","unstructured":"Sturm, J.F.: SeDuMi 1.02: A MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11 & 12, 625\u2013653 (1999)"},{"key":"9870_CR34","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-015-0895-0","volume":"151","author":"G Tamara","year":"2015","unstructured":"Tamara, G.: Numerical optimization for symmetric tensor decomposition. Math. Programm. Ser. B 151, 225\u2013248 (2015)","journal-title":"Math. Programm. Ser. B"},{"key":"9870_CR35","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0024-3795(03)00611-6","volume":"379","author":"C Xu","year":"2004","unstructured":"Xu, C.: Completely positive matrices. Linear Algebra Its Appl. 379, 319\u2013327 (2004)","journal-title":"Linear Algebra Its Appl."},{"key":"9870_CR36","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1137\/130919490","volume":"35","author":"AW Zhou","year":"2014","unstructured":"Zhou, A.W., Fan, J.Y.: The CP-matrix completion problem. SIAM J. Matrix Anal. Appl. 35, 127\u2013142 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9870_CR37","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/s10898-015-0309-0","volume":"63","author":"AW Zhou","year":"2015","unstructured":"Zhou, A.W., Fan, J.Y.: Interiors of completely positive cones. J. Glob. Optim. 63, 653\u2013675 (2015)","journal-title":"J. Glob. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9870-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9870-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9870-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T10:03:44Z","timestamp":1718791424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9870-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,13]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["9870"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9870-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,13]]}}}