On the Maximum Degree of an LCP Map
Walter D. Morris · Mathematics of Operations Research · 1990
The Linear Complementarity Problem can be shown to be equivalent to inverting a certain piecewise linear mapping. We give bounds on the degree of this mapping and present a class of matrices that generates maps of high degree.