相关论文: Computation of a new error bound for tensor comple…
This article explores a new type of nonlinear complementarity problem, namely the horizontal tensor complementarity problem (HTCP), which is a natural extension of the horizontal linear complementarity problem studied in [12]. We extend the…
In this article we introduce column adequate tensor in the context of tensor complementarity problem and consider some important properties. The tensor complementarity problem is a class of nonlinear complematarity problems with the…
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…
The tensor complementarity problem $(\q, \mathcal{A})$ is to $$\mbox{ find } \x \in \mathbb{R}^n\mbox{ such that }\x \geq \0, \q + \mathcal{A}\x^{m-1} \geq \0, \mbox{ and }\x^\top (\q + \mathcal{A}\x^{m-1}) = 0.$$ We prove that a real…
In this paper, we consider the {\it generalized polynomial complementarity problem} (GPCP), which covers the recently introduced {\it polynomial complementarity problem} (PCP) and the well studied {\it tensor complementarity problem} (TCP)…
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{ finding } \x \in \mathbb{R}^n\mbox{ such that }\x \geq \0, \q +…
In this article we consider the sparse solutions of the tensor complementarity problem (TCP) which are the solutions of the smallest cardinality. We establish a connection between the least element of the feasible solution set of TCP and…
In this article we establish error bound for linear complementarity problem with $P$-matrix using plus function. We introduce a fundamental quantity associated with a $P$-matrix and show how this quantity is useful in deriving error bounds…
A new error bound for the linear complementarity problem is given when the involved matrix is a B-matrix. It is shown that this bound is sharper than some previous bounds [C.Q. Li, Y.T. Li. Note on error bounds for linear complementarity…
Nonlinear gradient dynamic approach for solving the tensor complementarity problem (TCP) is presented. Theoretical analysis shows that each of the defined dynamical system models ensures the convergence performance. The computer simulation…
Properties of solutions of the tensor complementarity problem (TCP) for structured tensors have been investigated in recent literature. In this paper, we make further contributions on this problem. Specifically, we first derive solution…
In this paper, we introduce semi-infinite tensor complementarity problem to provide an approach for considering a more realistic situation of the problem. We prove the necessary and sufficient conditions for the existence of the solution…
A new error bound for the linear complementarity problem when the matrix involved is a B-matrix is presented, which improves the corresponding result in [C.Q. Li et al., A new error bound for linear complementarity problems for B-matrices.…
One of the central problems in the theory of linear complementarity problems (LCPs) is to study the class of $Q$-matrices since it characterizes the solvability of LCP. Recently, the concept of $Q$-matrix has been extended to the case of…
This paper investigates the convexity of the solution set of the linear complementarity problems over tensor spaces (TLCPs). We introduce the notion of a $T$-column sufficient tensor and study its properties and relationships with several…
A sort of planar tensor networks with tensor constraints is investigated as a model for holography. We study the greedy algorithm generated by tensor constraints and propose the notion of critical protection (CP) against the action of…
It is worth knowing that a particular tensor class belongs to $P$-tensor which ensures the compactness to solve tensor complementarity problem (TCP). In this study, we propose a new class of tensor, Nekrasov $Z$ tensor, in the context of…
Recently, the tensor complementarity problem (TCP for short) has been investigated in the literature. An important question involving the property of global uniqueness and solvability (GUS-property) for a class of TCPs was proposed by Song…
Given a polynomial map f on the Euclidean n-space and a vector q, the polynomial complementarity problem, PCP(f,q), is the nonlinear complementarity problem of finding a nonnegative vector x such that y=f(x)+q is nonnegative and orthogonal…
In this paper, one of our main purposes is to prove the boundedness of solution set of tensor complementarity problem with B tensor such that the specific bounds only depend on the structural properties of tensor. To achieve this purpose,…