Properties of Solution set of Tensor Complementarity Problem
arXiv:1508.00069 · doi:10.1007/s10957-016-0907-0
Abstract
The tensor complementarity problem is a specially structured nonlinear complementarity problem, then it has its particular and nice properties other than ones of the classical nonlinear complementarity problem. In this paper, it is proved that a tensor is an S-tensor if and only if the tensor complementarity problem is feasible, and each Q-tensor is an S-tensor. Furthermore, the boundedness of solution set of the tensor complementarity problem is equivalent to the uniqueness of solution for such a problem with zero vector. For the tensor complementarity problem with a strictly semi-positive tensor, we proved the global upper bounds for solution of such a problem. In particular, the upper bounds keep in close contact with the smallest Pareto ()eigenvalue.
Journal of Optimization Theory and Applications, 2016
References in corpus (1)
Cited by in corpus (18)
- Strictly semi-positive tensors and the boundedness of tensor complementarity problems
- Polynomial complementarity problems
- Z-tensors and complementarity problems
- B tensors and tensor complementarity problems
- Analytical expressions of copositivity for 4th order symmetric tensors and applications
- On the R-tensors and the solution map of tensor complementarity problems
- Copositivity for 3rd order symmetric tensors and applications
- Copositivity for a class of fourth order symmetric tensors given by scalar dark matter
- Infinite dimensional Hilbert tensors on spaces of analytic functions
- Eigenvalues and structured properties of P-tensors
- Gradient Dynamic Approach to the Tensor Complementarity Problem
- Formulating an -person noncooperative game as a tensor complementarity problem
- A continuation method for tensor complementarity problems
- A mixed integer programming approach to the tensor complementarity problem
- Introduction to Tensor Variational Inequalities
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problem
- An adaptive gradient method for computing generalized tensor eigenpairs
- Stochastic Tensors to Stochastic Tensor Complementarity Problems