A class of algorithms is described for unconstrained optimization, based on the BFGS update formula, which includes an automatic column scaling strategy. The new algorithms generalize the method of Powell [Math. Programming, 38 (1987), pp. 29–46]. Conditions are given on the scaling strategies that guarantee global and superlinear convergence on convex problems.