Efficient unidimensional direct search schemes for optimization problems

In this paper, we develop three new and efficient unidimensional direct search schemes based on weighted arithmetic mean, weighted geometric mean and weighted harmonic mean in solving optimization problems. We test the performance of these algorithms on a set of standard undimensional test functions to ascertain their superiority, reliability and efficiency, by comparing these three methods with the existing arithmetic mean, geometric mean, harmonic mean and root mean square methods in the literature.