Strict feasibility for the polynomial complementarity problem

• Published in: Journal of global optimization Vol. 89; no. 1; pp. 57 - 71
• Main Authors: Li, Xue-liu, Tang, Guo-ji
• Format: Journal Article
• Language: English
• 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

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