The authors consider Newton-like line search descent methods for solving non-linear least-squares problems. The basis of our approach is to choose a method, or parameters within a method, by minimizing a variational measure which estimates the error in an inverse Hessian approximation. In one approach we consider sizing methods and choose sizing parameters in an optimal way. In another approach we consider various possibilities for hybrid Gauss-Newton/BFGS methods. The authors conclude that a simple Gauss-Newton/BFGS hybrid is both efficient and robust and we illustrate this by a range of comparative tests with other methods. These experiments include not only many well known test problems but also some new classes of large residual problem.
|Number of pages||17|
|Journal||Journal of the Operational Research Society|
|Publication status||Published - May 1985|
ASJC Scopus subject areas
- Management of Technology and Innovation
- Strategy and Management
- Management Science and Operations Research