An algorithm is presented for the minimax solution of an overdetermined system of non-linear equations. The method is based on the Levenberg-like approach of Anderson & Osborne (1977), with modifications to take account of second derivative information and so to widen the class of problems for which fast ultimate convergence can be obtained.