Output from FIND_GLOBAL_MIN on 05/07/2012 at 08:56:44. Version for the system is: March 13, 2009 Codelist file name is: ex6_2_11G.CDL Box data file name is: ex6_2_11.DT1 Initial box: [ 0.100E-05, 1.00 ], [ 0.100E-05, 1.00 ] [ 0.100E-05, 1.00 ] BOUND_CONSTRAINT: F F F F F F --------------------------------------- CONFIGURATION VALUES: EPS_DOMAIN: 0.1000D-07 MAXITR: 500000 SMALLEST_LIST_BOX_SIZE = 0.0000D+00 A_PRIORI_UPPER_BOUND (on global optimum): 0.180+309 MAX_CPU_SECONDS: 0.720E+04 MAX_LP_PRE: 10000000 ALSO_PRINT_TO_TERMINAL F NO_ABSOLUTE_VALUE_IN_MINIMAX F MAX_PT_SOLVER_ITER 3000 MAX_SMALL_BOXES 2000 MAX_BEFORE_AMALGAMATE 200 DO_INTERVAL_NEWTON: T QUADRATIC: T FULL_SPACE: F VERY_GOOD_INITIAL_GUESS: F USE_SUBSIT: T OUTPUT UNIT: 7 PRINT_LENGTH: 3 USE_INTRINSIC_PRINTING: T PHI_MUST_CONVERGE: T EQ_CNS_MUST_CONVERGE: T INEQ_CNS_MUST_CONVERGE: T ALLOW_EPSILON_APPROXIMATE: F USES_INTERMEDIATE_VARIABLES: F PHI_THICKNESS_FACTOR: 0.500 EQ_CNS_THICKNESS_FACTOR: 0.500 INEQ_CNS_THICKNESS_FACTOR: 0.500 PHI_MUST_CONVERGE: T EQ_CNS_MUST_CONVERGE: T INEQ_CNS_MUST_CONVERGE: T PHI_CONVERGENCE_FACTOR: 0.100E-13 EQ_CNS_CONVERGENCE_FACTOR: 0.100E-13 INEQ_CNS_CONVERGENCE_FACTOR: 0.100E-13 CONTINUITY_ACROSS_BRANCHES: F SINGULAR_EXPANSION_FACTOR: 10.0 HEURISTIC PARAMETER ALPHA: 0.500 APPROX_OPT_BEFORE_BISECTION: F APPROX_OPTIMIZER_TYPE 7 USE_LP: T ITERATE__LP: F EPS_LP_FIT: 1.00000000000000002E-002 USE_EPPERLY_SPLIT: 0 PRINTING_IN_SPLIT 0 USE_REDUCED_SPACE: F REDUCED_IN_BISECTION: T USE_TAYLOR_EQUALITY_CONSTRAINTS F USE_TAYLOR_INEQ_CONSTRAINTS F USE_TAYLOR_OBJECTIVE F USE_TAYLOR_EQ_CNS_GRD F USE_TAYLOR_GRAD F USE_TAYLOR_INEQ_CNS_GRD F USE_TAYLOR_REDUCED_INEWTON F COSY_POLYNOMIAL_ORDER 5 LEAST_SQUARES_FUNCTIONS: F NONLINEAR_SYSTEM: F UNCONSTRAINED_MINIMAX: F NO_ABSOLUTE_VALUE_IN_MINIMAX: F DO_INFEASIBILITY_CHECK: T DO_PIVOTING: T DO_INV_MID: T TRY_C_LP_HEURISTIC: 10000000000.000000 REUSE_PRECONDITIONERS: T ORDERED_LIST_IN_COMPLEMENTATION 1 DO_PROBE: F DO_PROBE_TESTS_3_AND_4: F USE_INEQ_PERTURB_FOR_FEAS: F DO_SPLITS_IN_SUBSIT F PRINTING_IN_VALIDATE_FJ: 0 PRINT_SUBSIT: 0 ALSO_PRINT_TO_TERMINAL F C-LP is used for computing C-LP preconditioners. UNCONSTRAINED_MINIMAX F NO_ABSOLUTE_VALUE_IN_MINIMAX F MINIMAX_FORMULATION_2 T C_LP_DENSE, Manuel Novoa's special routine, was used to compute LP preconditioners. THERE WERE NO BOXES IN THE LIST OF SMALL BOXES. LIST OF BOXES CONTAINING VERIFIED FEASIBLE POINTS: Box no.: 1 Box coordinates: [ 0.329 , 0.331 ], [ 0.612E-02, 0.812E-02 ] [ 0.662 , 0.664 ] PHI: [ -0.549 , 0.548 ] Box contains the following approximate root: 0.330 , 0.712E-02, 0.663 OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT: [ 0.163E-04, 0.163E-04 ] Unknown = T Contains_root = F Fritz John multiplier U0: [ 0.00 , 1.00 ] Fritz John multipliers U: [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] Fritz John multipliers V: [ -1.00 , 1.00 ] INEQ_CERT_FEASIBLE: F F F F F F NIN_POSS_BINDING: 6 ------------------------------------------------- Box no.: 2 Box coordinates: [ 0.244E-02, 0.444E-02 ], [ 0.994 , 0.996 ] [ 0.948E-03, 0.295E-02 ] PHI: [ -0.639 , 0.636 ] Box contains the following approximate root: 0.344E-02, 0.995 , 0.195E-02 OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT: [ 0.242E-05, 0.242E-05 ] Unknown = T Contains_root = F Fritz John multiplier U0: [ 0.00 , 1.00 ] Fritz John multipliers U: [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] Fritz John multipliers V: [ -1.00 , 1.00 ] INEQ_CERT_FEASIBLE: F F F F F F NIN_POSS_BINDING: 6 ------------------------------------------------- ALGORITHM COMPLETED WITH LESS THAN THE MAXIMUM NUMBER, 500000 OF BOXES. Number of bisections: 6416 No. dense interval residual evaluations -- gradient code list: 109779 Number of orig. system inverse midpoint preconditioner rows: 40684 Number of orig. system C-LP preconditioner rows: 29515 Number of solutions for a component in the expanded system: 3895799 Total number of forward_substitutions: 339561 Number of Gauss--Seidel steps on the dense system: 72805 Number point dense residual evaluations, gradient codelist: 27 Number of gradient evaluations from a gradient code list: 36081 Total number of dense slope matrix evaluations: 87117 Total number second-order interval evaluations of the original function: 19968 Total number dense interval constraint evaluations: 909567 Total number dense interval constraint gradient component evaluations: 1399128 Total number dense point constraint gradient component evaluations: 630 Total number dense interval reduced gradient evaluations: 89551 Total number of calls to FRITZ_JOHN_RESIDUALS: 22395 Number of times a box was rejected because the gradient or reduced gradient did not contain zero: 12 Number of times feasible point was found based on the LP_FILTER approximate solution: 1 Average number of overall loop iterations in each call to the reduced interval Newton method): 2.89 Number of times a box was rejected in the interval Newton method due to an empty intersection: 1322 Number of times the interval Newton method made a coordinate interval smaller: 21221 Number of times a pivoting preconditioner made a coordinate interval smaller or rejected a coordinate: 20504 Number of times a pivoting preconditioner was successful after the first sweep: 12945 Number of times a midpoint matrix was factored: 7980 Total number of times the reduced interval Newton method was tried: 7749 Number of times an inverse midpoint preconditioner led to improvement or rejection: 1448 Number of times a C LP preconditioner led to improvement or rejection: 570 Number of times computing a C_LP failed 110 N_NEW_BEST_ESTIMATE_WITH_LP filter = 1 Number of possible splits as detected by the pivoting preconditioner: 22378 Total time spent in the LP filter (creating and solving the LP): 51.1 Total time spent in subsit (constraint propagation): 2.68 Total time spent in reduced_interval_Newton (iteration to reduce the box): 18.6 Total time spent searching for "D" in the LP filter: 0.236 Total time spent actually solving the linear relaxations: 40.8 Total time spent doing linear algebra (preconditioners and solution processes): 1.22 LIST_BOOKKEEPING_TIME: 1.66 FUNCTION_EVALUATION_TIME (in forward_substitution): 43.9 Time spent setting up pivoting preconditioners: 0.188 Time spent computing pivoting preconditioners: 0.220 Time spent computing LP preconditioners: 0.212 Time spent computing inverse midpoint preconditioners: 0.132 Number of times MAXIT was exceeded in C_LP_DENSE: 47 Number of unbounded problems found in C_LP_DENSE: 110 Number of times the approximate solver was called: 1 Number Fritz-John matrix evaluations: 22383 Number of times SUBSIT decreased one or more coordinate widths: 2179 Total number of boxes processed in loop: 7750 N_FINDOPT_SUCCESS = 2 BEST_ESTIMATE: 0.242E-05 Overall CPU time: 119. CPU time in PEEL_BOUNDARY: 0.00 CPU time in REDUCED_INTERVAL_NEWTON: 18.6 =================================================== =================================================== Number of boxes in the list with proven feasible points: 2 Number of boxes in the list of other small boxes: 0 Number of unfathomed boxes: 0 Interval hull of the boxes verified to contain feasible points or critical points: [ 0.244E-02, 0.331 ], [ 0.612E-02, 0.996 ] [ 0.948E-03, 0.664 ] Rigorously verified bounds on the optimum, provided an optimum exists: [ -0.639 , 0.242E-05 ]