The auxiliary problem for feasible directions

Abstract

The present work compares the computational efficiency of two means of determining a direction vector S at constraint boundaries and demonstrates the advantages of using the alternative that formulates the S-determination subproblem with a single quadratic constraint, which in turn can be cast as a special linear problem and solved directly.