The visually interval algorithm for the problem of the constraint global optimization

This paper gave a visually interval algorithm for the global optimal solution to solve the problem of the constraint global optimization. This algorithm ensured that the problem cannot fall into the local optimal solution and improved the convergence speed through using local lipschitz constants. This paper proved the convergence of the algorithm, and numerical examples showed that the algorithm is feasible and effective.