A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We consider a working-set method for solving large-scale quadratic programming problems for which there is no requirement that the objective function be convex. The methods are iterative at two levels, one level relating to the selection of the current working set, and the second due to the method used to solve the equality-constrained problem for this working set. A preconditioned conjugate gradient method is used for this inner iteration, with the preconditioner chosen especially to ensuredoi:10.1016/s0168-9274(02)00120-4 fatcat:dq6m7xqc7ndarjjtiiihhbdvge