An alternating shifted higher order power method based algorithm for rank-\(R\) Hermitian approximation and solving Hermitian CP-decomposition problems

Cites Work

Unnamed Item
Tensor Decompositions and Applications
Iterative algorithms for computing US- and U-eigenpairs of complex tensors
Complex best \(r\)-term approximations almost always exist in finite dimensions
Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors
Spherical optimization with complex variables for computing US-eigenpairs
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
Geometric Measure of Entanglement and U-Eigenvalues of Tensors
Shifted Power Method for Computing Tensor Eigenpairs
Multivariate Regression and Machine Learning with Sums of Separable Functions
On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
Unconstrained Optimization of Real Functions in Complex Variables
Hermitian Tensor Decompositions
Generalized Canonical Polyadic Tensor Decomposition
Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
Separability of Hermitian tensors and PSD decompositions

This page was built for publication: An alternating shifted higher order power method based algorithm for rank-\(R\) Hermitian approximation and solving Hermitian CP-decomposition problems