Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method.
From MaRDI portal
(Redirected from Publication:2936744)
Finding the extreme \(Z\)-eigenvalues of tensors via a sequential semidefinite programming method.
Finding the extreme \(Z\)-eigenvalues of tensors via a sequential semidefinite programming method.
Recommendations
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- A feasible trust-region method for calculating extreme Z-eigenvalues of symmetric tensors
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test.
- Real eigenvalues of nonsymmetric tensors
- Tensor \(Z\)-eigenvalue complementarity problems
Cites work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Convergence of an algorithm for the largest singular value of a nonnegative rectangular tensor
- Eigenvalues and invariants of tensors
- Eigenvalues of a real supersymmetric tensor
- Extreme diffusion values for non-Gaussian diffusions
- Finding the largest eigenvalue of a nonnegative tensor
- Global optimization with polynomials and the problem of moments
- Higher order positive semidefinite diffusion tensor imaging
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor.
- On determinants and eigenvalue theory of tensors
- Positive definiteness of diffusion kurtosis imaging
- Regularizing flows for constrained matrix-valued images
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
- Space tensor conic programming
- The best rank-one approximation ratio of a tensor space
- The cubic spherical optimization problems
- Uniform denominators in Hilbert's seventeenth problem
- Z-eigenvalue methods for a global polynomial optimization problem
Cited in
(25)- The geometric measure of entanglement of multipartite states and the \(Z\)-eigenvalue of tensors
- Computing tensor eigenvalues via homotopy methods
- A generalization of inverse power method for computing eigenpairs of symmetric tensors
- Computing the largest C-eigenvalue of a tensor using convex relaxation
- Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
- A projection method based on discrete normalized dynamical system for computing C-eigenpairs
- Bounds for Z_p-eigenpairs of a tensor with application to geometric measure of entanglement
- Positive definiteness of a class of cyclic symmetric tensors
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- Positive definiteness of paired symmetric tensors and elasticity tensors
- Space tensor conic programming
- Computing extreme eigenvalues of large scale Hankel tensors
- An adaptive gradient method for computing generalized tensor eigenpairs
- A modified FR conjugate gradient method for computing Z-eigenpairs of symmetric tensors
- Computing tensor Z-eigenvalues via shifted inverse power method
- \(M\)-tensors and nonsingular \(M\)-tensors
- Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor
- The spectral theory of tensors and its applications
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- Solving tensor E-eigenvalue problem faster
- Feasible Newton methods for symmetric tensor Z-eigenvalue problems
- Iterative algorithms for computing US- and U-eigenpairs of complex tensors
- Direct methods to compute all \(Z\)-eigenpairs of a tensor with dimension 2 or 3
- Z-eigenvalue intervals of even-order tensors with application to judge the strong ellipticity of an elasticity tensor
- A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors
This page was built for publication: Finding the extreme \(Z\)-eigenvalues of tensors via a sequential semidefinite programming method.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936744)
