Enhanced Line Search: A Novel Method to Accelerate PARAFAC

DOI10.1137/06065577zbMath1168.65313OpenAlexW2044777402MaRDI QIDQ5320727

Myriam Rajih, Pierre Comon, Richard A. Harshman

Publication date: 22 July 2009

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://zenodo.org/record/38771

zbMATH Keywords

numerical examplesaccelerationdegeneracyfactor analysisline searchalternating least squaresPARAFACbottlenecksenhanced line searchswampscollinear factors

Mathematics Subject Classification ID

Related Items (29)

Numerical solution of high dimensional stationary Fokker-Planck equations via tensor decomposition and Chebyshev spectral differentiation ⋮ A seminorm regularized alternating least squares algorithm for canonical tensor decomposition ⋮ The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor ⋮ SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains ⋮ Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems ⋮ An ATLD-ALS method for the trilinear decomposition of large third-order tensors ⋮ High-order tensor estimation via trains of coupled third-order CP and Tucker decompositions ⋮ Accelerated Estimation of Switching Algorithms: The Cointegrated VAR Model and Other Applications ⋮ Computations in quantum tensor networks ⋮ Some convergence results on the regularized alternating least-squares method for tensor decomposition ⋮ Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition ⋮ Computing the polyadic decomposition of nonnegative third order tensors ⋮ On global convergence of alternating least squares for tensor approximation ⋮ A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem ⋮ A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search. ⋮ Line search and trust region strategies for canonical decomposition of semi-nonnegative semi-symmetric 3rd order tensors ⋮ A Practical Randomized CP Tensor Decomposition ⋮ Numerical CP decomposition of some difficult tensors ⋮ Nonlinear system modeling and identification using Volterra‐PARAFAC models ⋮ Greedy low-rank approximation in Tucker format of solutions of tensor linear systems ⋮ Direction finding via biquaternion matrix diagonalization with vector-sensors ⋮ Iterative methods for the canonical decomposition of multi-way arrays: application to blind underdetermined mixture identification ⋮ Successive unconstrained dual optimization method for~rank-one approximation to tensors ⋮ Exact line and plane search for tensor optimization ⋮ The Dynamics of Swamps in the Canonical Tensor Approximation Problem ⋮ Unnamed Item ⋮ Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition ⋮ A literature survey of low-rank tensor approximation techniques ⋮ Relativistic quantum mechanics and relativistic entanglement in the rest-frame instant form of dynamics

Uses Software

• N-way Toolbox
• Multilinear Engine

This page was built for publication: Enhanced Line Search: A Novel Method to Accelerate PARAFAC