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.
The auxiliary problem for feasible directions
AIAA Journal ; 13
1975-05-01
Sonstige
Keine Angabe
Englisch
The Auxiliary Problem for Feasible Directions
AIAA | 1975
|Optimizing Program Does Feasible-Directions Gradient Search
Online Contents | 1997