2016
DOI: 10.1007/s11590-016-1104-7
|View full text |Cite
|
Sign up to set email alerts
|

Strictly semi-positive tensors and the boundedness of tensor complementarity problems

Abstract: In this paper, we present the boundedness of solution set of tensor complementarity problem defined by a strictly semi-positive tensor. For strictly semi-positive tensor, we prove that all H + (Z + )-eigenvalues of each principal sub-tensor are positive. We define two new constants associated with H + (Z + )-eigenvalues of a strictly semi-positive tensor. With the help of these two constants, we establish upper bounds of an important quantity whose positivity is a necessary and sufficient condition for a gener… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
20
0
1

Year Published

2017
2017
2022
2022

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 52 publications
(21 citation statements)
references
References 41 publications
(54 reference statements)
0
20
0
1
Order By: Relevance
“…So, we may probe into checking copositivity of tensors and its applications by means of studying this class of semipositive tensors. For its more properties and applications in TCP, see [5,6,9,10,14,15,17,19,30,[46][47][48][51][52][53] and references cited therein.…”
Section: Introductionmentioning
confidence: 99%
“…So, we may probe into checking copositivity of tensors and its applications by means of studying this class of semipositive tensors. For its more properties and applications in TCP, see [5,6,9,10,14,15,17,19,30,[46][47][48][51][52][53] and references cited therein.…”
Section: Introductionmentioning
confidence: 99%
“…As a natural extension of the linear complementarity problem, the TCP( , A) emerged from the tensor community in 2015 [1]. In recent several years, the TCP( , A) has been a hot topic and many theoretical results have been obtained, including the nonemptiness and/or compactness of solution set [4][5][6][7][8][9][10][11][12][13][14][15][16], the existence of unique solution [7,8,14,[17][18][19][20][21][22], error bound theory [23][24][25], strict feasibility [22,26], and so on. Several algorithms for solving the TCP( , A) have also been proposed [27][28][29][30][31].…”
Section: Introductionmentioning
confidence: 99%
“…It is easy to see that strong strictly semi-positiveness implies strictly semipositiveness but the converse is not true ( [16]). Song, Qi, and Yu [22,23,25] proved the existence and boundedness of solutions of TCPs for strictly semipositive tensors. Liu, Li, and Vong [16] proved that a TCP possesses the global uniqueness and solvability property if the tensor is strong strictly semipositive, extending a similar result of Bai, Huang, and Wang [3] regarding strong P tensors.…”
Section: Introductionmentioning
confidence: 99%