TY - JOUR
TI - On the best rank-1 approximation of higher-order supersymmetric tensors
AU - Kofidis, E.
AU - Regalia, P.A.
JO - SIAM Journal on Matrix Analysis and Applications
PY - 2002
VL - 23
TODO - 3
SP - 863-884
PB - 
SN - 0895-4798, 1095-7162
TODO - 10.1137/S0895479801387413
TODO - null
TODO - Recently the problem of determining the best, in the least-squares sense, rank-1 approximation to a higher-order tensor was studied and an iterative method that extends the wellknown power method for matrices was proposed for its solution. This higher-order power method is also proposed for the special but important class of supersymmetric tensors, with no change. A simplified version, adapted to the special structure of the supersymmetric problem, is deemed unreliable, as its convergence is not guaranteed. The aim of this paper is to show that a symmetric version of the above method converges under assumptions of convexity (or concavity) for the functional induced by the tensor in question, assumptions that are very often satisfied in practical applications. The use of this version entails significant savings in computational complexity as compared to the unconstrained higher-order power method. Furthermore, a novel method for initializing the iterative process is developed which has been observed to yield an estimate that lies closer to the global optimum than the initialization suggested before. Moreover, its proximity to the global optimum is a priori quantifiable. In the course of the analysis, some important properties that the supersymmetry of a tensor implies for its square matrix unfolding are also studied.
ER -