New interval methods for constrained global optimization

Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adaptive multisection rules which enable the algorithm to choose the proper multisection type depending on simple heuristic decision rules. Moreover, for the selection of the next box to be subdivided, we investigate new criteria. Both the adaptive multisection and the subinterval selection rules seem to be specially suitable for being used in inequality constrained global optimization problems. The usefulness of these new techniques is shown by computational studies.

• Type: Journal
• Year: 2006
• Where: MP
• Authors: Mihály Csaba Markót, J. Fernández, Leocadio G. Casado, Tibor Csendes
• Keywords: Adaptive Multisection, Adaptive Multisection Rules, Global Optimization Problems, MP 2006