On search directions for minimization algorithms
- Cite this article as:
- Powell, M.J.D. Mathematical Programming (1973) 4: 193. doi:10.1007/BF01584660
- 820 Downloads
Some examples are given of differentiable functions of three variables, having the property that if they are treated by the minimization algorithm that searches along the coordinate directions in sequence, then the search path tends to a closed loop. On this loop the gradient of the objective function is bounded away from zero. We discuss the relevance of these examples to the problem of proving general convergence theorems for minimization algorithms that use search directions.