Algorithms for the linear complementarity problem which allow an arbitrary starting point

TL;DR: The linear complementarity problem with data q ɛ Rn and M ǫ Rn×n consists in finding two vectory s and z in Rn such that(1.1) ============

Abstract: The linear complementarity problem with data q ɛ Rn and M ɛ Rn×n consists in finding two vectory s and z in Rn such that(1.1) $${\text{s = Mz + q ,}}$$ (1.1) (1.2) $$s,\;z\; \ge \;0\;,$$ (1.2) (1.3) $${s_i}{z_{i\;}} = \;0\;,\;i\; = \;1,\;2, \ldots ,\;n\;.$$ (1.3) .