Journal
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
Volume 32, Issue 1, Pages 115-135Publisher
SIAM PUBLICATIONS
DOI: 10.1137/090764827
Keywords
multilinear algebra; higher-order tensor; rank reduction; singular value decomposition; trust-region scheme; Riemannian manifold; Grassmann manifold
Categories
Funding
- Belgian Federal Science Policy Office [P6/04]
- Communaute francaise de Belgique - Actions de Recherche Concertees
- Research Council, K.U. Leuven [EF/05/006]
- Wetenschappelijk Onderzoek-Vlaanderen [G.0427.10N]
- Impulsfinanciering Campus Kortrijk [CIF1, STRT1/08/023]
- [OE/06/25]
- [OE/07/17]
- [OE/08/007]
- [OE/09/004]
Ask authors/readers for more resources
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating these multiway arrays are thus required. In this paper, we focus on the best rank-(R-1, R-2, R-3) approximation of third-order tensors. We propose a new iterative algorithm based on the trust-region scheme. The tensor approximation problem is expressed as a minimization of a cost function on a product of three Grassmann manifolds. We apply the Riemannian trust-region scheme, using the truncated conjugate-gradient method for solving the trust-region subproblem. Making use of second order information of the cost function, superlinear convergence is achieved. If the stopping criterion of the subproblem is chosen adequately, the local convergence rate is quadratic. We compare this new method with the well-known higher-order orthogonal iteration method and discuss the advantages over Newton-type methods.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available