in this talk, we introduce the lrhb algorithm, which is an extension of the reduced-hessian method of gill and leonard for unconstrained problems to problems with simple bound constraints. numerical results for lrhb will be presented. we will also consider computational and practical issues with methods for nonlinear optimization and present results on a large test collection of problems indicating the reliability and efficiency of sequential quadratic programming methods and interior-point methods on certain classes of problems. this is joint work with michael ferry and philip e. gill.