Article ID: | iaor19981456 |
Country: | Netherlands |
Volume: | 7 |
Issue: | 1 |
Start Page Number: | 71 |
End Page Number: | 87 |
Publication Date: | Jan 1997 |
Journal: | Computational Optimization and Applications |
Authors: | Lucidi Stefano, Roma Massimo |
Keywords: | large-scale optimization |
Recently, a very general class of truncated Newton methods has been proposed for solving large scale unconstrained optimization problems. In this work we present the results of an extensive numerical experience obtained by different algorithms which belong to the preceding class. This numerical study, besides investigating which are the best algorithmic choices of the proposed approach, clarifies some significant points which underlie every truncated Newton based algorithm.