Skip to main content
Log in

Tensor maximal correlation problems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

This paper studies the tensor maximal correlation problem, which aims at optimizing correlations between sets of variables in many statistical applications. We reformulate the problem as an equivalent polynomial optimization problem, by adding the first order optimality condition to the constraints, then construct a hierarchy of semidefinite relaxations for solving it. The global maximizers of the problem can be detected by solving a finite number of such semidefinite relaxations. Numerical experiments show the efficiency of the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chu, M., Watterson, J.: On a multivariate eigenvalue problem, Part I: algebraic theory and a power method. SIAM J. Sci. Comput. 14, 1089–1106 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cui, C., Dai, Y., Nie, J.: All real eigenvalues of symmetric tensors. SIAM J. Matrix Anal. Appl. 35, 1582–1601 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  3. Curto, R., Fialkow, L.: Truncated K-moment problems in several variables. J. Operator Theory 54, 189–226 (2005)

    MathSciNet  MATH  Google Scholar 

  4. Demmel, J.: Applied Numerical Linear Algebra. SIAM, Philadelphia (1997)

    Book  MATH  Google Scholar 

  5. Golub, G .H., Van Loan, C .F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)

    MATH  Google Scholar 

  6. Hanafi, M., Ten Berge, J.M.F.: Global optimality of the successive Maxbet algorithm. Psychometrika 68, 97–103 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Helton, J.W., Nie, J.: A semidefinite approach for truncated K-moment problems. Found. Comput. Math. 12, 851–881 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Henrion, D., Lasserre, J.: Detecting global optimality and extracting solutions in GloptiPoly, Positive polynomials in control, Lecture Notes in Control and Inform. Sci. Springer, Berlin, 312 , pp. 293–310 (2005)

  9. Henrion, D., Lasserre, J., Loefberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24, 761–779 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Horst, P.: Relations among m sets of measures. Psychometrika 26, 129–149 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hotelling, H.: The most predictable criterion. J. Educ. Pyschol. 26, 139–142 (1935)

    Article  Google Scholar 

  12. Hotelling, H.: Relations between two sets of variates. Biometrika 28, 321–377 (1936)

    Article  MATH  Google Scholar 

  13. Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796–817 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lasserre, J.B.: Moments, Positive Polynomials and Their Applications. Imperial College Press, London (2009)

    Book  Google Scholar 

  15. 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)

    Google Scholar 

  16. Nie, J., Demmel, J., Sturmfels, B.: Minimizing polynomials via sum of squares over the gradient ideal. Math. Program., Ser. A 106, 587–606 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Nie, J.: Certifying convergence of Lasserre’s hierarchy via flat truncation. Math. Program., Ser. A 142, 485–510 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  18. Nie, J.: Polynomial optimization with real varieties. SIAM J. Optim. 23, 1634–1646 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  19. Nie, J.: An exact Jacobian SDP relaxation for polynomial optimization. Math. Program. 137, 225–255 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  20. Nie, J.: Optimality conditions and finite convergence of Lasserre’s hierarchy. Math. Program., Ser. A 146, 97–121 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  21. Nie, J.: The \(A\)-truncated K-moment problem. Found. Comput. Math. 14, 1243–1276 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  22. Nie, J.: Linear optimization with cones of moments and nonnegative polynomials. Math. Program., Ser. B 153, 247–274 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  23. Putinar, M.: Positive polynomials on compact semi-algebraic sets. Ind. Aniv. Math. J. 42, 969–984 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  24. Sigg, C., Fischer, B., Ommer, B., Roth, V., Buhmann, J.: Nonnegative CCA for audiovisual source separation. In: IEEE International Workshop on Machine Learning for Signal Processing 07, IEEE (2007)

  25. Sturm, J.F.: SeDuMi 1.02: a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw., 11 & 12, 625–653 (1999). http://sedumi.ie.lehigh.edu/

  26. Timm, N.H.: Applied Multivariate Analysis. Springer, New York (2002)

    MATH  Google Scholar 

  27. Van de Geer, J.R.: Linear relations among k sets of variables. Psychometrika 49, 79–94 (1984)

    Article  Google Scholar 

  28. Zhang, L., Liao, L., Sun, L.: Towards the global solution of the maximal correlation problem. J. Glob. Optim. 49, 91–107 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  29. Zhang, L., Chu, M.: Computing absolute maximum correlation. IMA J. Numer. Anal. 32, 163–184 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  30. Zhang, L., Liao, L.: An alternating variable method for the maximal correlation problem. J. Glob. Optim. 54, 199–218 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anwa Zhou.

Additional information

Anwa Zhou was partially supported by the NSFC Grant 11701356, the National Postdoctoral Program for Innovative Talents Grant BX201600097 and Project Funded by China Postdoctoral Science Foundation Grant 2016M601562. Jinyan Fan was partially supported by the NSFC Grant 11571234. Yanqin Bai was partially supported by the NSFC Grant 11771275.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, A., Zhao, X., Fan, J. et al. Tensor maximal correlation problems. J Glob Optim 70, 843–858 (2018). https://doi.org/10.1007/s10898-017-0592-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-017-0592-z

Keywords

Mathematics Subject Classification

Navigation