A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition

Preprint English OPEN
De Sterck, Hans;
(2011)
  • Subject: Computer Science - Numerical Analysis | Mathematics - Numerical Analysis
    arxiv: Computer Science::Numerical Analysis

A new algorithm is presented for computing a canonical rank-R tensor approximation that has minimal distance to a given tensor in the Frobenius norm, where the canonical rank-R tensor consists of the sum of R rank-one components. Each iteration of the method consists of... View more
  • References (18)
    18 references, page 1 of 2

    [1] E. Acar, D.M. Dunlavy, and T.G. Kolda, A Scalable Optimization Approach for Fitting Canonical Tensor Decompositions, Journal of Chemometrics, 25 (2011), pp. 67-86.

    [2] B.W. Bader and T.G. Kolda, MATLAB Tensor Toolbox Version 2.4, http://csmr.ca.sandia.gov/∼tgkolda/TensorToolbox/, March 2010.

    [3] J.D. Carroll and J.J. Chang, Analysis of individual differences in multidimensional scaling via an N-way generalization of Eckart-Young decomposition, Psychometrika, 35 (1970), pp. 283-319.

    [4] L. De Lathauwer, A link between the canonical decomposition in multilinear algebra and simultaneous matrix diagonalization, SIAM Journal on Matrix Analysis and Applications, 28 (2006), pp. 642-666.

    [5] L. De Lathauwer, B. De Moor, and J. Vandewalle, Computation of the canonical decomposition by means of a simultaneous generalized Schur decomposition, SIAM Journal on Matrix Analysis and Applications, 26 (2004), pp. 295-327.

    [6] D.M. Dunlavy, T.G. Kolda, and E. Acar, Poblano v1.0: A Matlab Toolbox for GradientBased Optimization, Technical Report SAND2010-1422, Sandia National Laboratories, Albuquerque, NM and Livermore, CA, March 2010.

    [7] R.A. Harshman, Foundations of the PARAFAC procedure: Models and conditions for an explanatory multi-modal factor analysis, UCLA working papers in phonetics, 16 (1970), pp. 1-84.

    [8] M. Ishteva, L. De Lathauwer, P. Absil, and S. Van Huffel, Differential-geometric Newton method for the best rank-(R1 ,R2,R3) approximation of tensors, Numerical Algorithms, 51 (2009), pp. 179-194.

    [9] T.G. Kolda and B.W. Bader, Tensor Decompositions and Applications, SIAM Review, 51 (2009), pp. 455-500.

    [10] J.J. Mor´e and D.J. Thuente, Line search algorithms with guaranteed sufficient decrease, ACM Transactions on Mathematical Software, 20 (1994), pp. 286-307.

  • Similar Research Results (4)
  • Metrics
    No metrics available
Share - Bookmark