Computing the polyadic decomposition of nonnegative third order tensors
From MaRDI portal
Publication:634027
DOI10.1016/j.sigpro.2011.03.006zbMath1219.94048MaRDI QIDQ634027
Pierre Comon, Nadège Thirion-Moreau, Jean-Philip Royer
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
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
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
Related Items
Exploiting Efficient Representations in Large-Scale Tensor Decompositions, Best Nonnegative Rank-One Approximations of Tensors, Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices, 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
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