1#@ Cross-platform diffs in tests 10-16 carried until we can ensure that surrogates are working correctly with discrete variables 2#@ *: Label=CarryDiff 3#@ s1: TimeoutAbsolute=2100 4#@ s5: TimeoutAbsolute=1800 5# s18: test correct traits coverage 6 7# DAKOTA INPUT FILE - dakota_nomad.in 8 9environment, 10# tabular_data 11 12method, 13 mesh_adaptive_search 14# model_pointer = 'SURROGATE' #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 15# use_surrogate optimize #s10,#s11,#s12 16# use_surrogate inform_search #s14,#s15,#s16 17 seed = 1234 18# initial_delta = 2.0 #s1,#s9 19# variable_tolerance = 0.01 #s2,#s10 20# max_function_evaluations = 1000 #s5,#s14 21# max_iterations = 100 #s5,#s14 22# function_precision = 0.00000001 #s5,#s14 23# variable_neighborhood_search = 0.1 #s5,#s14 24# neighbor_order = 2 #s6,#s15 25# neighbor_order = 4 #s7,#s16 26# display_format = 'bbe obj' 27# display_all_evaluations #s5,#s14 28# history_file = 'mads_history.log' #s5,#s14 29 30#model, #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 31# id_model = 'SURROGATE' #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 32# surrogate global #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 33# polynomial quadratic #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 34# dace_method_pointer = 'SAMPLING' #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 35 36variables, 37 continuous_design = 3 #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7 38 initial_point -1.0 1.5 2.0 #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7 39 upper_bounds 10.0 10.0 10.0 #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7 40 lower_bounds -10.0 -10.0 -10.0 #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7 41 descriptors 'x1' 'x2' 'x3' #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7 42# continuous_design = 3 #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16,#s18 43# initial_point -1.0 1.5 2.0 #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16,#s18 44# upper_bounds 10.0 10.0 10.0 #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16,#s18 45# lower_bounds -10.0 -10.0 -10.0 #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16,#s18 46# descriptors 'x1' 'x2' 'x3' #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16,#s18 47# continuous_design = 2 #s8,#s17 48# initial_point 0.5 0.5 #s8,#s17 49# lower_bounds 0. 0. #s8,#s17 50# upper_bounds 1. 1. #s8,#s17 51# descriptors = 'x' 'y' #s8,#s17 52# discrete_design_range = 2 #s1,#s4,#s5,#s6,#s7 53# initial_point 2 2 #s1,#s4,#s5,#s6,#s7 54# lower_bounds 1 1 #s1,#s4,#s5,#s6,#s7 55# upper_bounds 4 9 #s1,#s4,#s5,#s6,#s7 56# descriptors 'y1' 'y2' #s1,#s4,#s5,#s6,#s7 57# discrete_design_range = 2 #s10,#s13,#s14,#s15,#s16,#s18 58# initial_point 2 2 #s10,#s13,#s14,#s15,#s16,#s18 59# lower_bounds 1 1 #s10,#s13,#s14,#s15,#s16,#s18 60# upper_bounds 4 9 #s10,#s13,#s14,#s15,#s16,#s18 61# descriptors 'y1' 'y2' #s10,#s13,#s14,#s15,#s16,#s18 62# discrete_design_set #s2,#s3,#s4,#s5,#s6,#s7 63# real = 2 #s2,#s4,#s5,#s6,#s7 64# elements_per_variable = 4 5 #s2,#s4,#s5,#s6,#s7 65# elements = 1.2 2.3 3.4 4.5 1.2 3.3 4.4 5.5 7.7 #s2,#s4,#s5,#s6,#s7 66# # reproduce historical default values: 67# initial_point 3.4 4.4 #s2,#s4,#s5,#s6,#s7 68# descriptors 'y3' 'y4' #s2,#s4,#s5,#s6,#s7 69# discrete_design_set #s11,#s12,#s13,#s14,#s15,#s16,#s18 70# real = 2 #s11,#s13,#s14,#s15,#s16,#s18 71# elements_per_variable = 4 5 #s11,#s13,#s14,#s15,#s16,#s18 72# elements = 1.2 2.3 3.4 4.5 1.2 3.3 4.4 5.5 7.7 #s11,#s13,#s14,#s15,#s16,#s18 73# # reproduce historical default values: 74# initial_point 3.4 4.4 #s11,#s13,#s14,#s15,#s16,#s18 75# descriptors 'y3' 'y4' #s11,#s13,#s14,#s15,#s16,#s18 76# categorical 'yes' 'yes' #s6,#s7,#s15,#s16,#s18 77# adjacency_matrix 1 1 0 0 #s6,#s7,#s15,#s16,#s18 78# 1 1 1 0 #s6,#s7,#s15,#s16,#s18 79# 0 1 1 1 #s6,#s7,#s15,#s16,#s18 80# 0 0 1 1 #s6,#s7,#s15,#s16,#s18 81# 1 0 1 0 1 #s6,#s7,#s15,#s16,#s18 82# 0 1 0 1 0 #s6,#s7,#s15,#s16,#s18 83# 1 0 1 0 1 #s6,#s7,#s15,#s16,#s18 84# 0 1 0 1 0 #s6,#s7,#s15,#s16,#s18 85# 1 0 1 0 1 #s6,#s7,#s15,#s16,#s18 86# integer = 2 #s3,#s4,#s5,#s7 87# elements_per_variable = 2 2 #s3,#s4,#s5,#s7 88# elements = 4 7 8 9 #s3,#s4,#s5,#s7 89# descriptors 'z1' 'z2' #s3,#s4,#s5,#s7 90# categorical 'yes' 'yes' #s7 91# integer = 2 #s12,#s13,#s14,#s16,#s18 92# elements_per_variable = 2 2 #s12,#s13,#s14,#s16,#s18 93# elements = 4 7 8 9 #s12,#s13,#s14,#s16,#s18 94# descriptors 'z1' 'z2' #s12,#s13,#s14,#s16,#s18 95# categorical 'yes' 'yes' #s16,#s18 96# discrete_design_set string = 1 #s8,#s17 97# elements = 'aniso1' 'aniso2' 'iso1' 'iso2' 'iso3' #s8,#s17 98# descriptors = 'ancomp' #s8,#s17 99# adjacency_matrix 1 1 0 0 0 #s8,#s17 100# 1 1 0 0 0 #s8,#s17 101# 0 0 1 1 1 #s8,#s17 102# 0 0 1 1 1 #s8,#s17 103# 0 0 1 1 1 #s8,#s17 104 105#method, #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16, 106# id_method = 'SAMPLING' #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 107# model_pointer = 'TRUTH' #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 108# sampling #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 109# seed = 12345 #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 110# samples = 55 #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 111 112#model, #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 113# id_model = 'TRUTH' #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 114# single #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 115# interface_pointer = 'TRUE_FN' #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 116 117interface, 118# id_interface = 'TRUE_FN' #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 119 direct #s0,#s2,#s3,#s4,#s5,#s6,#s7,#s18 120# direct #s9,#s11,#s12,#s13,#s14,#s15,#s16 121# fork asynch evaluation_concurrency 4 #s1,#s8,#s10,#s17 122 analysis_driver = 'text_book' #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7,#s18 123# analysis_driver = 'text_book' #s9,#s10,#s11,#s12,#s13,#s14,#s15,#s16 124# analysis_driver = 'gerstner_string' #s8,#s17 125# parameters_file = 'params.in' #s8,#s17 126# results_file = 'results.out' #s8,#s17 127# file_tag #s8,#s17 128 129responses, 130 objective_functions = 1 131# nonlinear_inequality_constraints = 2 #s1,#s3,#s4,#s6,#s7 132# nonlinear_inequality_constraints = 2 #s10,#s12,#s13,#s15,#s16 133# nonlinear_inequality_constraints = 1 #s18 134# nonlinear_equality_constraints = 1 #s18 135 no_gradients 136 no_hessians 137