New ALS Methods with Extrapolating Search Directions and optimal step size for complex-valued tensor decompositions

IEEE Transactions on Signal Processing

Volumn 59, Issue 12, 2011, Pages 5888-5898

  Chen, Yannan ^a,b   Han, Deren ^a   Qi, Liqun ^c  

^a NANJING NORMAL UNIVERSITY   (China)

^b NANJING FORESTRY UNIVERSITY   (China)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING LEAST SQUARES; DIRECT METHOD; DS-CDMA; GLOBAL OPTIMUM; HIGHER ORDER; LINE SEARCHES; LINEAR DIRECTION; LINEAR SEARCH; LOCAL OPTIMA; NON-LINEARITY; NUMERICAL ALGORITHMS; NUMERICAL COMPARISON; OPTIMAL STEP SIZE; QUADRATIC APPROXIMATION; SEARCH DIRECTION; STEP SIZE; TENSOR DECOMPOSITION;

ALGORITHMS; DATA HANDLING; OPTIMIZATION; SIGNAL PROCESSING; TENSORS;

PROBLEM SOLVING;

EID: 81455128183     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2011.2164911     Document Type: Article

References (30)

1. E. Acar, D. M. Dunlavy, and T. G. Kolda, "A scalable optimization approach for fitting canonical tensor decompositions," J. Chemom., vol. 25, no. 2, pp. 67-86, 2011.
2. E. Acar, T. G. Kolda, and D. M. Dunlavy, An Optimization Approach for Filtting Canonical Tensor Decompositions," Sandia Report, 2009.
3. E. Acar and B. Yener, Unsupervised multiway data analysis: A literature survey," IEEE Trans. Knowl. Data Eng., vol. 21, no. 1, pp. 6-20, 2009.
4. J. D. Carroll and J. Chang, Analysis of individual differences in multidimensional scaling via an N-way generalization of 'Eckart-Young' decomposition," Psychometrika, vol. 35, no. 3, pp. 283-391, 1970.
5. P. Comon, J. McWhirter and I. Proudler, Eds., Tensor decompositions, " in Proc. Math. Signal Process. V, Oxford, U.K., 2002, pp. 1-24.
6. P. Comon, X. Luciani, and A. L. F. de Almeida, Tensor decompositions, alternating least squares and other tales," J. Chemom., vol. 23, pp. 393-405, 2009.
7. D. Cox, J. Little, and D. O'Shea, Using Algebraic Geometry. New York: Springer-Verlag, 1998.
8. A. L. F. de Almeida, G. Favier, and J. C. M. Mota, Generalized PARAFAC model for multidimensional wireless communications with application to blind multiuser equalization," in Proc. 39th ASILOMAR Conf. Signal Syst. Comput., Pacific Grove, CA, 2005.
9. A. L. F. de Almeida, G. Favier, and J. C. M. Mota, PARAFAC-based unified tensor modeling for wireless communication systems with application to blind multiuser equalization," Signal Process., vol. 87, pp. 337-351, 2007. (Pubitemid 44602256)
10. A. L. F. de Almeida, G. Favier, and J. C. M. Mota, Constrained tensor modeling approach to blind multiple-antenna CDMA schemes," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2417-2428, 2008. (Pubitemid 351795893)
11. L. D. Lathauwer, B. D. Moor, and J. Vandewalle, An introduction to independent component analysis," J. Chemom., vol. 14, pp. 123-149, 2000.
12. L. D. Lathauwer, Decompositions of a higher-order tensor in block terms. Part I: Lemmas for partitioned matrices," SIAM J. Matrix Anal. Appl., vol. 30, no. 3, pp. 1022-1032, 2008.
13. L. D. Lathauwer, Decompositions of a higher-order tensor in block terms. Part II: Definitions and uniqueness," SIAM J. Matrix Anal. Appl., vol. 30, no. 3, pp. 1033-1066, 2008.
14. L. D. Lathauwer and D. Nion, Decompositions of a higher-order tensor in block terms. Part III: Alternating least squares algorithms," SIAM J. Matrix Anal. Appl., vol. 30, no. 3, pp. 1067-1083, 2008.
15. S. Goedecker, Remark on algorithms to find roots of polynomials," SIAM J. Sci. Comput., vol. 15, no. 5, pp. 1059-1063, 1994.
16. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed. Baltimore, MD: The Johns Hopkins Univ. Press, 1996.
17. R. A. Harshman, Foundations of the PARAFAC procedure: Model and conditions for an 'explanatory' multi-mode factor analysis," in Proc. UCLA Working Papers in Phonet., 1970, vol. 16, pp. 1-84.
18. F. L. Hitchcock, The expression of a tensor or a polyadic as a sum of products," J. Math. Phys., vol. 6, pp. 164-189, 1927.
19. F. L. Hitchcock, Multiple invariants and generalized rank of a p-way matrix or tensor," J. Math. Phys., vol. 7, pp. 39-79, 1927.
20. T. G. Kolda and B. W. Bader, Tensor decompositions and applications," SIAM Rev., vol. 51, no. 3, pp. 455-500, 2009.
21. MathWorks [Online]. Available: http://www.mathworks.com/help/techdoc/ref/ roots.html
22. D. Nion and L. D. Lathauwer, A block factor analysis based receiver for blind multi-user access in wireless communications," in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), Toulouse, France, May. 2006, pp. 825-828.
23. D. Nion and L. D. Lathauwer, Line search computation of the block factor model for blind multi-user access in wireless communications," in Proc. IEEE Workshop on Signal Process. Adv. Wireless Commun. (SPAWC), Cannes, France, Jul. 2-5, 2006.
24. D. Nion and L. D. Lathauwer, An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA," Signal Process., vol. 88, no. 3, pp. 749-755, 2008. (Pubitemid 350088165)
25. D. Nion and L. D. Lathauwer, A block component model-based blind DS-CDMA receiver," IEEE Trans. Signal Process., vol. 56, no. 11, pp. 5567-5579, 2008.
26. L. Qi, W. Sun, and Y. Wang, Numerical multilinear algebra and its applications," Front. Math. China, vol. 2, no. 4, pp. 501-526, 2007.
27. N. D. Sidiropoulos, G. B. Giannakis, and R. Bro, Blind PARAFAC receivers for DS-CDMA systems," IEEE Trans. Signal Process., vol. 48, pp. 810-823, 2000. (Pubitemid 30576249)
28. A. Smilde, R. Bro, and P. Geladi, Multi-Way Analysis, Applications in the Chemical Sciences. Chichester, U.K.: Wiley, 2004.
29. M. Rajih and P. Comon, Enhanced line search a novel method to accelerate PARAFAC," in Proc. Eusipco'05, Antalya, Turkey, 2005.
30. M. Rajih, P. Comon, and R. A. Harshman Enhanced line search: A novel method to accelerate PARAFAC," SIAM J. Matrix Anal. Appl., vol. 30, no. 3, pp. 1148-1171, 2008.