A two-dimensional search for a Gauss-Newton algorithm

This paper describes a fall-back procedure for use with the Gauss-Newton method for non-linear least-squares problems. While the basic Gauss-Newton algorithm is often success-ful, it is well-known that it can sometimes generate poor search directions and exhibit slow convergence. For dealing with such situations we suggest a new two-dimensional search strategy. Numerical experiments indicate that the proposed technique can be effective.