Mathematics of Computation · 2008 · 46 citations · 22 references
Natural SciencesComputer ScienceAlgorithmsComputational MechanicsOptimizationConstrained OptimizationConvex OptimizationGlobal OptimizationGradient-based OptimizationOptimization TheoryUnconstrained OptimizationConvergenceGlobal Convergence AnalysisGlobal Search AlgorithmsNonconvex Optimization
We propose two algorithms for nonconvex unconstrained optimization problems that employ Polak-Ribière-Polyak conjugate gradient formula and new inexact line search techniques. We show that the new algorithms converge globally if the function to be minimized has Lipschitz continuous gradients. Preliminary numerical results show that the proposed methods for particularly chosen line search conditions are very promising.
22
Function minimization by conjugate gradients
R. Fletcher · The Computer Journal · 1964 · 4.9K citations · Full text