A study of Newton’s method for unconstrained optimization

This paper discusses the use of the Newton’s method in unconstrained optimization. Special emphasis is given to large and sparse problems. The paper only considers the case in which the search direction is found by a direct linear equations solver. Monotone and nonmonotone line-searches are discussed. Some numerical results are included and lead to the recommendation of nonmonotone line-search techniques to globalize Newton’s algorithm.