An application of the nonuniform covering method to global optimization of mixed integer nonlinear problems

The nonuniform covering method for global optimization of functions of several variables is extended to nonlinear programs. It is shown that this method can be used for solving problems that, in addition to conventional constraints, involve partial integrality conditions. Estimates for the accuracy of the solution and for the number of steps required for finding a minimum with a prescribed tolerance are derived. New minorants based on an estimate for the spectrum of the Hessian matrix of the objective function and the constraints are given. New formulas for covering sets improving the efficiency of the method are obtained. Examples of solving nonlinear programs with the use of the proposed approach are presented.