Univariate representations of solutions to generic polynomial complementarity problems
From MaRDI portal
Gröbner basisleast-norm solutionpolynomial complementarity problemshape lemmasolution setsparse solutionunivariate representationzero-dimensional ideal
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Solving polynomial systems; resultants (13P15) Numerical computation of roots of polynomial equations (65H04) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites work
- A continuation method for tensor complementarity problems
- A mixed integer programming approach to the tensor complementarity problem
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- A NOTE ON THE SQUARED SLACK VARIABLES TECHNIQUE FOR NONLINEAR OPTIMIZATION
- A potential reduction method for tensor complementarity problems
- A semidefinite method for tensor complementarity problems
- An equivalent tensor equation to the tensor complementarity problem with positive semi-definite Z-tensor
- An iterative method for finding the least solution to the tensor complementarity problem
- Bounds of the solution set to the polynomial complementarity problem
- Compactness criteria for real algebraic sets and Newton polyhedra
- Complementary pivot theory of mathematical programming
- Complementary problems with polynomial data
- Computing local minimizers in polynomial optimization under genericity conditions
- Computing the dimension of real algebraic sets
- Existence and uniqueness of solutions of the generalized polynomial variational inequality
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- scientific article; zbMATH DE number 4132308 (Why is no real title available?)
- scientific article; zbMATH DE number 1395651 (Why is no real title available?)
- scientific article; zbMATH DE number 7313887 (Why is no real title available?)
- Introduction to complex manifolds
- Lower bounds of the solution set of the polynomial complementarity problem
- msolve. A library for solving polynomial systems
- Nonemptiness and compactness of solution sets to generalized polynomial complementarity problems
- Notes on the optimization problems corresponding to polynomial complementarity problems
- NP-completeness of the linear complementarity problem
- On error bounds of polynomial complementarity problems with structured tensors
- On the R0-tensors and the solution map of tensor complementarity problems
- Polynomial complementarity problems
- Positive-definite tensors to nonlinear complementarity problems
- Solution maps of polynomial variational inequalities
- Solving zero-dimensional systems through the rational univariate representation
- Sparse solutions of linear complementarity problems
- Strict feasibility for the polynomial complementarity problem
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
- Tensor complementarity problem and semi-positive tensors
- Tensor complementarity problems: the GUS-property and an algorithm
- Tensor complementarity problems. I: Basic theory
- Tensor complementarity problems. II: Solution methods
- The sparsest solutions to \(Z\)-tensor complementarity problems
This page was built for publication: Univariate representations of solutions to generic polynomial complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6941465)
