
doi: 10.1007/bf00932464
A general complementarity problem with respect to a convex cone and its polar in a locally convex, vector-topological space is defined. It is observed that, in this general setting, the problem is equivalent to a variational inequality over a convex cone. An existence theorem is established for this general case, from which several of the known results for the finite-dimensional cases follow under weaker assumptions than have been required previously. In particular, it is shown that, if the given map under consideration is strongly copositive with respect to the underlying convex cone, then the complementarity problem has a solution.
Convex programming, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Convex programming, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 250 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 0.1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
