A survey of truncated-Newton methods
Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. IV: optimization and nonlinear equations
Regularized Newton Methods for Convex Minimization Problems with Singular Solutions
Computational Optimization and Applications
Journal of Computational and Applied Mathematics
A Truncated Nonmonotone Gauss-Newton Method for Large-Scale Nonlinear Least-Squares Problems
Computational Optimization and Applications
On the convergence of an inexact Newton-type method
Operations Research Letters
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
Recently, Li et al. (Comput. Optim. Appl. 26:131---147, 2004) proposed a regularized Newton method for convex minimization problems. The method retains local quadratic convergence property without requirement of the singularity of the Hessian. In this paper, we develop a truncated regularized Newton method and show its global convergence. We also establish a local quadratic convergence theorem for the truncated method under the same conditions as those in Li et al. (Comput. Optim. Appl. 26:131---147, 2004). At last, we test the proposed method through numerical experiments and compare its performance with the regularized Newton method. The results show that the truncated method outperforms the regularized Newton method.