The best rank-one approximation ratio of a tensor space

SIAM Journal on Matrix Analysis and Applications

Volumn 32, Issue 2, 2011, Pages 430-442

  Qi, Liqun ^a  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Best rank one approximation ratio; Bounds; Tensors

Indexed keywords

APPROXIMATION RATIOS; BOUNDS; CONVERGENCE RATES; FINITE DIMENSIONAL; LOWER BOUNDS; TENSOR SPACES; THIRD ORDER; UPPER BOUND;

CONVERGENCE OF NUMERICAL METHODS;

TENSORS;

EID: 80051526441     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/100795802     Document Type: Article

References (28)

1. A. AMMAR, F. CHINESTA, AND A. X. FALCÓ, On the convergence of a greedy rank-one update algorithm for a class of linear systems, Arch. Comput. Methods Eng., 17(2010), pp. 473-486.
2. J. F. CARDOSO, High-order contrasts for independent component analysis, Neural Comput., 11(1999), pp. 157-192.
3. J. CHANG, W. SUN, AND Y. CHEN, A modified Newtons method for best rank-one approximation to tensors, Appl. Math. Comput., 216(2010), pp. 1859-1867.
4. P. COMON, Independent component analysis, a new concept?, Signal Processing, 36(1994), pp. 287-314.
5. G. DAHL, J. M. LEINAAS, J. MYRHEIM, AND E. OVRUM, A tensor product matrix approximation problem in quantum physics, Linear Algebra Appl., 420(2007), pp. 711-725. (Pubitemid 44751797)
6. L. DE LATHAUWER, P. COMON, B. DE MOOR, AND J. VANDEWALLE, Higher-order power method-Application in independent component analysis, in Proceedings of the International Symposium on Nonlinear Theory and its Applications (NOLTA'95), Las Vegas, NV, 1995, pp. 91-96.
7. 2;:::; RN) approximation of higher-order tensor, SIAM J. Matrix Anal. Appl., 21(2000), pp. 1324-1342. (Pubitemid 33217072)
8. R. DEVORE AND V. TELMYAKOV, Some remarks on greedy algorithm, Adv. Comput. Math., 5(1996), pp. 173-187.
9. A. FALÓ AND A. NOUY, A proper generalized decomposition for the solution of elliptic problems in abstract form by using a functional Eckart-Young approach, J. Math. Anal. Appl., 376(2011), pp. 469-480.
10. V. S. GRIGORASCU AND P. A. REGALIA, Tensor displacement structures and polyspectral matching, in Fast Reliable Algorithms for Structured Matrices, T. Kailath and A. H. Sayed, eds., SIAM, Philadeliphia, 1999.
11. D. HAN, H. H. DAI, AND L. QI, Conditions for strong ellipticity of anisotropic elastic materials, J. Elasticity, 97(2009), pp. 1-13.
12. E. KOFIDIS AND P. A. REGALIA, On the best rank-1 approximation of higher-order supersymmetric tensors, SIAM J. Matrix Anal. Appl., 23(2002), pp. 863-884.
13. D. LEIBOVICI AND H. EL MAÂCHE, Une decomposition en valeurs singuliers d'un element d'un produit tensoriel de k-espaces de Hilbert separables, C. R. Math. Acad. Sci. Paris, 325 (1997) pp. 779-782. (Pubitemid 127165084)
14. L.-H. LIM, Singular values and eigenvalues of tensors: A variational approach, in Proceedings of the IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP'05), 1(2005), pp. 129-132. (Pubitemid 46170894)
15. G. NI AND Y. WANG, On the best rank-1 approximation to higher-order symmetric tensors, Math. Comput. Model., 46(2007), pp. 1345-1352. (Pubitemid 47362621)
16. C. LING, J. NIE, L. QI, AND Y. YE, Bi-quadratic optimization over unit spheres and semidefinite programming relaxations, SIAM J. Optim., 20(2009), pp. 1286-1310.
17. C. L. NIKIAS AND A. P. PETROPULU, Higher-Order Spectra Analysis, A Nonlinear Signal Processing Framework, Prentice-Hall, Englewood Cliffs, NJ, 1993.
18. J. M. ORTEGA AND W. C. RHEINBOLDT, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970; Republication: SIAM, Philadelphia, 2000.
19. L. QI, Eigenvalues of a real supersymmetric tensor, J. Symbolic Comput., 40(2005), pp. 1302-1324. (Pubitemid 41600816)
20. L. QI, H. H. DAI, AND D. HAN, Conditions for strong ellipticity and M-eigenvalues, Front. Math. China, 4(2009), pp. 349-364.
21. L. QI, F. WANG, AND Y. WANG, Z-eigenvalue methods for a global optimization polynomial optimization problem, Math. Program., 118(2009), pp. 301-306.
22. A. M.-C. SO, Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems, Math. Program., to appear.
23. T. SCHULTZ AND H.-P. SEIDEL, Estimating crossing fibers: A tensor decomposition approach, IEEE Trans. Vis. Comput. Graph., 14(2008), pp. 1635-1642.
24. Y. WANG AND L. QI, On the successive supersymmetric rank-1 decomposition of higher order supersymmetric tensors, Numer. Linear Algebra Appl., 14(2007), pp. 503-519.
25. Y. WANG, L. QI, AND X. ZHANG, A practical method for computing the largest M-eigenvalue of a fourthorder partially symmetric tensor, Numer. Linear Algebra Appl., 16(2009), pp. 589-601.
26. T. ZHANG AND G. H. GOLUB, Rank-1 approximation of higher-order tensors, SIAM J. Matrix Anal. Appl., 23(2001), pp. 534-550.
27. X. ZHANG, C. LING, AND L. QI, Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints, J. Global Optim., 49(2011), pp. 293-311.
28. X. ZHANG, L. QI, AND Y. YE, The cubic spherical optimization problem, Math. Comp., to appear.