Spherical optimization with complex variables for computing US-eigenpairs
From MaRDI portal
Recommendations
- A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors
- Iterative algorithms for computing US- and U-eigenpairs of complex tensors
- A locally and cubically convergent algorithm for computing đ”âeigenpairs of symmetric tensors
- Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
- All real eigenvalues of symmetric tensors
Cites work
- A successive approximation method for quantum separability
- Best rank one approximation of real symmetric tensors can be chosen symmetric
- Computation of the geometric measure of entanglement for pure multiqubit states
- D-eigenvalues of diffusion kurtosis tensors
- E-characteristic polynomials of tensors
- Eigenvalues and invariants of tensors
- Eigenvalues of a real supersymmetric tensor
- Geometric measure of entanglement and U-eigenvalues of tensors
- Higher-degree eigenvalue complementarity problems for tensors
- scientific article; zbMATH DE number 48992 (Why is no real title available?)
- Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
- On best rank one approximation of tensors
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the best rank-1 approximation to higher-order symmetric tensors
- On the cone eigenvalue complementarity problem for higher-order tensors
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(L_r,L_r,1) terms, and a new generalization
- Quantum entanglement and the communication complexity of the inner product function
- Semidefinite relaxations for best rank-1 tensor approximations
- Shifted power method for computing tensor eigenpairs
- Tensor decompositions with banded matrix factors
- The best rank-1 approximation of a symmetric tensor and related spherical optimization problems
- The best rank-one approximation ratio of a tensor space
- The degree of the E-characteristic polynomial of an even order tensor
- The geometric measure of entanglement for a symmetric pure state with non-negative amplitudes
- The geometric measure of multipartite entanglement and the singular values of a hypermatrix
- Variational Analysis
Cited in
(12)- Accurate calculation of the geometric measure of entanglement for multipartite quantum states
- Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method
- Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
- How entangled can a multi-party system possibly be?
- 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
- Pseudospectra localizations for generalized tensor eigenvalues to seek more positive definite tensors
- Iterative algorithms for computing US- and U-eigenpairs of complex tensors
- An alternating shifted higher order power method based algorithm for rank-R Hermitian approximation and solving Hermitian CP-decomposition problems
- An alternating algorithm for structure preserving CP-decompositions of partially symmetric tensors
- A generalized complex power iteration-based algorithm for quartic-quadratic optimization problems over a spherical constraint and its applications
- Extremal geometric measure of entanglement and Riemannian optimization methods
This page was built for publication: Spherical optimization with complex variables for computing US-eigenpairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374370)
