Matrix theory is one of the most fundamental tools of mathematics and science, and a
number of classical books on matrix analysis have been written to explore this theory. As a …

Finding the sparsest solutions to a tensor complementarity problem is generally NP-hard
due to the nonconvexity and noncontinuity of the involved ℓ _0 ℓ 0 norm. In this paper, a …

In this paper, we consider a class of n-person noncooperative games, where the utility
function of every player is given by a homogeneous polynomial defined by the payoff tensor …

Tensors (hypermatrices) are multidimensional analogs of matrices. The tensor
complementarity problem is a class of nonlinear complementarity problems with the involved …

This paper deals with the class of Q-tensors, that is, a Q-tensor is a real tensor $\mathcal {A}
$ such that the tensor complementarity problem $(\q,\mathcal {A}) $: $$\mbox …

In this paper, we equivalently reformulate the tensor complementarity problem as a system
of fixed point equations. Based on this system, we propose the (extend) randomized …

Summary The Jacobi, Gauss‐Seidel and successive over‐relaxation methods are well‐
known basic iterative methods for solving system of linear equations. In this paper, we …

Stimulated by the study of sufficient matrices in linear complementarity problems, we study
column sufficient tensors and tensor complementarity problems. Column sufficient tensors …

In this paper, we are concerned with finding the least solution to the tensor complementarity
problem. When the involved tensor is strongly monotone, we present a way to estimate the …

In the paper, we are concerned with the existence and uniqueness of solution for tensor
complementarity problem (TCP) and tensor absolute value equations (TAVEs) with special …