Academic
Publications
A family of hybrid conjugate gradient methods for unconstrained optimization

A family of hybrid conjugate gradient methods for unconstrained optimization,10.1090/S0025-5718-03-01491-1,Mathematics of Computation,Yu-Hong Dai

A family of hybrid conjugate gradient methods for unconstrained optimization   (Citations: 7)
BibTex | RIS | RefWorks Download
Conjugate gradient methods are an important class of methods for unconstrained optimization, especially for large-scale problems. Recently, they have been much studied. This paper proposes a three-parameter family of hybrid conjugate gradient methods. Two important features of the family are that (i) it can avoid the propensity of small steps, namely, if a small step is generated away from the solution point, the next search direction will be close to the negative gradient direction; and (ii) its descent property and global convergence are likely to be achieved provided that the line search satises the Wolfe conditions. Some numerical results with the family are also presented.
Journal: Mathematics of Computation - Math. Comput. , vol. 72, no. 243, pp. 1317-1328, 2003
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: