Abstract
A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. In this paper, we characterize the completely positive tensor as a truncated moment sequence, and transform the problem of checking whether a tensor is completely positive to checking whether its corresponding truncated moment sequence admits a representing measure, then present a semidefinite algorithm to solve it. If a tensor is not completely positive, a certificate for it can be obtained; if it is completely positive, a nonnegative decomposition can be obtained.
Similar content being viewed by others
References
Berman, A., Shaked-Monderer, N.: Completely Positive Matrices. World Scientific, Singapore (2003)
Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Programm. Ser. A 120, 479–495 (2009)
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)
Comon, P.: Tensor decompositions: state of the art and applications. Math. Signal Process. V (Coventry, 2000), 1–24, The Institute of Mathematics and its Applications Conference Series, New Series 71, Oxford University Press, Oxford (2002)
Comon, P., Golub, G., Lim, L.H., Mourrain, B.: Symmetric tensors and symmetric tensor rank. SIAM J. Matrix Anal. Appl. 30, 1254–1279 (2008)
Cui, C., Dai, Y., Nie, J.: All real eigenvalues of symmetric tensors. SIAM J. Matrix Anal. Appl. 35, 1582–1601 (2014)
Curto, R., Fialkow, L.: Truncated K-moment problems in several variables. J. Oper. Theory 54, 189–226 (2005)
Demmel, J.: Applied Numerical Linear Algebra. SIAM, Philadelphia (1997)
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–415 (2014)
Fialkow, L., Nie, J.: The truncated moment problem via homogenization and flat extensions. J. Funct. Anal. 263, 1682–1700 (2012)
Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47, 99–131 (2005)
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)
Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)
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–310. Springer, Berlin (2005)
Henrion, D., Lasserre, J., Loefberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24, 761–779 (2009)
Hu, S.L., Huang, Z.H., Qi, L.Q.: Strictly nonnegative tensors and nonnegative tensor partition. Sci. China Math. 57, 181–195 (2014)
Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51, 455–500 (2009)
Kolda, T.G., Mayo, J.R.: Shifted power method for computing tensor eigenpairs. SIAM J. Matrix Anal. Appl. 32, 1095–1124 (2011)
Kuang, D., Ding, C., Park, H.: Symmetric nonnegative matrix factorization for graph clustering. In: Proceedings of 2012 SIAM International Conference on Data Mining (SDM ’12), Anaheim, CA, pp. 106–117 (2012)
Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796–817 (2001)
Lasserre, J.B.: A semidefinite programming approach to the generalized problem of moments. Math. Programm. Ser. B 112, 65–92 (2008)
Lasserre, J.B.: Moments Positive Polynomials and Their Applications. Imperial College Press, Singapore (2009)
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–270. Springer, New York (2009)
Luo, Z., Qi, L.: Doubly nonnegative tensors and completely positive tensors, arXiv:1504.07806 (2015)
Nie, J.: The \({\cal A}\)-truncated K-moment problem. Found. Comput. Math. 14, 1243–1276 (2014)
Nie, J.: Generating polynomials and symmetric tensor decompositions. Found. Comput. Math. (2014). doi:10.1007/s10208-015-9291-7
Nie, J.: Linear optimization with cones of moments and nonnegative polynomials. Math. Programm. Ser. B 153, 247–274 (2015)
Nie, J., Wang, L.: Semidefinite relaxations for best rank-1 tensor approximations. SIAM J. Matrix Anal. Appl. 35, 1155–1179 (2014)
Peña, J., Vera, J.C., Zuluaga, L.F.: Completely positive reformulations for polynomial optimization. Math. Programm. Ser. B 151, 405–431 (2015)
Qi, L., Xu, C., Xu, Y.: Nonnegative tensor factorization, completely positive tensors and an hierarchical elimination algorithm. SIAM J. Matrix Anal. Appl. 35, 1227–1241 (2014)
Qi, L.: Symmetric nonnegative tensors and copositive tensors. Linear Algebra Its Appl. 439, 228–238 (2013)
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–799 (2005)
Sturm, J.F.: SeDuMi 1.02: A MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11 & 12, 625–653 (1999)
Tamara, G.: Numerical optimization for symmetric tensor decomposition. Math. Programm. Ser. B 151, 225–248 (2015)
Xu, C.: Completely positive matrices. Linear Algebra Its Appl. 379, 319–327 (2004)
Zhou, A.W., Fan, J.Y.: The CP-matrix completion problem. SIAM J. Matrix Anal. Appl. 35, 127–142 (2014)
Zhou, A.W., Fan, J.Y.: Interiors of completely positive cones. J. Glob. Optim. 63, 653–675 (2015)
Acknowledgments
The first author was supported in part by NSFC Grant 11571234. The second author was supported in part by CPSF Grant BX201600097.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fan, J., Zhou, A. A semidefinite algorithm for completely positive tensor decomposition. Comput Optim Appl 66, 267–283 (2017). https://doi.org/10.1007/s10589-016-9870-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-016-9870-9