Solving one-dimensional unconstrained global optimization problem using parameter free filled function method

It is generally known that almost all filled function methods for one-dimensional unconstrained global optimization problems have computational weaknesses. This paper introduces a relatively new parameter free filled function, which creates a non-ascending bridge from any local isolated minimizer to other first local isolated minimizer with lower or equal function value. The algorithm’s unprecedented function can be used to determine all extreme...