高阶张量特征值和相关多项式优化问题研究 目录
contents chapter 1 introduction 1 11 eigenvalues problems of higher order tensors 1 12 related polynomial optimization problems 4 13 applications 6 14 spectral properties and algorithms: a literature review 9 15 the organization of this book 14 chapter 2 spectral properties of h-eigenvalue problems of a nonnegative square tensor 17 21 introduction 17 22 from nonnegative matrices to nonnegative tensors 18 23 nonnegative irreducible tensors and primitive tensors 19 24 perron-frobenius theorem for nonnegative tensors and related results 22 25 geometric simplicity 29 26 the collatz-wielandt formula 36 27 other related results 41 28 some properties for nonnegative weakly irreducible tensors 46 281 weak irreducibility 46 282 generalization from nonnegative irreducible tensors to nonnegative weakly irreducible tensors 50 chapter 3 algorithms for finding the largest h-eigenvalue of a nonnegative square tensor 54 31 introduction 54 32 a polynomial-time approach for computing the spectral radius 55 33 two algorithms and convergence analysis 57 331 an inexact power-type algorithm 58 332 a one-step inner iteration power-type algorithm 63 34 numerical experiments 65 341 experiments on the polynomial-time approach 65 342 experiments on the inexact algorithms 66 chapter 4 spectral properties and algorithms of h-singular value problems of a nonnegative rectangular tensor 70 41 introduction 70 42 preliminaries 70 43 some conclusions concerning the singular value of a nonnegative rectangular tensor 72 44 primitivity and the convergence of the cqz method for ˉnding the largest singular value of a nonnegative rectangular tensor 81 45 algorithms for computing the largest singular value of a nonnegative rectangular tensor 84 451 a polynomial-time algorithm 84 452 an inexact algorithm 85 46 a solving method of the largest singular value based on the symmetric embedding 87 461 singular values of a rectangular tensor 87 462 singular values of a general tensor 89 chapter 5 properties and algorithms of z-eigenvalue problems of a symmetric tensor 94 51 introduction 94 52 some spectral properties 95 521 the collatz-wielandt formula 95 522 bounds on the z-spectral radius 99 53 the reformulation problem and the no duality gap result 100 531 the reformulation problem 100 532 dual problem of (rp) 102 533 no duality gap result 104 54 relaxations and algorithms 106 541 nuclear norm regularized convex relaxation of (rp) and the proximal augmented lagrangian method 106 542 the truncated nuclear norm regularization and the approximation 112 543 alternating least eigenvalue method for ˉnding a global minima 114 55 numerical results 119 chapter 6 solving biquadratic optimization problems via semideˉnite relaxation 126 61 introduction 126 62 semideˉnite relaxations and approximate bounds 127 621 the nonnegative case 127 622 the square-free case and the positive semideˉnite case 130 63 approximation al
|