The BFGS algorithm is probably the most widely-used quasi-Newton method for moderately-sized continuous problems that are not extremely nonconvex. It is more robust than other quasi-Newton methods such as DFP (Nocedal, 1992), and it is faster than Newton's method, since the Hessian matrix need not be calculated. One could easily create a Newton algorithm using the source code for bfgsmin.