Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
From MaRDI portal
Cites work
- A fast algorithm for the spectral radii of weakly reducible nonnegative tensors.
- A feasible trust-region method for calculating extreme \(Z\)-eigenvalues of symmetric tensors
- A hybrid second-order method for homogenous polynomial optimization over unit sphere
- A practical method for computing the largest \(M\)-eigenvalue of a fourth-order partially symmetric tensor
- A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
- A semismooth Newton method for tensor eigenvalue complementarity problem
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- All real eigenvalues of symmetric tensors
- An adaptive gradient method for computing generalized tensor eigenpairs
- An adaptive shifted power method for computing generalized tensor eigenpairs
- Column sufficient tensors and tensor complementarity problems
- Computing extreme eigenvalues of large scale Hankel tensors
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
- D-eigenvalues of diffusion kurtosis tensors
- Eigenvalue analysis of constrained minimization problem for homogeneous polynomial
- Eigenvalues and invariants of tensors
- Eigenvalues of a real supersymmetric tensor
- Exceptionally regular tensors and tensor complementarity problems
- Further results for Perron-Frobenius theorem for nonnegative tensors
- Generalized eigenvalue complementarity problem for tensors
- Generalized tensor eigenvalue problems
- Global uniqueness and solvability for tensor complementarity problems
- Higher order positive semidefinite diffusion tensor imaging
- Higher-degree eigenvalue complementarity problems for tensors
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
- Nonnegative diffusion orientation distribution function
- Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm
- On computing minimal \(H\)-eigenvalue of sign-structured tensors
- On eigenvalue problems of real symmetric tensors
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the cone eigenvalue complementarity problem for higher-order tensors
- Positive semidefinite generalized diffusion tensor imaging via quadratic semidefinite programming
- Positive-definite tensors to nonlinear complementarity problems
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Properties of solution set of tensor complementarity problem
- Semidefinite relaxations for best rank-1 tensor approximations
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- Shifted power method for computing tensor eigenpairs
- Solution structures of tensor complementarity problem
- Some properties on Pareto-eigenvalues of higher-order tensors
- Symmetric nonnegative tensors and copositive tensors
- Tensor complementarity problem and semi-positive tensors
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- The sparsest solutions to \(Z\)-tensor complementarity problems
- Two-Point Step Size Gradient Methods
- \(R\)-linear convergence of the Barzilai and Borwein gradient method
- \(Z\)-eigenvalue inclusion theorems for tensors
Cited in
(10)- Pareto eigenvalue inclusion intervals for tensors
- An alternating direction method of multipliers for the eigenvalue complementarity problem
- A nonmonotone spectral projected gradient method for tensor eigenvalue complementarity problems
- A class of second-order cone eigenvalue complementarity problems for higher-order tensors
- Gradient flow methods for matrix completion with prescribed eigenvalues.
- A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
- A smoothing projected HS method for solving stochastic tensor complementarity problem
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problem
- Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems
This page was built for publication: Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736403)
