• COMPUTATIONAL TREATMENTS OF AN IMPROVED CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED MINIMIZATION
Abstract
Recently, the authors introduced a new three-terms nonlinear Conjugate Gradient (CG) method [2] for solving unconstrained optimization problems. Their method was compared with the well-known Zhang's three-terms CG-method [32]. This paper contains a description of several new restarting procedures for the same proposed CG-method introduced by the authors and a numerical investigation of the influence of several scaling techniques with a modified perfect cubic line search procedure on their efficiency. Computational results obtained by means of (35) sufficiently difficult problems are given with promising numerical results.
Keywords
Conjugate Gradient Method, Unconstrained Optimization, Convergence Property, Line Searches, Restarting and Scaling Techniques, Large-Scale Problems, Computational Numerical Experiments.
Full Text:
PDF
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |