Line search and trust region strategies for canonical decomposition of semi-nonnegative semi-symmetric 3rd order tensors

详细信息    查看全文

• 作者：Julie Coloigner^a ; ^b ; ^{julie.coloigner@gmail.com" class="auth_mail} ; Ahmad Karfoul^d ; ^{AKarfoul@gmail.com" class="auth_mail} ; Laurent Albera^a ; ^b ; ^c ; ; Pierre Comon^e
• 关键词：68Uxx ; 68Wxx ; 65Bxx ; 65Fxx
• 刊名：Linear Algebra and its Applications
• 出版年：1 June, 2014
• 年：2014
• 卷：450
• 期：Complete
• 页码：334-374
• 全文大小：1075 K

文摘

Numerical solutions are proposed to fit the CanDecomp/ParaFac (CP) model of real three-way arrays, when the latter are both nonnegative and symmetric in two modes. In other words, a semi-nonnegative INDSCAL analysis is performed. The nonnegativity constraint is circumvented by means of changes of variable into squares, leading to an unconstrained problem. In addition, two globalization strategies are studied, namely line search and trust region. Regarding the former, a global plane search scheme is considered. It consists in computing, for a given direction, one or two optimal stepsizes, depending on whether the same stepsize is used in various updating rules. Moreover, we provide a compact matrix form for the derivatives of the objective function. This allows for a direct implementation of several iterative algorithms such as conjugate gradient, Levenberg-Marquardt and Newton-like methods, in matrix programming environments like MATLAB. Our numerical results show the advantage of our optimization strategies when combined with a priori information such as partial symmetry.