Polynomial complementarity problems
From MaRDI portal
Publication:3134083
zbMATH Open1384.90105arXiv1609.05267MaRDI QIDQ3134083FDOQ3134083
Authors: M. Seetharama Gowda 
Publication date: 8 February 2018
Abstract: Given a polynomial map f on the Euclidean n-space and a vector q, the polynomial complementarity problem, PCP(f,q), is the nonlinear complementarity problem of finding a nonnegative vector x such that y=f(x)+q is nonnegative and orthogonal to x. It is called a tensor complementarity problem if the polynomial map is homogeneous. In this paper, we establish results connecting the polynomial complementarity problem PCP(f,q) and the tensor complementarity problem PCP(f*,0), where f* is the leading term in the decomposition of f as a sum of homogeneous polynomial maps. We show, for example, that PCP(f,q) has a nonempty compact solution set for every q when zero is the only solution of PCP(f*,0)and the local (topological) degree of min{x,f*(x)} at the origin is nonzero. As a consequence, we establish Karamardian type results for polynomial complementarity problems. By identifying a tensor A of order m and dimension n with its corresponding homogeneous polynomial F(x):= Ax^{m-1}, we relate our results to tensor complementarity problems. These results show that under appropriate conditions, PCP(F+P,q) has a nonempty compact solution set for all polynomial maps P of degree less than m-1 and for all vectors q, thereby substantially improving the existing tensor complementarity results where only problems of the type PCP(F,q) are considered. We introduce the concept of degree of an R_0-tensor and show that the degree of an R-tensor is one. We illustrate our results by constructing matrix based tensors.
Full work available at URL: https://arxiv.org/abs/1609.05267
Recommendations
- Complementary problems with polynomial data
- Nonemptiness and compactness of solution sets to generalized polynomial complementarity problems
- Generalized polynomial complementarity problems over a polyhedral cone
- On error bounds of polynomial complementarity problems with structured tensors
- Tensor eigenvalue complementarity problems
tensornonlinear complementarity problemvariational inequalitydegreetensor complementarity problempolynomial complementarity problem
Cited In (42)
- A copositivity-type existence result for weakly homogeneous variational inequalities
- Nonemptiness and compactness of solution sets to generalized polynomial complementarity problems
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with \(P_0\) mappings
- Existence and uniqueness of solutions of the generalized polynomial variational inequality
- Mixed polynomial variational inequalities
- Nonemptiness and compactness of solution sets to weakly homogeneous generalized variational inequalities
- Error bounds for the solution sets of generalized polynomial complementarity problems
- Tensor complementarity problems. I: Basic theory
- Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones
- Estimations on upper and lower bounds of solutions to a class of tensor complementarity problems
- On the R0-tensors and the solution map of tensor complementarity problems
- Error bounds for the solution sets of quadratic complementarity problems
- Lower bounds of the solution set of the polynomial complementarity problem
- Generalized polynomial complementarity problems over a polyhedral cone
- A Note on the Nonemptiness and Compactness of Solution Sets of Weakly Homogeneous Variational Inequalities
- Copositivity for 3rd-order symmetric tensors and applications
- Existence results of solutions to a generalized vertical polynomial complementarity problem in terms of vertical block tensor tuples
- Title not available (Why is that?)
- Analytical expressions of copositivity for fourth-order symmetric tensors
- On the solution existence and stability of polynomial optimization problems
- Stochastic \(R_0\) tensors to stochastic tensor complementarity problems
- Complementary problems with polynomial data
- Stability of Solutions and Continuity of Solution Maps of Tensor Complementarity Problems
- Connectedness of the solution set of the tensor complementarity problem
- \(\mathrm{P}\)-tensors, \(\mathrm{P}_0\)-tensors, and their applications
- Notes on the optimization problems corresponding to polynomial complementarity problems
- Properties of S-tensors
- Existence and stability for generalized polynomial vector variational inequalities
- Title not available (Why is that?)
- Bounds of the solution set to the polynomial complementarity problem
- Global uniqueness and solvability of tensor variational inequalities
- The bounds of solutions to polynomial complementarity problems
- Strict feasibility for the polynomial complementarity problem
- Solution maps of polynomial variational inequalities
- Bounds of the solution set of the tensor complementarity problem
- Solvability of two classes of tensor complementarity problems
- Structured tensor tuples to polynomial complementarity problems
- Unique solvability of weakly homogeneous generalized variational inequalities
- Copositivity for a class of fourth-order symmetric tensors given by scalar dark matter
- On error bounds of polynomial complementarity problems with structured tensors
- Solvability of monotone tensor complementarity problems
This page was built for publication: Polynomial complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134083)
