A truncated Newton method with non-monotone line search for unconstrained optimization (Q1095799): Difference between revisions

An unconstrained minimization algorithm is defined, in which a non- monotone line search technique is employed in association with a truncated Newton algorithm. Numerical results obtained for a set of standard test problems are reported which indicate that the proposed algorithm is highly effective in the solution of ill-conditioned as well as of large dimensional problems.