Greedy Approaches to Symmetric Orthogonal Tensor Decomposition
From MaRDI portal
Publication:4588941
DOI10.1137/16M1087734zbMath1386.15051arXiv1706.01169OpenAlexW2624256161MaRDI QIDQ4588941
Cun Mu, Daniel Hsu, Donald Goldfarb
Publication date: 6 November 2017
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.01169
perturbation analysistensor decompositionorthogonally decomposable tensorrank-one tensor approximation
Eigenvalues, singular values, and eigenvectors (15A18) Decomposition methods (49M27) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)
Related Items
Successive partial-symmetric rank-one algorithms for almost unitarily decomposable conjugate partial-symmetric tensors, Using negative curvature in solving nonlinear programs, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors
- Independent component analysis, a new concept?
- Semidefinite programming relaxations for semialgebraic problems
- Properties and methods for finding the best rank-one approximation to higher-order tensors
- Global Optimization with Polynomials and the Problem of Moments
- Orthogonal Tensor Decompositions
- Rank-One Approximation to High Order Tensors
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- Maximum Block Improvement and Polynomial Optimization
- Tensor decompositions for learning latent variable models
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors
- Shifted Power Method for Computing Tensor Eigenpairs
- On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors
- GloptiPoly 3: moments, optimization and semidefinite programming
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- An approach to obtaining global extremums in polynomial mathematical programming problems
- Numerical Optimization
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
- The Rotation of Eigenvectors by a Perturbation. III
- The elements of statistical learning. Data mining, inference, and prediction
