We propose a new method for solving univariate global optimization problems by combining a lower bound function of ®BB method (see [1]) with the lower bound function of the method developed in [4]. The new lower bound function is better than the two lower bound functions. We add the convex/concave test and pruning step which accelerate the convergence of the proposed method. Illustrative examples are treated efficiently.
Citation
Submitted
Article
View Efficient combination of two lower bound functions in univariate global optimization