Output from FIND_GLOBAL_MIN on 05/05/2012 at 03:41:47. Version for the system is: March 13, 2009 Codelist file name is: ex14_1_8_sourceG.CDL Box data file name is: ex14_1_8_source.DT1 Initial box: [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] [ -0.100E+05, 0.100E+05 ] 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. LIST OF SMALL BOXES: Box no.: 1 Box coordinates: [ 0.724 , 0.726 ], [ 0.244 , 0.246 ] [ -0.100E-02, 0.100E-02 ] PHI: [ -0.100E-02, 0.100E-02 ] Box contains the following approximate root: 0.725 , 0.245 , -0.996E-08 OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT: [ -0.996E-08, -0.996E-08 ] Unknown = T Contains_root = F Fritz John multiplier U0: [ 0.500 , 0.500 ] Fritz John multipliers U: [ 0.00 , 0.250 ], [ 0.00 , 0.250 ] [ 0.00 , 0.253 ], [ 0.00 , 0.253 ] [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] INEQ_CERT_FEASIBLE: F F F F T T T T NIN_POSS_BINDING: 4 ------------------------------------------------- Box no.: 2 Box coordinates: [ 0.107 , 0.109 ], [ 0.645 , 0.647 ] [ 0.106E-01, 0.126E-01 ] PHI: [ 0.106E-01, 0.126E-01 ] Box contains the following approximate root: 0.108 , 0.646 , 0.116E-01 OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT: [ 0.116E-01, 0.116E-01 ] Unknown = T Contains_root = F Fritz John multiplier U0: [ 0.500 , 0.500 ] Fritz John multipliers U: [ 0.500 , 0.500 ], [ 0.00 , 0.500 ] [ 0.00 , 0.141E-16 ], [ 0.00 , 0.250 ] [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] INEQ_CERT_FEASIBLE: F T T T T T T T NIN_POSS_BINDING: 1 ------------------------------------------------- THERE WERE NO BOXES CORRESPONDING TO VERIFIED FEASIBLE POINTS. ALGORITHM COMPLETED WITH LESS THAN THE MAXIMUM NUMBER, 500000 OF BOXES. Number of bisections: 5041 No. dense interval residual evaluations -- gradient code list: 96097 Number of orig. system inverse midpoint preconditioner rows: 50290 Number of orig. system C-LP preconditioner rows: 65546 Number of solutions for a component in the expanded system: 640334 Total number of forward_substitutions: 290238 Number of Gauss--Seidel steps on the dense system: 109091 Number point dense residual evaluations, gradient codelist: 24299 Number of gradient evaluations from a gradient code list: 34201 Total number of dense slope matrix evaluations: 72600 Total number second-order interval evaluations of the original function: 13839 Total number dense interval constraint evaluations: 1335360 Total number dense interval constraint gradient component evaluations: 2372088 Total number dense point constraint gradient component evaluations: 689208 Total number dense interval reduced gradient evaluations: 73909 Total number of calls to FRITZ_JOHN_RESIDUALS: 20846 Number of times a box was rejected because the gradient or reduced gradient did not contain zero: 1259 Number of times feasible point was found based on the LP_FILTER approximate solution: 2 Average number of overall loop iterations in each call to the reduced interval Newton method): 1.78 Number of times a box was rejected in the interval Newton method due to an empty intersection: 1458 Number of times the interval Newton method made a coordinate interval smaller: 27098 Number of times a pivoting preconditioner made a coordinate interval smaller or rejected a coordinate: 6147 Number of times a pivoting preconditioner was successful after the first sweep: 3690 Number of times a midpoint matrix was factored: 8122 Total number of times the reduced interval Newton method was tried: 7862 Number of times an inverse midpoint preconditioner led to improvement or rejection: 5075 Number of times a C LP preconditioner led to improvement or rejection: 1058 N_C_LP_INFEASIBLE = 123 N_NEW_BEST_ESTIMATE_WITH_LP filter = 2 N_REJECT_WITH_LP filter = 1 N_LPF_INF_OR_UNB = 123 Number of times a C LP preconditioner was not computed because the heuristic determined it was not worth it: 4744 Number of possible splits as detected by the pivoting preconditioner: 12630 Total time spent in the LP filter (creating and solving the LP): 27.9 Total time spent in subsit (constraint propagation): 0.552 Total time spent in reduced_interval_Newton (iteration to reduce the box): 4.20 Total time spent searching for "D" in the LP filter: 0.944 Total time spent actually solving the linear relaxations: 22.7 Total time spent doing linear algebra (preconditioners and solution processes): 2.37 Total time spent running the approximate optimizer: 0.280E-01 LIST_BOOKKEEPING_TIME: 0.904 FUNCTION_EVALUATION_TIME (in forward_substitution): 4.77 Time spent setting up pivoting preconditioners: 0.228 Time spent computing pivoting preconditioners: 0.288 Time spent computing LP preconditioners: 0.384 Time spent computing inverse midpoint preconditioners: 0.840E-01 Number of times MAXIT was exceeded in C_LP_DENSE: 4 Number of times the approximate solver was called: 2317 Number Fritz-John matrix evaluations: 19587 Number of times SUBSIT decreased one or more coordinate widths: 1611 Number of times SUBSIT rejected a box: 507 Number times a box was rejected due infeasible inequality constraints: 119 Total number of boxes processed in loop: 8380 N_FINDOPT_SUCCESS = 5 BEST_ESTIMATE: 0.171E-01 Overall CPU time: 69.1 CPU time in PEEL_BOUNDARY: 0.00 CPU time in REDUCED_INTERVAL_NEWTON: 4.20 =================================================== =================================================== Number of boxes in the list with proven feasible points: 0 Number of boxes in the list of other small boxes: 2 Number of unfathomed boxes: 0 Interval hull of the small unverified boxes: [ 0.107 , 0.726 ], [ 0.244 , 0.647 ] [ -0.100E-02, 0.126E-01 ] Rigorously verified bounds on the optimum, provided an optimum exists: [ -0.100E-02, 0.126E-01 ]