Extended conjugate-gradient methods with restarts |
| |
Authors: | W. R. Boland J. S. Kowalik |
| |
Affiliation: | (1) Department of Mathematical Sciences, Clemson University, Clemson, South Carolina;(2) Department of Computer Science, Washington State University, Pullman, Washington |
| |
Abstract: | Three variants of the classical conjugate-gradient method are presented. Two of these variants are based upon a nonlinear function of a quadratic form. A restarting procedure due to Powell, and based upon some earlier work of Beale, is discussed and incorporated into two of the variants. Results of applying the four algorithms to a set of benchmark problems are included, and some tentative conclusions about the relative merits of the four schemes are presented. |
| |
Keywords: | Nonlinear optimization conjugate-gradient methods numerical methods computing methods mathematical programming nonlinear programming |
本文献已被 SpringerLink 等数据库收录! |