An Interval Method for Nonsmooth Global Optimization Problem
Z Ecun · Or Transactions · 2002
An interval method for nonsmooth global optimization problem is presented via interval tools and a special derivative of the objective function f. The method provides bounds for both the global minimum and the localization of global minimizers of the objective functions. Theory analysis and numerical results are presented, show that the method works efficiently.