Output from FIND_GLOBAL_MIN on 05/02/2012 at 14:35:56. Version for the system is: March 13, 2009 Codelist file name is: harkerG.CDL Box data file name is: harker.DT1 Initial box: [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] BOUND_CONSTRAINT: F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F 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. THERE WERE NO BOXES CORRESPONDING TO VERIFIED FEASIBLE POINTS. ALGORITHM COULD NOT COMPLETE IN 0.7200D+04 SECONDS OF CPU TIME. Number of boxes that have not yet been processed: 31519 Number of bisections: 31518 No. dense interval residual evaluations -- gradient code list: 538573 Number of orig. system inverse midpoint preconditioner rows: 6893 Number of orig. system C-LP preconditioner rows: 1405295 Number of solutions for a component in the expanded system: 5919944 Total number of forward_substitutions: 3730190 Number of Gauss--Seidel steps on the dense system: 6891641 Number point dense residual evaluations, gradient codelist: 24 Number of gradient evaluations from a gradient code list: 157590 Total number of dense slope matrix evaluations: 3270120 Total number second-order interval evaluations of the original function: 63036 Total number dense interval constraint evaluations: 26187015 Total number dense interval constraint gradient component evaluations: 344871584 Total number dense point constraint gradient component evaluations: 14040 Total number dense interval reduced gradient evaluations: 641418 Total number of calls to FRITZ_JOHN_RESIDUALS: 160355 Average number of overall loop iterations in each call to the reduced interval Newton method): 5.09 Number of times a box was rejected in the interval Newton method due to an empty intersection: 1 Number of times the interval Newton method made a coordinate interval smaller: 665083 Number of times a pivoting preconditioner made a coordinate interval smaller or rejected a coordinate: 51 Number of times a pivoting preconditioner was successful after the first sweep: 51 Number of times a midpoint matrix was factored: 160322 Total number of times the reduced interval Newton method was tried: 31518 Number of times a C LP preconditioner led to improvement or rejection: 665016 Number of times computing a C_LP failed 60942 Number of times a C LP preconditioner was not computed because the heuristic determined it was not worth it: 191 Number of possible splits as detected by the pivoting preconditioner: 160353 Total time spent in the LP filter (creating and solving the LP): 0.368E+04 Total time spent in subsit (constraint propagation): 4.82 Total time spent in reduced_interval_Newton (iteration to reduce the box): 0.331E+04 Total time spent searching for "D" in the LP filter: 0.149E+04 Total time spent actually solving the linear relaxations: 0.151E+04 Total time spent doing linear algebra (preconditioners and solution processes): 0.260E+04 LIST_BOOKKEEPING_TIME: 58.8 FUNCTION_EVALUATION_TIME (in forward_substitution): 81.5 Time spent setting up pivoting preconditioners: 59.9 Time spent computing pivoting preconditioners: 24.7 Time spent computing LP preconditioners: 717. Time spent computing inverse midpoint preconditioners: 9.08 Number of times MAXIT was exceeded in C_LP_DENSE: 3250 Number of unbounded problems found in C_LP_DENSE: 60944 Number of times the approximate solver was called: 1 Number Fritz-John matrix evaluations: 160355 Number of times SUBSIT decreased one or more coordinate widths: 15939 Total number of boxes processed in loop: 31518 BEST_ESTIMATE: 0.192E+13 Overall CPU time: 0.720E+04 CPU time in PEEL_BOUNDARY: 0.00 CPU time in REDUCED_INTERVAL_NEWTON: 0.331E+04 =================================================== =================================================== Number of boxes in the list with proven feasible points: 0 Number of boxes in the list of other small boxes: 0 Number of unfathomed boxes: 31519 Interval hull of the unfathomed boxes: [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] Rigorously verified bounds on the optimum, provided an optimum exists: [ -0.425E+04, 0.192E+13 ] FIRST UNFINISHED BOX: Box coordinates: [ 0.00 , 9.77 ], [ 0.00 , 9.77 ] [ 0.00 , 19.5 ], [ 0.00 , 9.77 ] [ 0.00 , 19.5 ], [ 19.5 , 29.3 ] [ 0.00 , 19.5 ], [ 0.00 , 9.77 ] [ 9.77 , 19.5 ], [ 0.00 , 9.77 ] [ 0.00 , 19.5 ], [ 0.00 , 19.5 ] [ 9.77 , 14.6 ], [ 9.77 , 14.6 ] [ 0.00 , 68.4 ], [ 0.00 , 58.6 ] [ 29.3 , 97.7 ], [ 0.00 , 39.1 ] [ 0.00 , 39.1 ], [ 39.1 , 78.1 ] PHI: [ -0.425E+04, 0.117E+05 ] Box does not contain an approximate root. Unknown = T Contains_root = F Fritz John multiplier U0: [ 0.00 , 0.986E-16 ] Fritz John multipliers U: [ 0.00 , 0.287E-13 ], [ 0.00 , 0.156E-13 ] [ 0.00 , 0.196E-12 ], [ 0.00 , 0.172E-12 ] [ 0.00 , 0.176E-13 ], [ 0.00 , 1.00 ] [ 0.00 , 0.110E-12 ], [ 0.00 , 0.135E-13 ] [ 0.00 , 1.00 ], [ 0.00 , 0.147E-12 ] [ 0.00 , 0.115E-12 ], [ 0.00 , 0.901E-13 ] [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] [ 0.00 , 0.835E-14 ], [ 0.00 , 0.600E-14 ] [ 0.00 , 0.404 ], [ 0.00 , 0.117E-13 ] [ 0.00 , 0.579E-14 ], [ 0.00 , 0.327 ] Fritz John multipliers V: [ -1.00 , 1.00 ], [ -1.00 , 1.00 ] [ -1.00 , 1.00 ], [ -1.00 , 1.00 ] [ -1.00 , 1.00 ], [ -1.00 , 1.00 ] [ -1.00 , 1.00 ] INEQ_CERT_FEASIBLE: F F F F F T F F T F F F T T F F T F F T NIN_POSS_BINDING: 14 LAST UNFINISHED BOX: Box coordinates: [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.500E+04, 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] PHI: [ 0.417E+11, 0.192E+13 ] Box does not contain an approximate root. 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 ] [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] [ 0.00 , 1.00 ], [ 0.00 , 1.00 ] [ 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 ], [ -1.00 , 1.00 ] [ -1.00 , 1.00 ], [ -1.00 , 1.00 ] [ -1.00 , 1.00 ], [ -1.00 , 1.00 ] [ -1.00 , 1.00 ] INEQ_CERT_FEASIBLE: F F F F F F F F F F F F F F F F F F F F NIN_POSS_BINDING: 20 Total volume of the boxes that have not yet been processed: 1.00000000000000355E+080