Global optimization in Rn with box constraints and applications: A Maple code

A variant of the cubic algorithm [1] is presented for global optimization of continuous functions with box constraints. On this basis, a Maple code is developed for full global optimization of functions of n variables with application to the finding of all roots of a polynomial, to the eigenvalue problems, and to the solution of nonlinear systems of equations, including underdetermined and overdetermined systems. The code does not create ill-conditioned situations. Graphics are included, and the solution set can be visualized in projections on coordinate planes. The code is ready for engineering applications. Results of numerical experiments are presented, with graphs, to illustrate the use of the code.