Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method.
From MaRDI portal
Publication:2936744
DOI10.1002/NLA.1884zbMATH Open1313.90173OpenAlexW2155438968WikidataQ114852904 ScholiaQ114852904MaRDI QIDQ2936744FDOQ2936744
Authors: Zhenghai Huang, Liqun Qi, Shenglong Hu 
Publication date: 6 January 2015
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.1884
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
Linear programming (90C05) Multilinear algebra, tensor calculus (15A69) Semidefinite programming (90C22)
Cites Work
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Eigenvalues of a real supersymmetric tensor
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- Eigenvalues and invariants of tensors
- Z-eigenvalue methods for a global polynomial optimization problem
- Semidefinite programming relaxations for semialgebraic problems
- Uniform denominators in Hilbert's seventeenth problem
- Convergence of an algorithm for the largest singular value of a nonnegative rectangular tensor
- Finding the largest eigenvalue of a nonnegative tensor
- Title not available (Why is that?)
- Higher order positive semidefinite diffusion tensor imaging
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- On determinants and eigenvalue theory of tensors
- The cubic spherical optimization problems
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Space tensor conic programming
- Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor.
- The best rank-one approximation ratio of a tensor space
- Regularizing flows for constrained matrix-valued images
- Positive definiteness of diffusion kurtosis imaging
- Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
- Extreme diffusion values for non-Gaussian diffusions
Cited In (23)
- The geometric measure of entanglement of multipartite states and the \(Z\)-eigenvalue of tensors
- A generalization of inverse power method for computing eigenpairs of symmetric tensors
- Computing tensor eigenvalues via homotopy methods
- A projection method based on discrete normalized dynamical system for computing C-eigenpairs
- 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 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
- A modified FR conjugate gradient method for computing \(Z\)-eigenpairs of symmetric tensors
- An adaptive gradient method for computing generalized tensor eigenpairs
- 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
- Feasible Newton methods for symmetric tensor Z-eigenvalue problems
- Solving tensor E-eigenvalue problem faster
- 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
Uses Software
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)
