Enhanced Line Search: A Novel Method to Accelerate PARAFAC
From MaRDI portal
Recommendations
- A comparison of algorithms for fitting the PARAFAC model
- Iterative methods for the canonical decomposition of multi-way arrays: application to blind underdetermined mixture identification
- An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA
- An alternating least squares algorithm for PARAFAC2 and three-way DEDICOM
- Performance of acceleration of ALS algorithm in nonlinear PCA
Cited in
(33)- An ATLD-ALS method for the trilinear decomposition of large third-order tensors
- Relativistic quantum mechanics and relativistic entanglement in the rest-frame instant form of dynamics
- A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search.
- Iterative methods for the canonical decomposition of multi-way arrays: application to blind underdetermined mixture identification
- Multi-way PLS regression: monotony convergence of tri-linear PLS2 and optimality of parameters
- A seminorm regularized alternating least squares algorithm for canonical tensor decomposition
- SOTT: greedy approximation of a tensor as a sum of tensor trains
- Computations in quantum tensor networks
- An efficient iterative method for solving the graph regularization Q-weighted nonnegative matrix factorization problem in multi-view clustering
- Nonlinear system modeling and identification using Volterra‐PARAFAC models
- Accelerated estimation of switching algorithms: the cointegrated VAR model and other applications
- Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition
- The optimization landscape for fitting a rank-2 tensor with a rank-1 tensor
- scientific article; zbMATH DE number 775921 (Why is no real title available?)
- A Practical Randomized CP Tensor Decomposition
- scientific article; zbMATH DE number 7409363 (Why is no real title available?)
- Direction finding via biquaternion matrix diagonalization with vector-sensors
- Greedy low-rank approximation in Tucker format of solutions of tensor linear systems
- Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition
- Computing the polyadic decomposition of nonnegative third order tensors
- High-order tensor estimation via trains of coupled third-order CP and Tucker decompositions
- Numerical solution of high dimensional stationary Fokker-Planck equations via tensor decomposition and Chebyshev spectral differentiation
- Successive unconstrained dual optimization method for~rank-one approximation to tensors
- Line search and trust region strategies for canonical decomposition of semi-nonnegative semi-symmetric 3rd order tensors
- Performance of acceleration of ALS algorithm in nonlinear PCA
- A Riemannian trust region method for the canonical tensor rank approximation problem
- On global convergence of alternating least squares for tensor approximation
- Some convergence results on the regularized alternating least-squares method for tensor decomposition
- A literature survey of low-rank tensor approximation techniques
- Numerical CP decomposition of some difficult tensors
- The dynamics of swamps in the canonical tensor approximation problem
- Exact line and plane search for tensor optimization
- Rank-1 tensor properties with applications to a class of tensor optimization problems
This page was built for publication: Enhanced Line Search: A Novel Method to Accelerate PARAFAC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5320727)
