相关论文: A mixed integer programming approach to the tensor…
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…
We propose a new error bound for the solution of tensor complementarity problem TCP$(q, \mathcal{A})$ given that $\mathcal{A}$ is a $P$-tensor and $q$ is a real vector. We show that the proposed error bound is sharper than the earlier…
The main purpose of this note is to investigate some kinds of nonlinear complementarity problems (NCP). For the structured tensors, such as, symmetric positive definite tensors and copositive tensors, we derive the existence theorems on a…
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…
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…
The problem of tensor completion has applications in healthcare, computer vision, and other domains. However, past approaches to tensor completion have faced a tension in that they either have polynomial-time computation but require…
The paper aims to propose a suitable method in finding the solution of tensor complementarity problem. The tensor complementarity problem is a subclass of nonlinear complementarity problems for which the involved function is defined by a…
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 paper, we mainly focus on the existence and uniqueness of the vertical tensor complementarity problem. Firstly, combining the generalized-order linear complementarity problem with the tensor complementarity problem, the vertical…
In this paper, the generalized eigenvalue complementarity problem for tensors (GEiCP-T) is addressed, which arises from the stability analysis of finite dimensional mechanical systems and find applications in differential dynamical systems.…
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…
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…
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…
We study the ternary quadratic problem (TQP), a quadratic optimization problem with linear constraints where the variables take values in $\{0, \pm 1\}$. While semidefinite programming (SDP) techniques are well established for $\{0,1\}$-…
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)…
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…
In this paper, we study the nonemptiness, compactness, uniqueness, and finiteness of the solution set of a new type of nonlinear complementarity problem, namely the extended horizontal tensor complementarity problem (EHTCP). We introduce…
Indefinite quadratic programs (QPs) are known to be very difficult to be solved to global optimality, so are linear programs with linear complementarity constraints. Treating the former as a subclass of the latter, this paper presents a…
We are interested in finding a solution to the tensor complementarity problem with a strong M-tensor, which we call the M-tensor complementarity problem. We propose a lower dimensional linear equation approach to solve that problem. At each…