A direct search algorithm for unconstrained minimization of smooth functions is described. The algorithm minimizes the function over a sequence of successively finer grids. Each grid is defined by a set of basis vectors. From time to time these basis vectors are updated to include available second derivative information by making some basis vectors mutually conjugate. Convergence to one or more stationary points is shown, and the finite termination property of conjugate direction methods on strictly convex quadratics is retained. Numerical results show that the algorithm is effective on a variety of problems including ill-conditioned problems.
@article{609,
title = {A direct search conjugate directions algorithm for unconstrained minimization},
journal = {ANZIAM Journal},
volume = {42},
year = {2000},
doi = {10.21914/anziamj.v42i0.609},
language = {EN},
url = {http://dml.mathdoc.fr/item/609}
}
Coope, I. D.; Price, C. J. A direct search conjugate directions algorithm for unconstrained minimization. ANZIAM Journal, Tome 42 (2000) . doi : 10.21914/anziamj.v42i0.609. http://gdmltest.u-ga.fr/item/609/