Computing the polyadic decomposition of nonnegative third order tensors
DOI10.1016/J.SIGPRO.2011.03.006zbMATH Open1219.94048OpenAlexW2127400371MaRDI QIDQ634027FDOQ634027
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
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
chemometricstensordata miningdata analysispreconditioningquasi-Newtonfactorizationcanonical decompositionnonnegativecanonical polyadic decompositionCP decompositionarrayBFGSnonlinear conjugate gradientfluorescencecanDecompDFPmulti-wayparafacthree-way
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Tensor Decompositions and Applications
- Linear and nonlinear programming.
- Optimization. Algorithms and consistent approximations
- Title not available (Why is that?)
- A comparison of algorithms for fitting the PARAFAC model
- Typical tensorial rank
- Enhanced Line Search: A Novel Method to Accelerate PARAFAC
- Gradient-based joint block diagonalization algorithms: application to blind separation of FIR convolutive mixtures
Cited In (9)
- Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices
- New Uniqueness Conditions for the Canonical Polyadic Decomposition of Third-Order Tensors
- Equivalent polyadic decompositions of matrix multiplication tensors
- A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search.
- 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
- Line search and trust region strategies for canonical decomposition of semi-nonnegative semi-symmetric 3rd order tensors
- Best nonnegative rank-one approximations of tensors
- The polyadic structure of factorable function tensors with applications to high-order minimization techniques
Uses Software
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)
