
doi: 10.1007/bf00938441
\textit{B. C. Eaves} [Math. Programming, 1, 68-75 (1971; Zbl 0227.90044)] and \textit{M. Kojima} [ibid. 9, 257-277 (1975; Zbl 0347.90039)] have separately provided fixed-point representations of the standard complementarity problem. Although the mappings used to describe their representations appear to be different, this paper shows they are essentially the same, a unification that is accomplished via a geometric programming argument in the context of a more general complementarity problem.
dual cones, fixed points, Mathematical programming, complementarity problem, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
dual cones, fixed points, Mathematical programming, complementarity problem, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
| citations 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). | 0 | |
| 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. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
