English

Tensor Complementarity Problem and Semi-positive Tensors

Optimization and Control 2015-02-10 v1

Abstract

The tensor complementarity problem (\q,A)(\q, \mathcal{A}) is to \mboxfind\xRn\mboxsuchthat\x\0,\q+A\xm1\0,\mboxand\x(\q+A\xm1)=0.\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 tensor A\mathcal{A} is a (strictly) semi-positive tensor if and only if the tensor complementarity problem (\q,A)(\q, \mathcal{A}) has a unique solution for \q>\0\q>\0 (\q\0\q\geq\0), and a symmetric real tensor is a (strictly) semi-positive tensor if and only if it is (strictly) copositive. That is, for a strictly copositive symmetric tensor A\mathcal{A}, the tensor complementarity problem (\q,A)(\q, \mathcal{A}) has a solution for all \qRn\q \in \mathbb{R}^n.

Keywords

Cite

@article{arxiv.1502.02209,
  title  = {Tensor Complementarity Problem and Semi-positive Tensors},
  author = {Yisheng Song and Liqun Qi},
  journal= {arXiv preprint arXiv:1502.02209},
  year   = {2015}
}
R2 v1 2026-06-22T08:24:43.031Z