Global optimization over general compact sets by the beta algorithm: A MAPLE code

Abstract

A variant of the beta algorithm based on the cubic algorithm [1,2] is presented for global optimization of Hölder continuous functions over general compact sets. The set-monotonic algorithm contains a block for problems with equality constraints, and operates within the unit cube [0,1] n universal for all problems. On this basis, a MAPLE code of modular structure is developed for full global optimization of functions of n variables. The code does not create ill-conditioned situations. Graphics are included, and the solution set can be visualized in plane projections and sections. The code is ready for engineering applications. Results of numerical experiments are presented, with graphs, to illustrate the use of the code.