Numerical optimization for symmetric tensor decomposition
From MaRDI portal
Publication:2349123
DOI10.1007/s10107-015-0895-0zbMath1328.90139arXiv1410.4536OpenAlexW1976837627MaRDI QIDQ2349123
Publication date: 19 June 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.4536
Related Items (22)
SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor ⋮ Completely positive tensor recovery with minimal nuclear value ⋮ Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation ⋮ Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications ⋮ Separable symmetric tensors and separable anti-symmetric tensors ⋮ Partially symmetric tensor structure preserving rank-\(R\) approximation via BFGS algorithm ⋮ Low Rank Symmetric Tensor Approximations ⋮ Completely positive tensors in the complex field ⋮ Estimating Higher-Order Moments Using Symmetric Tensor Decomposition ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS ⋮ \(\{0,1\}\) completely positive tensors and multi-hypergraphs ⋮ Fourier matrices and Fourier tensors ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ A semidefinite algorithm for completely positive tensor decomposition ⋮ Copositive tensor detection and its applications in physics and hypergraphs ⋮ The sparsest solutions to \(Z\)-tensor complementarity problems ⋮ A hierarchy of semidefinite relaxations for completely positive tensor optimization problems ⋮ On \(\{0,1\}\) CP tensors and CP pseudographs ⋮ Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations ⋮ Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ Rank-1 approximation for entangled multipartite real systems
Uses Software
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors
- Eigenvectors of tensors and algorithms for Waring decomposition
- Decomposition of homogeneous polynomials with low rank
- Symmetric tensor decomposition
- Computing symmetric rank for symmetric tensors
- A comparison of algorithms for fitting the PARAFAC model
- Monotonically convergent algorithms for symmetric tensor approximation
- Generating polynomials and symmetric tensor decompositions
- Eigenvalues of a real supersymmetric tensor
- The assumption of proportional components when Candecomp is applied to symmetric matrices in the context of INDSCAL
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- Shifted Power Method for Computing Tensor Eigenpairs
- Algorithm 862
- Efficient MATLAB Computations with Sparse and Factored Tensors
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm
- An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs
- All Real Eigenvalues of Symmetric Tensors
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Symmetric Tensors and Symmetric Tensor Rank
This page was built for publication: Numerical optimization for symmetric tensor decomposition
