The best rank-1 approximation of a symmetric tensor and related spherical optimization problems

SIAM Journal on Matrix Analysis and Applications

Volumn 33, Issue 3, 2012, Pages 806-821

  Zhang, Xinzhen ^a   Ling, Chen ^b   Qi, Liqun ^c  

^a TIANJIN UNIVERSITY   (China)

^b HANGZHOU DIANZI UNIVERSITY   (China)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Power algorithm; Symmetric tensor; The best rank 1 approximation; The best symmetric rank 1 approximation

Indexed keywords

APPROXIMATION RATIOS; HOMOGENEOUS POLYNOMIALS; LOWER BOUNDS; NUMERICAL RESULTS; OPTIMIZATION PROBLEMS; ORDER POLYNOMIALS; THE BEST RANK-1 APPROXIMATION; THE BEST SYMMETRIC RANK-1 APPROXIMATION;

OPTIMIZATION; POLYNOMIALS; SPHERES; TENSORS;

APPROXIMATION ALGORITHMS;

EID: 84867305742     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/110835335     Document Type: Article

References (36)

1. P. Comon, Blind channel indentification and extraction of more sources than sensors, in Proceedings of the Conference on Advanced Signal Processing, Architectures, and Implementations VIII, San Diego, 1998, pp. 2-13.
2. P. Comon, G. Golub, L.H. Lim, and B. Mourrain, Symmetric tensors and symmetric tensor rank, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 1254-1279.
3. A. Ghosh, E. Tsigaridas, M. Descoteaux, P. Comon, B. Mourrain, and R. Deriche, A polynomial based approach to extract the maxima of an antipodally symmetric spherical function and its application to extract fiber directions from the orientation distribution function in diffusion MRI, Computational Diffusion MRI Workshop, New York, 2008.
4. O. Grellier and P. Comon, Analytical blind discrete source separation, in Proceedings of the the European Signal Processing Conference, Tampere, Finland, 2000.
5. S. He, Z. Li, and S. Zhang, Approximation algorithms for homogeneous polynomial optimization with quadratic constraints, Math. Program., 125 (2011), pp. 353-383.
6. 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.
7. T.G. Kolda and J.R. Mayo, Shifted power method for computing tensor eigenpairs, SIAM J. Matrix Anal. Appl., 32 (2011), pp. 1095-1124.
8. S. Lang, Real and functional analysis, Grad. Texts in Math. 142, Springer-Verlag, New York, 1993.
9. J.B. Lasserre, Global optimization with polynomials and the problem of moments, SIAM J. Optim., 11 (2001), pp. 796-817.
10. J.B. Lasserre, Polynomials nonnegative on a grid and discrete representations, Trans. Amer. Math. Soc., 354 (2001), pp. 631-649.
11. 3) approximation in multilinear algebra, J. Chemometrics, 18 (2004), pp. 2-11.
12. N) approximation of higher-order tensor, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 1324-1342.
13. M. Laurent, Sums of squares, moment matrices and optimization over polynomials, in Emerging Applications of Algebraic Geometry, IMA Volumes in Mathematics and its Applications 149, M. Putinar and S. Sullivant, eds., Springer, New York, 2009, pp. 157-270.
14. X.L. Li, A new gradient search interpretation of super exponential algorithm, IEEE Signal Process. Lett., 13 (2006), pp. 173-176.
15. Z.Q. Luo and S. Zhang, A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints, SIAM J. Optim., 20 (2010), pp. 1716-1736.
16. H.M. Markowitz, Portfolio selection, J. Finance, 7 (1952), pp. 77-91.
17. P. McCullagh, Tensor Methods in Statistics, Chapman and Hall, London, 1987.
18. J.G. McWhriter and I.K. Proudler, Mathematics in Signal Processing V, Clarendon Press, Oxford, UK, 2002.
19. J.J. Moré and D.C. Sorensen, Computing a trust region step, SIAMJ. Sci. Statist. Comput., 4 (1983), pp. 553-572.
20. Y. Nesterov, Random Walk in a Simplex and Quadratic Optimization over Convex Polytopes, Catholic University of Louvain, Louvain-la-Neuve, Belgium, 2003.
21. G. Ni and Y. Wang, On the best rank-1 approximation to higher-order symmetric tensor, Math. Comput. Modelling, 46 (2007), pp. 1345-1352.
22. Q. Ni, L. Qi, and F. Wang, An eigenvalue method for testing positive definiteness of a multivariate form, IEEE Trans. Automat. Control, 53 (2008), pp. 1096-1107.
23. J. Nie, Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces, Frontiers of Mathematics in China, 7 (2012), pp. 321-346.
24. P.A. Parrilo, Semidefinite programming relaxations for semialgebraic problems, Math. Program., 96 (2003), pp. 293-320.
25. L. Qi, Extrema of a real polynomial, J. Global Optim., 30 (2004), pp. 405-433.
26. L. Qi, Eigenvalues of a real supersymmetric tensor, J. Symbolic Comput., 40 (2005), pp. 1302-1324.
27. L. Qi, The best rank-one approximation ratio of a tensor space, SIAM J. Matrix Anal. Appl., 32 (2011), pp. 430-442.
28. L. Qi, Z. Wan, and Y.F. Yang, Global minimization of normal quadratic polynomials based on global descent directions, SIAM J. Optim., 15 (2004), pp. 275-302.
29. L. Qi, F. Wang, and Y. Wang, Z-eigenvalue methods for a global polynomial optimization problem, Math. Program., 118 (2009), pp. 301-316.
30. P.A. Regalia and E. Kofides, Monotonic convergence of fixed-point algorithms for ICA, IEEE Trans. Neural Networks, 14 (2003), pp. 943-949.
31. A. M-C. So, Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems, Math. Program., 129 (2011), pp. 357-382.
32. S. Soare, J.W. Yoon, and O. Cazacu, On the use of homogeneous polynomials to develop anisotropic yield functions with applications to sheet forming, Internat. J. Plasticity, 24 (2008), pp. 915-944.
33. A.J. van der Veen and A. Paulraj, An analytical constant modulus algorithm, IEEE Trans. Signal Process., 44 (1996), pp. 1136-1155.
34. V. Zarzoso and P. Comon, Robust independent component analysis by iterative maximization of kurtosis contrast with algebraic optimal step size, IEEE Trans. Neural Networks, 21 (2010), pp. 534-550.
35. T. Zhang and G.H. Golub, Rank-1 approximation of higher-order tensors, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 534-550.
36. X.Z. Zhang, L. Qi, and Y. Ye, The cubic spherical optimization problems, Math. Comput., 81 (2012), pp. 1513-1525.