1#@ *: DakotaConfig=HAVE_NPSOL 2# DAKOTA Input File: dakota_pcbdo_cantilever.in 3# PCE-based OUU using the cantilever test function. 4 5environment, 6 top_method_pointer = 'OPTIM' 7 8########################### 9# begin opt specification # 10########################### 11method, 12 id_method = 'OPTIM' 13## (NPSOL requires a software license; if not available, try #s5 14## conmin_mfd or optpp_q_newton instead) #s5 15 npsol_sqp 16 convergence_tolerance = 1.e-6 17 model_pointer = 'OPTIM_M' 18 output verbose 19 20model, 21 id_model = 'OPTIM_M' 22 nested 23 sub_method_pointer = 'UQ' 24# use projection of analytic PCE moments: constrain beta 25 primary_response_mapping = 1. 0. 0. 0. 0. 0. 0. 0. 26 secondary_response_mapping = 0. 0. 0. 0. 1. 0. 0. 0. 27 0. 0. 0. 0. 0. 0. 0. 1. 28 variables_pointer = 'OPTIM_V' 29 responses_pointer = 'OPTIM_R' 30 31variables, 32 id_variables = 'OPTIM_V' 33 continuous_design = 2 34 initial_point 2.5 2.5 35 upper_bounds 10.0 10.0 36 lower_bounds 1.0 1.0 37 descriptors 'w' 't' 38 39responses, 40# minimize mean Weight 41# s.t. beta_S >= 3 42# beta_D >= 3 43# 44# NOTE: This specifies the TOTAL RESPONSE for the optimization, 45# which is a combination of nested & interface responses. 46 id_responses = 'OPTIM_R' 47 objective_functions = 1 48 nonlinear_inequality_constraints = 2 49 lower_bounds = 3. 3. 50 upper_bounds = 1.e+50 1.e+50 51 analytic_gradients #s0,#s1,#s4,#s5,#s8,#s9,#s12 52# numerical_gradients #s2,#s3,#s6,#s7,#s10,#s11,#s13 53# method_source dakota #s2,#s3,#s6,#s7,#s10,#s11,#s13 54# interval_type central #s2,#s3,#s6,#s7,#s10,#s11,#s13 55# fd_gradient_step_size = 1.e-6 #s2,#s3,#s6,#s7,#s10,#s11,#s13 56 no_hessians 57 58########################## 59# begin UQ specification # 60########################## 61method, 62 id_method = 'UQ' 63 polynomial_chaos 64 expansion_order = 2 #s0,#s2,#s4,#s6 65# expansion_order = 4 #s1,#s3,#s5,#s7 66 collocation_ratio = 2 seed = 12347 #s0,#s1,#s2,#s3 67# collocation_ratio = 0.5 seed = 12347 #s4,#s5,#s6,#s7 68# collocation_points = 70 seed = 12347 #s12 69# collocation_points = 30 seed = 12347 #s13 70 fixed_seed #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7,#s12,#s13 71# orthogonal_least_interpolation #s12,#s13 72# sparse_grid_level = 2 non_nested #s8,#s10 73# sparse_grid_level = 4 non_nested #s9,#s11 74 response_levels = 0.0 0.0 75 num_response_levels = 0 1 1 76 compute reliabilities 77 distribution complementary 78 model_pointer = 'UQ_M' 79 80model, 81 id_model = 'UQ_M' 82 single 83 interface_pointer = 'UQ_I' 84 variables_pointer = 'UQ_V' 85 responses_pointer = 'UQ_R' 86 87variables, 88 id_variables = 'UQ_V' 89# active all #s1,#s3,#s5,#s7,#s9,#s11,#s12 90 continuous_design = 2 91 normal_uncertain = 4 92 means = 40000. 29.E+6 500. 1000. 93 std_deviations = 2000. 1.45E+6 100. 100. 94 descriptors = 'R' 'E' 'X' 'Y' 95 96interface, 97 id_interface = 'UQ_I' 98 analysis_drivers = 'mod_cantilever' 99 direct 100# deactivate evaluation_cache restart_file 101 102responses, 103 id_responses = 'UQ_R' 104 response_functions = 3 105 analytic_gradients #s0,#s4,#s8 106# no_gradients #s1,#s2,#s3,#s5,#s6,#s7,#s9,#s10,#s11,#s12,#s13 107 no_hessians 108