E05JBF Example Program Results

 (OBJFUN was just called for the first time)

 *** Begin monitoring information ***

 Values controlling initial splitting of a box:
 **
 In dimension     1
 Extent of initialization list in this dimension =    3
 Initialization points in this dimension:
 LIST(I,1:NUMPTS(I)) = -3.00000  0.00000  3.00000
 Initial point in this dimension: LIST(I,    2)
 **
 In dimension     2
 Extent of initialization list in this dimension =    3
 Initialization points in this dimension:
 LIST(I,1:NUMPTS(I)) = -3.00000  0.00000  3.00000
 Initial point in this dimension: LIST(I,    2)
 Total sub-boxes =  228
 Total function evaluations (rounded to nearest 20) =  200
 Total function evaluations used in local search (rounded
   to nearest 15) =   90
 Total points used in local search =   13
 Total sweeps through levels =   12
 Total splits by init. list =    5
 Lowest level with nonsplit boxes =    7
 Number of candidate minima in the "shopping basket" =    2
 Shopping basket:
 XBASKT(  1,:) = -1.34740  0.22828
 XBASKT(  2,:) =  0.20452 -1.62553
 Best point:
 XBEST =  0.22828 -1.62553

 *** End monitoring information ***


 Final objective value =   -6.55113
 Global optimum X =  0.22828 -1.62553