A version of Beale's method avoiding the free-variables

Abstract

Whithin the algorithms to solve the quadratic programming problem, Beale's method has proved to be a good one. Due to an entirely new technique to change the basis, a new version of Beale's method avoiding the use of “free-variables” is presented here. This algorithm can be seen as a condensed way to acomplish Beale's method.