Now showing items 1-2 of 2
An updating rule for the penalty constant used in the penalty function method for mathematical programming problems
This thesis considers the problem of minimizing a function f(x) subject to a constraint cp(x) = 0, where f is a scalar quantity, x an n-vector, and cp a q-vector, with q being less than n. The penalty function method is ...
Numerical experiments on quadratically convergent algorithms for function minimization
The nine quadratically convergent algorithms for function minimization appearing in Ref. 1 are tested through numerical examples. Both a quadratic function and a nonquadratic function are investigated. For the quadratic ...