Answers are grounded in this paper and cite their sources.
The convergence of direct search methods for unconstrained minimization is examined in the case where the underlying method can be interpreted as a grid or pattern search over successively refined meshes. An important aspect of the main convergence result is that translation, rotation, scaling, and shearing of the successive grids are allowed.
No takes yet. Share an insight, caveat, or question.
Coope et al. (2001) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: