Properties of the solution set of generalized polynomial complementarity problems

Multilinear algebra, tensor calculus (15A69) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

arXiv classification

math.OC

Abstract: In this paper, we consider the {it generalized polynomial complementarity problem} (GPCP), which covers the recently introduced {it polynomial complementarity problem} (PCP) and the well studied {it tensor complementarity problem} (TCP) as special cases. By exploiting the structure of tensors, we first show that the solution set of GPCPs is nonempty and compact when a pair of leading tensors is cone {�f ER}. Then, we study some topological properties of the solution set of GPCPs under the condition that the leading tensor pair is cone

. Finally, we study a notable global Lipschitzian error bound of the solution set of GPCPs, which is better than the results obtained in the current PCPs and TCPs literature. Moreover, such an error bound is potentially helpful for finding and analyzing numerical solutions to the problem under consideration.

This page was built for publication: Properties of the solution set of generalized polynomial complementarity problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6318103)