no. 3 · Tuesday 27 October 2026
Dimension in Polynomial Variational Inequalities
Abstract
We study the dimension of the solution set of a variational inequality whose operator is polynomial and whose constraint set is defined by finitely many convex polynomial inequalities and affine equations. Under the Abadie constraint qualification, we bound this dimension from above in terms of the ranks of the Jacobian matrices of the associated Karush–Kuhn–Tucker maps; the bound is attained in nontrivial examples and yields a sufficient condition for finiteness of the solution set. For polynomial complementarity problems, the bound is expressed through principal submatrices of the Jacobian matrix of the operator, and the resulting finiteness criterion extends the classical nondegeneracy condition for linear complementarity problems.
- fields
- Optimization and Control