An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA

DOI10.1016/j.sigpro.2007.07.024zbMath1186.94262OpenAlexW2035146430MaRDI QIDQ971300

Dimitri Nion, Lieven De Lathauwer

Publication date: 19 May 2010

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

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

zbMATH Keywords

line searchalternating least squarestensor decompositionscode division multiple accessblock component modelparallel factor model

Mathematics Subject Classification ID

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

Related Items (8)

A promising technique for blind identification: the generic statistics ⋮ Some convergence results on the regularized alternating least-squares method for tensor decomposition ⋮ Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition ⋮ A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search. ⋮ Direction finding via biquaternion matrix diagonalization with vector-sensors ⋮ Iterative methods for the canonical decomposition of multi-way arrays: application to blind underdetermined mixture identification ⋮ Exact line and plane search for tensor optimization ⋮ Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition

This page was built for publication: An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA