More on Quadratic Programming

The positive definite, equalities case of quadratic programming with n variables is converted into an n dimensional symmetric positive semidefinite linear complementarity problem, which can be solved by any of several methods, including a recently proposed method designed for such a structure. The positive semidefinite, inequalities case is converted, by a perturbation, into the case above, although there are numerical problems associated with taking this approach in practice. Finally, some areas for further research are outlined for the linear programming case.