—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the method for class of strictly unimodal functions including class of strictly convex functions is proved. The computational results are presented for a set of test problems.
A. N. Baushev, E. Y. Morozova