Simplex methods of direct search

Simplex methods are proposed for minimizing nonlinear functions with a controllable number of mapped vertices. A newly introduced rule of «step success» helps control the step. In minimizing convex and strongly convex functions the methods are shown to converge and estimates of the rate of convergence are given.