Computing the polyadic decomposition of nonnegative third order tensors

DOI10.1016/J.SIGPRO.2011.03.006MaRDI QIDQ634027zbMATH OpenOpenAlexFDO

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

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

chemometricstensordata miningdata analysispreconditioningquasi-Newtonfactorizationcanonical decompositionnonnegativecanonical polyadic decompositionCP decompositionarrayBFGSnonlinear conjugate gradientfluorescencecanDecompDFPmulti-wayparafacthree-way

Mathematics Subject Classification ID

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

Recommendations

• Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition
• Line search and trust region strategies for canonical decomposition of semi-nonnegative semi-symmetric 3rd order tensors
• Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization
• Low rank non-negative triple decomposition and non-negative tensor completion
• Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm

Cites work

• scientific article; zbMATH DE number 192992 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3281211 (Why is no real title available?)
• A comparison of algorithms for fitting the PARAFAC model
• 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
• Gradient-based joint block diagonalization algorithms: application to blind separation of FIR convolutive mixtures
• Linear and nonlinear programming.
• Optimization. Algorithms and consistent approximations
• Tensor Decompositions and Applications
• Typical tensorial rank

Cited in

(9)

• New Uniqueness Conditions for the Canonical Polyadic Decomposition of Third-Order Tensors
• Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices
• The polyadic structure of factorable function tensors with applications to high-order minimization techniques
• Equivalent polyadic decompositions of matrix multiplication tensors
• Best nonnegative rank-one approximations of tensors
• 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
• Exploiting Efficient Representations in Large-Scale Tensor Decompositions
• A primal-dual algorithm for nonnegative \(N\)-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis

Describes a project that uses

Uses Software

• Multilinear Engine

This page was built for publication: Computing the polyadic decomposition of nonnegative third order tensors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634027)