Strict feasibility for the polynomial complementarity problem

Xue-liu Li () and Guo-ji Tang ()
Additional contact information
Xue-liu Li: Guangxi Minzu University
Guo-ji Tang: Guangxi Minzu University

Journal of Global Optimization, 2024, vol. 89, issue 1, No 3, 57-71

Abstract: Abstract 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.

Keywords: Polynomial complementarity problem; Strict feasibility; S-tensor tuple (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-023-01339-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:89:y:2024:i:1:d:10.1007_s10898-023-01339-z

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-023-01339-z

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().