Output from FIND_GLOBAL_MIN on 05/04/2012 at 22:00:37. Version for the system is: March 13, 2009 Codelist file name is: ex4_1_5G.CDL Box data file name is: ex4_1_5.DT1 Initial box: [ -5.00 , 0.100E+05 ], [ -0.100E+05, 5.00 ] BOUND_CONSTRAINT: 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.100E-02, 0.100E-02 ], [ -0.100E-02, 0.100E-02 ] PHI: [ -0.100E-05, 0.400E-05 ] Box contains the following approximate root: -0.304E-14, -0.152E-14 OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT: [ 0.162E-28, 0.162E-28 ] 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 ] INEQ_CERT_FEASIBLE: F F NIN_POSS_BINDING: 2 ------------------------------------------------- ALGORITHM COMPLETED WITH LESS THAN THE MAXIMUM NUMBER, 500000 OF BOXES. Number of bisections: 22 No. dense interval residual evaluations -- gradient code list: 579 Number of orig. system inverse midpoint preconditioner rows: 136 Number of orig. system C-LP preconditioner rows: 40 Number of solutions for a component in the expanded system: 15248 Total number of forward_substitutions: 1528 Number of Gauss--Seidel steps on the dense system: 176 Number point dense residual evaluations, gradient codelist: 48 Number of gradient evaluations from a gradient code list: 165 Total number of dense slope matrix evaluations: 262 Total number second-order interval evaluations of the original function: 96 Total number dense interval constraint evaluations: 1236 Total number dense interval constraint gradient component evaluations: 1228 Total number dense point constraint gradient component evaluations: 200 Total number dense interval reduced gradient evaluations: 274 Total number of calls to FRITZ_JOHN_RESIDUALS: 48 Number of times a box was rejected because of a large lower bound on the objective function: 1 Number of times a box was rejected because the gradient or reduced gradient did not contain zero: 13 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.46 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: 111 Number of times a pivoting preconditioner made a coordinate interval smaller or rejected a coordinate: 27 Number of times a pivoting preconditioner was successful after the first sweep: 17 Number of times a midpoint matrix was factored: 52 Total number of times the reduced interval Newton method was tried: 37 Number of times an inverse midpoint preconditioner led to improvement or rejection: 72 Number of times a C LP preconditioner led to improvement or rejection: 1 N_C_LP_INFEASIBLE = 17 N_NEW_BEST_ESTIMATE_WITH_LP filter = 1 N_LPF_INF_OR_UNB = 17 Number of possible splits as detected by the pivoting preconditioner: 69 Total time spent in the LP filter (creating and solving the LP): 0.128 Total time spent in subsit (constraint propagation): 0.280E-01 Total time spent in reduced_interval_Newton (iteration to reduce the box): 0.800E-02 Total time spent searching for "D" in the LP filter: 0.440E-01 Total time spent actually solving the linear relaxations: 0.520E-01 FUNCTION_EVALUATION_TIME (in forward_substitution): 0.120E-01 Number Fritz-John matrix evaluations: 83 Number of times SUBSIT decreased one or more coordinate widths: 16 Number of times SUBSIT rejected a box: 8 Total number of boxes processed in loop: 46 N_FINDOPT_SUCCESS = 2 BEST_ESTIMATE: 0.998E-28 Overall CPU time: 0.220 CPU time in PEEL_BOUNDARY: 0.00 CPU time in REDUCED_INTERVAL_NEWTON: 0.800E-02 =================================================== =================================================== Number of boxes in the list with proven feasible points: 1 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.100E-02, 0.100E-02 ], [ -0.100E-02, 0.100E-02 ] Rigorously verified bounds on the optimum, provided an optimum exists: [ -0.100E-05, 0.998E-28 ]