SpringerPlus · 2016 · 20 citations · 10 references
Natural SciencesComputer ScienceAlgorithmsDesign OptimizationOptimizationGlobal OptimizationGradient-based OptimizationHeuristic OptimizationMetaheuristic OptimizationOptimization TheoryUnconstrained OptimizationConvergenceDescentGlobal Convergence AnalysisGradient Method OptimizationSteepest Descent
The conjugate gradient method was an efficient technique for solving the unconstrained optimization problem. In this paper, we made a linear combination with parameters β k of the DY method and the HS method, and putted forward the hybrid method of DY and HS. We also proposed the hybrid of FR and PRP by the same mean. Additionally, to present the two hybrid methods, we promoted the Wolfe line search respectively to compute the step size α k of the two hybrid methods. With the new Wolfe line search, the two hybrid methods had descent property and global convergence property of the two hybrid methods that can also be proved.
10
Function minimization by conjugate gradients
R. Fletcher · The Computer Journal · 1964 · 4.9K citations · Full text
Restart procedures for the conjugate gradient method
M. J. D. Powell · Mathematical Programming · 1977 · 1.7K citations