作者: Stefano Lucidi , Massimo Roma
关键词:
摘要: Recently, in [12] 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 an extensive numerical experience obtained by different algorithms which belong to preceding class. This study, besides investigating are best algorithmic choices approach, clarifies some significant points underlies every based algorithm.