Comparative study of various minimization techniques used in mathematical programming

Nine different techniques of unconstrained minimization are applied to the same problem and their relative efficiency is compared. The techniques used are of gradient, variable metric type, used in conjunction with the sequential unconstrained minimization techniques (SUMT) program. The problem tested has nonlinear inequality constraints up to the ninth order.