메뉴 건너뛰기




Volumn 50, Issue 6, 2010, Pages 927-945

Structure of the Hessian matrix and an economical implementation of Newton's method in the problem of canonical approximation of tensors

Author keywords

Canonical decomposition; Conjugate gradient method; Low rank approximations; Tensor decompositions; Trust region Newton method

Indexed keywords


EID: 77954072168     PISSN: 09655425     EISSN: 15556662     Source Type: Journal    
DOI: 10.1134/S0965542510060011     Document Type: Article
Times cited : (12)

References (24)
  • 2
    • 27844496824 scopus 로고    scopus 로고
    • Algorithms for Numerical Analysis in High Dimensions
    • G. Beylkin and M. J. Mohlenkamp, "Algorithms for Numerical Analysis in High Dimensions," SIAM J. Sci. Comput. 26, 2133-2159 (2005).
    • (2005) SIAM J. Sci. Comput. , vol.26 , pp. 2133-2159
    • Beylkin, G.1    Mohlenkamp, M.J.2
  • 3
    • 57049095978 scopus 로고    scopus 로고
    • Unsupervised Multiway Data Analysis: A Literature Survey
    • A. Evrim and V. Bülent, "Unsupervised Multiway Data Analysis: A Literature Survey," IEEE Trans. Knowledge Data Eng. 21 (1), 6-20 (2009).
    • (2009) IEEE Trans. Knowledge Data Eng. , vol.21 , Issue.1 , pp. 6-20
    • Evrim, A.1    Bülent, V.2
  • 4
    • 0036056838 scopus 로고    scopus 로고
    • Rank-One Approximation to High Order Tensors
    • T. Zhang and G. H. Golub, "Rank-One Approximation to High Order Tensors," SIAM J. Matrix Anal. Appl. 23, 534-550 (2001).
    • (2001) SIAM J. Matrix Anal. Appl. , vol.23 , pp. 534-550
    • Zhang, T.1    Golub, G.H.2
  • 5
    • 77954064308 scopus 로고    scopus 로고
    • Minimization Methods for Approximating Tensors and Their Comparison
    • [Comput. Math. Math. Phys. 46, 1641-1650 (2006)]
    • I. V. Oseledets and D. V. Savost'yanov, "Minimization Methods for Approximating Tensors and Their Comparison," Zh. Vychisl. Mat. Mat. Fiz. 46, 1725-1734 (2006) [Comput. Math. Math. Phys. 46, 1641-1650 (2006)].
    • (2006) Zh. Vychisl. Mat. Mat. Fiz. , vol.46 , pp. 1725-1734
    • Oseledets, I.V.1    Savost'yanov, D.V.2
  • 6
    • 77954080597 scopus 로고    scopus 로고
    • On the Problem of Canonical Tensor Decomposition and an Algorithm for Its Solution as Applied to Search for Fast Matrix Algorithms
    • part VIII: Problems im Modern Physics (MFTI, Moscow)
    • V. A. Kazeev, "On the Problem of Canonical Tensor Decomposition and an Algorithm for Its Solution as Applied to Search for Fast Matrix Algorithms," Proceedings of the 51st MFTI Scientific Conference on Modern Problems in Fundamental Sciences and Applications, part VIII: Problems im Modern Physics (MFTI, Moscow, 2008), pp. 225-228.
    • (2008) Proceedings of the 51st MFTI Scientific Conference on Modern Problems in Fundamental Sciences and Applications , pp. 225-228
    • Kazeev, K.V.1
  • 7
    • 77954038864 scopus 로고    scopus 로고
    • Leipzig: Univ. Leipzig
    • M. Espig, PhD Thesis (Univ. Leipzig, Leipzig, 2008).
    • (2008) PhD Thesis
    • Espig, M.1
  • 8
    • 34250499792 scopus 로고
    • Analysis of Individual Differences in Multidimensional Scaling via an N-Way Generalization of Eckart-Young Decomposition
    • J. D. Caroll and J. J. Chang, "Analysis of Individual Differences in Multidimensional Scaling via an N-Way Generalization of Eckart-Young Decomposition," Psychometrika 35, 283-319 (1970).
    • (1970) Psychometrika , vol.35 , pp. 283-319
    • Caroll, J.D.1    Chang, J.J.2
  • 9
    • 0002740437 scopus 로고
    • Foundations of the PARAFAC Procedure: Models and Conditions for an Explanatory Multimodal Factor Analysis
    • R. A. Harshman, "Foundations of the PARAFAC Procedure: Models and Conditions for an Explanatory Multimodal Factor Analysis," UCLA Working Papers in Phonetics 16, 1-84 (1970).
    • (1970) UCLA Working Papers in Phonetics , vol.16 , pp. 1-84
    • Harshman, R.A.1
  • 10
    • 55349142218 scopus 로고    scopus 로고
    • Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
    • V. de Silva and L.-H. Lim, "Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem," SIAM J. Matrix Anal. Appl. 30, 1084-1127 (2008).
    • (2008) SIAM J. Matrix Anal. Appl. , vol.30 , pp. 1084-1127
    • de Silva, V.1    Lim, L.H.2
  • 12
    • 29744465878 scopus 로고    scopus 로고
    • Trigonometric Identities and Sums of Separable Functions
    • M. J. Mohlenkamp and L. Monzon, "Trigonometric Identities and Sums of Separable Functions," Math. Intelligencer 27 (2), 65-69 (2005).
    • (2005) Math. Intelligencer , vol.27 , Issue.2 , pp. 65-69
    • Mohlenkamp, M.J.1    Monzon, L.2
  • 13
    • 0000305846 scopus 로고
    • The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
    • T. Steihaug, "The Conjugate Gradient Method and Trust Regions in Large Scale Optimization," SIAM J. Numer. Anal. 20, 626-637 (1983).
    • (1983) SIAM J. Numer. Anal. , vol.20 , pp. 626-637
    • Steihaug, T.1
  • 15
    • 0022015590 scopus 로고
    • A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
    • G. A. Shultz, R. B. Schnabel, and R. H. Byrd, "A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties," SIAM J. Numer. Anal. 22, 47-67 (1985).
    • (1985) SIAM J. Numer. Anal. , vol.22 , pp. 47-67
    • Shultz, G.A.1    Schnabel, R.B.2    Byrd, R.H.3
  • 16
    • 0023430609 scopus 로고
    • A Trust Region Algorithm for Nonlinearly Constrained Optimization
    • R. H. Byrd and G. A. Shultz, "A Trust Region Algorithm for Nonlinearly Constrained Optimization," SIAM J. Numer. Anal. 24, 1152-1170 (1987).
    • (1987) SIAM J. Numer. Anal. , vol.24 , pp. 1152-1170
    • Byrd, R.H.1    Shultz, G.A.2
  • 17
    • 34250095268 scopus 로고
    • Approximate Solution of the Trust Regions Problem by Minimization over Two-Dimensional Subspaces
    • R. H. Byrd, R. B. Schnabel, and G. A. Shultz, "Approximate Solution of the Trust Regions Problem by Minimization over Two-Dimensional Subspaces," Math. Program. 40, 247-263 (1988).
    • (1988) Math. Program. , vol.40 , pp. 247-263
    • Byrd, R.H.1    Schnabel, R.B.2    Shultz, G.A.3
  • 18
    • 0000955796 scopus 로고
    • Computing Optimal Locally Constrained Steps
    • D. M. Gay, "Computing Optimal Locally Constrained Steps," SIAM J. Sci. Stat. Comput. 2 (2), 186-197 (1981).
    • (1981) SIAM J. Sci. Stat. Comput. , vol.2 , Issue.2 , pp. 186-197
    • Gay, D.M.1
  • 19
    • 0001382978 scopus 로고
    • Newton's Method with a Model Trust Modification
    • D. C. Sorensen, "Newton's Method with a Model Trust Modification," SIAM J. Numer. Anal. 19, 409-426 (1982).
    • (1982) SIAM J. Numer. Anal. , vol.19 , pp. 409-426
    • Sorensen, D.C.1
  • 20
    • 34250960354 scopus 로고
    • On the Hadamard Product of Matrices
    • D. Ž. Djoković, "On the Hadamard Product of Matrices," Math. Z. 86 (5), 395 (1965).
    • (1965) Math. Z. , vol.86 , Issue.5 , pp. 395
    • Djoković, D.Z.1
  • 22
    • 34250487811 scopus 로고
    • Gaussian Elimination Is Not Optimal
    • V. Strassen, "Gaussian Elimination Is Not Optimal," Numer. Math. 13, 354-356 (1969).
    • (1969) Numer. Math. , vol.13 , pp. 354-356
    • Strassen, V.1
  • 23
    • 33645820043 scopus 로고    scopus 로고
    • The Border Rank of the Multiplication of 2 × 2 Matrices in Seven
    • J.M. Landsberg, "The Border Rank of the Multiplication of 2 × 2 Matrices in Seven," J. Am. Math. Soc. 19, 447-459 (2005).
    • (2005) J. Am. Math. Soc. , vol.19 , pp. 447-459
    • Landsberg, J.M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.