Decompositions of a Higher-Order Tensor in Block Terms—Part I: Lemmas for Partitioned Matrices
SIAM Journal on Matrix Analysis and Applications
Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
SIAM Journal on Matrix Analysis and Applications
Enhanced Line Search: A Novel Method to Accelerate PARAFAC
SIAM Journal on Matrix Analysis and Applications
Blind PARAFAC receivers for DS-CDMA systems
IEEE Transactions on Signal Processing
Blind underdetermined mixture identification by joint canonical decomposition of HO cumulants
IEEE Transactions on Signal Processing
Batch and adaptive PARAFAC-based blind separation of convolutive speech mixtures
IEEE Transactions on Audio, Speech, and Language Processing
Tensor algebra and multidimensional harmonic retrieval in signal processing for MIMO radar
IEEE Transactions on Signal Processing
Tensor space-time (TST) coding for MIMO wireless communication systems
Signal Processing
Block component analysis, a new concept for blind source separation
LVA/ICA'12 Proceedings of the 10th international conference on Latent Variable Analysis and Signal Separation
A combination of parallel factor and independent component analysis
Signal Processing
Maximum Block Improvement and Polynomial Optimization
SIAM Journal on Optimization
SIAM Journal on Matrix Analysis and Applications
| Hi-index | 0.09 |
In this paper, we introduce an enhanced line search algorithm to accelerate the convergence of the alternating least squares (ALS) algorithm, which is often used to decompose a tensor in a sum of contributions. This scheme can be used for the computation in the complex case of the Parallel Factor model or the more general block component model. We then illustrate the performance of the algorithm in the context of blind separation-equalization of convolutive DS-CDMA mixtures.