Computing the polyadic decomposition of nonnegative third order tensors

DOI10.1016/j.sigpro.2011.03.006zbMath1219.94048MaRDI QIDQ634027

Pierre Comon, Jean-Philip Royer, Nadège Thirion-Moreau

Publication date: 2 August 2011

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2011.03.006

zbMATH Keywords

tensor; chemometrics; preconditioning; data analysis; factorization; data mining; fluorescence; canonical decomposition; quasi-Newton; multi-way; parafac; nonnegative; canonical polyadic decomposition; CP decomposition; array; BFGS; nonlinear conjugate gradient; canDecomp; DFP; three-way

Mathematics Subject Classification ID

94A12: Signal theory (characterization, reconstruction, filtering, etc.)

Related Items

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

Uses Software

• Multilinear Engine

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Linear and nonlinear programming.
• A comparison of algorithms for fitting the PARAFAC model
• Typical tensorial rank
• Optimization. Algorithms and consistent approximations
• Gradient-based joint block diagonalization algorithms: application to blind separation of FIR convolutive mixtures
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Enhanced Line Search: A Novel Method to Accelerate PARAFAC