Strict feasibility for the polynomial complementarity problem

In the present paper, the strict feasibility of the polynomial complementarity problem (PCP) is investigated. To this end, as a generalization of the concept of S-tensor, a concept of S-tensor tuple is introduced. Some properties of S-tensor tuples are investigated. In particular, several conditions...

Full description

Saved in:
Bibliographic Details
Published inJournal of global optimization Vol. 89; no. 1; pp. 57 - 71
Main Authors Li, Xue-liu, Tang, Guo-ji
Format Journal Article
LanguageEnglish
Published New York Springer US 01.05.2024
Springer Nature B.V
Subjects
Applied mathematics
Computer Science
Euclidean space
Feasibility
Mathematical analysis
Mathematical programming
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Polynomials
Real Functions
Tensors
Strict feasibility
S-tensor tuple
Polynomial complementarity problem
Online AccessGet full text

Cover

More Information
Summary:In the present paper, the strict feasibility of the polynomial complementarity problem (PCP) is investigated. To this end, as a generalization of the concept of S-tensor, a concept of S-tensor tuple is introduced. Some properties of S-tensor tuples are investigated. In particular, several conditions are proposed to judge whether a tensor tuple is an S-tensor tuple or not. Then, based on the S-tensor tuple, the strict feasibility of PCP is investigated.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-023-01339-z