Linear complementarity procedures in quadratic programming

We propose a new approach to consideration of quadratic programming methods, based on the general scheme of suboptimization. The quadratic programming problem is interpreted as a particular case of the linear complementarity problem. Thus, algorithms can be regarded as a natural generalization of the simplex-method.