Home
last modified time | relevance | path

Searched refs:iteratedModel (Results 1 – 25 of 101) sorted by relevance

12345

/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/
H A DDataFitSurrBasedLocalMinimizer.cpp41 if (iteratedModel.surrogate_type() == "hierarchical") { in DataFitSurrBasedLocalMinimizer()
47 Model& truth_model = iteratedModel.truth_model(); in DataFitSurrBasedLocalMinimizer()
48 Model& approx_model = iteratedModel.surrogate_model(); in DataFitSurrBasedLocalMinimizer()
201 iteratedModel.continuous_lower_bounds(globalLowerBnds); in post_run()
202 iteratedModel.continuous_upper_bounds(globalUpperBnds); in post_run()
259 iteratedModel.truth_model().interface_id(), in build()
288 embed_correction = iteratedModel.build_approximation( in build_global()
316 iteratedModel.build_approximation(); in build_centered()
410 Model& truth_model = iteratedModel.truth_model(); in verify()
507 Model& truth_model = iteratedModel.truth_model(); in find_center_truth()
[all …]
H A DParamStudy.cpp337 = iteratedModel.response_labels(); in archive_allocate_sets()
478 if (iteratedModel.asynch_flag()) in vector_loop()
653 iteratedModel.current_variables().copy()); in load_distribute_points()
1093 = iteratedModel.continuous_variable_labels(); in archive_allocate_cps()
1095 = iteratedModel.discrete_int_variable_labels(); in archive_allocate_cps()
1101 = iteratedModel.response_labels(); in archive_allocate_cps()
1165 = iteratedModel.continuous_variable_labels(); in archive_cps_vars()
1167 = iteratedModel.discrete_int_variable_labels(); in archive_cps_vars()
1173 = iteratedModel.response_labels(); in archive_cps_vars()
1240 = iteratedModel.continuous_variable_labels(); in archive_cps_resp()
[all …]
H A DNOWPACOptimizer.cpp28 nowpacEvaluator(iteratedModel) in NOWPACOptimizer()
40 nowpacEvaluator(iteratedModel) in NOWPACOptimizer()
177 iteratedModel.continuous_upper_bounds()); in core_run()
253 if (iteratedModel.num_nonlinear_eq_constraints()) { in allocate_constraints()
258 if (iteratedModel.num_linear_eq_constraints()) { in allocate_constraints()
300 = iteratedModel.linear_ineq_constraint_lower_bounds(); in allocate_constraints()
302 = iteratedModel.linear_ineq_constraint_upper_bounds(); in allocate_constraints()
334 = iteratedModel.current_response().function_values(); in evaluate()
355 = iteratedModel.linear_ineq_constraint_coeffs(); in evaluate()
384 = iteratedModel.current_response().function_values(); in evaluate()
[all …]
H A DDOTOptimizer.cpp104 Iterator sub_iterator = iteratedModel.subordinate_iterator(); in initialize()
111 ModelList& sub_models = iteratedModel.subordinate_models(); in initialize()
147 const String& grad_type = iteratedModel.gradient_type(); in initialize()
148 const String& method_src = iteratedModel.method_source(); in initialize()
149 const String& interval_type = iteratedModel.interval_type(); in initialize()
196 num_lin_eq = iteratedModel.num_linear_eq_constraints(); in allocate_constraints()
317 = iteratedModel.linear_ineq_constraint_coeffs(); in core_run()
319 = iteratedModel.linear_eq_constraint_coeffs(); in core_run()
349 if (iteratedModel.gradient_type() == "numerical") in core_run()
396 iteratedModel.continuous_variables(designVars); in core_run()
[all …]
H A DDakotaPStudyDACE.cpp38 if (iteratedModel.gradient_type() == "numerical" && in PStudyDACE()
39 iteratedModel.method_source() == "vendor") { in PStudyDACE()
52 if (iteratedModel.gradient_type() == "numerical" && in PStudyDACE()
53 iteratedModel.method_source() == "vendor") { in PStudyDACE()
110 iteratedModel.continuous_variable_labels(), empty_view, empty_view, in print_results()
111 empty_view, iteratedModel.response_labels()); in print_results()
115 iteratedModel.continuous_variable_labels(), in print_results()
116 iteratedModel.discrete_int_variable_labels(), in print_results()
117 iteratedModel.discrete_string_variable_labels(), in print_results()
118 iteratedModel.discrete_real_variable_labels(), in print_results()
[all …]
H A DSNLLOptimizer.cpp251 iteratedModel.interval_type(), in SNLLOptimizer()
252 iteratedModel.fd_gradient_step_size(), in SNLLOptimizer()
286 iteratedModel.interval_type(), in SNLLOptimizer()
287 iteratedModel.fd_gradient_step_size(), in SNLLOptimizer()
839 iteratedModel.continuous_variables(), in initialize_run()
841 iteratedModel.continuous_lower_bounds(), in initialize_run()
842 iteratedModel.continuous_upper_bounds(), in initialize_run()
843 iteratedModel.linear_ineq_constraint_coeffs(), in initialize_run()
846 iteratedModel.linear_eq_constraint_coeffs(), in initialize_run()
847 iteratedModel.linear_eq_constraint_targets(), in initialize_run()
[all …]
H A DHierarchSurrBasedLocalMinimizer.cpp37 if (iteratedModel.surrogate_type() != "hierarchical") { in HierarchSurrBasedLocalMinimizer()
44 ModelList& models = iteratedModel.subordinate_models(false); in HierarchSurrBasedLocalMinimizer()
406 iteratedModel.active_variables(tr_data.vars_center()); in build_center_truth()
412 iteratedModel.build_approximation(); in build_center_truth()
456 iteratedModel.recursive_apply(v_star, corr_resp); in minimize()
476 Model& truth_model = iteratedModel.truth_model(); in verify()
479 iteratedModel.component_parallel_mode(TRUTH_MODEL_MODE); in verify()
587 iteratedModel.active_variables(v_center); in find_center_approx()
608 iteratedModel.active_variables(v_star); in find_star_approx()
610 tr_data.response_star(iteratedModel.current_response(), in find_star_approx()
[all …]
H A DSNLLLeastSq.cpp122 iteratedModel.interval_type(), in SNLLLeastSq()
123 iteratedModel.fd_gradient_step_size(), in SNLLLeastSq()
211 iteratedModel.interval_type(), in SNLLLeastSq()
212 iteratedModel.fd_gradient_step_size(), in SNLLLeastSq()
305 = snllLSqInstance->iteratedModel.current_response(); in nlf2_evaluator_gn()
494 iteratedModel.continuous_variables(), in initialize_run()
496 iteratedModel.continuous_lower_bounds(), in initialize_run()
497 iteratedModel.continuous_upper_bounds(), in initialize_run()
498 iteratedModel.linear_ineq_constraint_coeffs(), in initialize_run()
501 iteratedModel.linear_eq_constraint_coeffs(), in initialize_run()
[all …]
H A DCONMINOptimizer.cpp61 Iterator sub_iterator = iteratedModel.subordinate_iterator(); in initialize()
68 ModelList& sub_models = iteratedModel.subordinate_models(); in initialize()
123 const String& grad_type = iteratedModel.gradient_type(); in initialize()
124 const String& method_src = iteratedModel.method_source(); in initialize()
177 num_lin_eq = iteratedModel.num_linear_eq_constraints(); in allocate_constraints()
339 num_lin_eq = iteratedModel.num_linear_eq_constraints(); in core_run()
341 = iteratedModel.linear_ineq_constraint_coeffs(); in core_run()
343 = iteratedModel.linear_eq_constraint_coeffs(); in core_run()
344 const String& grad_type = iteratedModel.gradient_type(); in core_run()
411 iteratedModel.continuous_variables(local_cdv); in core_run()
[all …]
H A DDakotaAnalyzer.cpp40 iteratedModel = model; in Analyzer()
83 numContinuousVars = iteratedModel.cv(); in resize()
84 numDiscreteIntVars = iteratedModel.div(); in resize()
85 numDiscreteStringVars = iteratedModel.dsv(); in resize()
86 numDiscreteRealVars = iteratedModel.drv(); in resize()
147 if (!iteratedModel.is_null()) { in initialize_run()
183 if (!iteratedModel.is_null()) in post_run()
197 if (iteratedModel.mapping_initialized()) { in finalize_run()
632 iteratedModel.current_variables(), in pre_output()
633 iteratedModel.current_response(), in pre_output()
[all …]
H A DAPPSEvalMgr.cpp32 dakOpt(opt), iteratedModel(model), modelAsynchFlag(1), blockingSynch(0), in APPSEvalMgr()
66 set_variables<>(apps_xtrial, iteratedModel, iteratedModel.current_variables()); in submit()
81 iteratedModel.evaluate_nowait(); in submit()
82 tagList[iteratedModel.evaluation_id()] = apps_tag; in submit()
88 iteratedModel.evaluate(); in submit()
89 functionList[apps_tag] = iteratedModel.current_response().function_values(); in submit()
113 iteratedModel.synchronize() : iteratedModel.synchronize_nowait(); in recv()
H A DNLSSOLLeastSq.cpp56 iteratedModel.gradient_type(), in NLSSOLLeastSq()
57 iteratedModel.fd_gradient_step_size()); in NLSSOLLeastSq()
69 iteratedModel.gradient_type(), in NLSSOLLeastSq()
70 iteratedModel.fd_gradient_step_size()); in NLSSOLLeastSq()
110 nlssolInstance->iteratedModel.continuous_variables(local_des_vars); in least_sq_eval()
112 nlssolInstance->iteratedModel.evaluate(nlssolInstance->activeSet); in least_sq_eval()
122 = nlssolInstance->iteratedModel.current_response(); in least_sq_eval()
172 iteratedModel.linear_ineq_constraint_coeffs(), in core_run()
173 iteratedModel.linear_eq_constraint_coeffs()); in core_run()
185 copy_data(iteratedModel.continuous_variables(), local_des_vars); in core_run()
[all …]
H A DCOLINApplication.cpp61 iteratedModel = model; in set_problem()
267 iteratedModel.evaluate_nowait(); in spawn_evaluation_impl()
269 return(iteratedModel.evaluation_id()); in spawn_evaluation_impl()
290 iteratedModel.evaluate(); in perform_evaluation_impl()
309 iteratedModel.synchronize() : iteratedModel.synchronize_nowait(); in evaluation_available()
354 iteratedModel.continuous_variables(cdv); in colin_request_to_dakota_request()
374 size_t j, dsi_cntr, num_div = iteratedModel.div(), in colin_request_to_dakota_request()
375 num_drv = iteratedModel.drv(), num_dsv = iteratedModel.dsv(); in colin_request_to_dakota_request()
383 iteratedModel.discrete_int_variable(ddv[j], j); in colin_request_to_dakota_request()
390 iteratedModel.discrete_real_variable(dakota_value, j); in colin_request_to_dakota_request()
[all …]
H A DNLPQLPOptimizer.cpp92 Iterator sub_iterator = iteratedModel.subordinate_iterator(); in initialize()
97 ModelList& sub_models = iteratedModel.subordinate_models(); in initialize()
149 iteratedModel, in allocate_constraints()
157 + iteratedModel.num_linear_eq_constraints(); in allocate_constraints()
233 = iteratedModel.continuous_lower_bounds(); in core_run()
235 = iteratedModel.continuous_upper_bounds(); in core_run()
240 = iteratedModel.linear_ineq_constraint_coeffs(); in core_run()
242 = iteratedModel.linear_eq_constraint_coeffs(); in core_run()
244 = iteratedModel.linear_eq_constraint_targets(); in core_run()
281 iteratedModel.continuous_variables(local_cdv); in core_run()
[all …]
H A DROLOptimizer.cpp128 iteratedModel.continuous_variables(cont_vars); in core_run()
129 iteratedModel.evaluate(); in core_run()
131 iteratedModel.current_response().function_values(); in core_run()
177 get_initial_values(iteratedModel, *rolX); in set_problem()
189 get_bounds(iteratedModel, *l_rcp, *u_rcp); in set_problem()
236 if (iteratedModel.hessian_type() == "none") in set_problem()
243 obj.reset(new DakotaROLObjective(iteratedModel)); in set_problem()
256 if (iteratedModel.hessian_type() == "none") in set_problem()
282 if (iteratedModel.hessian_type() == "none") in set_problem()
345 orig_auto_graphics_flag = iteratedModel.auto_graphics(); in initialize_run()
[all …]
H A DConcurrentMetaIterator.hpp130 { return iteratedModel; } in algorithm_space_model()
144 iterSched.construct_sub_iterator(probDescDB, selectedIterator, iteratedModel, in estimate_partition_bounds()
166 if (iteratedModel.primary_response_fn_weights().empty()) { in initialize_model()
169 iteratedModel.primary_response_fn_weights(initial_wts); // trigger recast in initialize_model()
173 paramSetLen = iteratedModel.cv(); in initialize_model()
181 iteratedModel.continuous_variables(param_set); in initialize_iterator()
183 iteratedModel.continuous_variables(initialPt); // reset in initialize_iterator()
184 iteratedModel.primary_response_fn_weights(param_set); in initialize_iterator()
221 iteratedModel.interface_id(), in update_local_results()
H A DDakotaLeastSq.cpp46 weightFlag(!iteratedModel.primary_response_fn_weights().empty()), in LeastSq()
135 iteratedModel.assign_rep(std::make_shared<WeightingModel>(iteratedModel)); in weight_model()
235 iteratedModel.interface_id(), best_vars, activeSet); in print_results()
265 = iteratedModel.continuous_variable_labels(); in print_results()
285 iteratedModel.update_from_subordinate_model(myModelLayers-1); in initialize_run()
434 Response found_resp(iteratedModel.current_response().copy()); in post_run()
458 Response found_resp(iteratedModel.current_response().copy()); in post_run()
495 iteratedModel.evaluate(activeSet); in post_run()
519 iteratedModel.evaluate(activeSet); in post_run()
522 iteratedModel.current_response().function_gradients(), in post_run()
[all …]
H A DNCSUOptimizer.cpp116 Iterator sub_iterator = iteratedModel.subordinate_iterator(); in initialize()
121 ModelList& sub_models = iteratedModel.subordinate_models(); in initialize()
180 = ncsudirectInstance->iteratedModel.primary_response_fn_sense(); in objective_eval()
220 if (ncsudirectInstance->iteratedModel.asynch_flag()) in objective_eval()
221 ncsudirectInstance->iteratedModel.evaluate_nowait(); in objective_eval()
223 ncsudirectInstance->iteratedModel.evaluate(); in objective_eval()
226 iteratedModel.current_response().function_value(0); in objective_eval()
242 ncsudirectInstance->iteratedModel.asynch_flag()) { in objective_eval()
246 = ncsudirectInstance->iteratedModel.synchronize(); in objective_eval()
298 copy_data(iteratedModel.continuous_variables(), local_des_vars); in core_run()
[all …]
H A DEffGlobalMinimizer.cpp54 bestVariablesArray.push_back(iteratedModel.current_variables().copy()); in EffGlobalMinimizer()
85 if (iteratedModel.gradient_type() != "none") dataOrder |= 2; in EffGlobalMinimizer()
86 if (iteratedModel.hessian_type() != "none") dataOrder |= 4; in EffGlobalMinimizer()
116 (dace_iterator, iteratedModel, in EffGlobalMinimizer()
341 iteratedModel.evaluate_nowait(set); in minimize_surrogates_on_model()
552 iteratedModel.continuous_variables(c_vars); in minimize_surrogates_on_model()
555 iteratedModel.evaluate(set); in minimize_surrogates_on_model()
556 … IntResponsePair resp_star_truth(iteratedModel.evaluation_id(), iteratedModel.current_response()); in minimize_surrogates_on_model()
799 iteratedModel.primary_response_fn_sense(), in get_augmented_lagrangian()
961 iteratedModel.primary_response_fn_sense(), in debug_plots()
[all …]
H A DSurrBasedGlobalMinimizer.cpp38 if (iteratedModel.model_type() != "surrogate") { in SurrBasedGlobalMinimizer()
50 iteratedModel.truth_model().current_variables().copy()); in SurrBasedGlobalMinimizer()
78 = probDescDB.get_iterator(approx_method_name, iteratedModel); in SurrBasedGlobalMinimizer()
91 Model& truth_model = iteratedModel.truth_model(); in initialize_graphics()
119 Model& truth_model = iteratedModel.truth_model(); in core_run()
120 Model& approx_model = iteratedModel.surrogate_model(); in core_run()
121 Iterator& dace_iterator = iteratedModel.subordinate_iterator(); in core_run()
138 iteratedModel.build_approximation(); in core_run()
203 iteratedModel.component_parallel_mode(TRUTH_MODEL_MODE); in core_run()
H A DDakotaOptimizer.cpp86 if ( ( !have_lsq && iteratedModel.hessian_type() == "none" ) || in Optimizer()
87 ( have_lsq && iteratedModel.gradient_type() == "none" ) ) { in Optimizer()
96 bestVariablesArray.push_back(iteratedModel.current_variables().copy()); in Optimizer()
376 const Response& orig_resp = iteratedModel.current_response(); in reduce_model()
381 iteratedModel.assign_rep(std::make_shared<RecastModel> in reduce_model()
382 (iteratedModel, var_map_indices, recast_vars_comps_total, in reduce_model()
400 iteratedModel.primary_fn_type(OBJECTIVE_FNS); in reduce_model()
412 iteratedModel.primary_response_fn_sense(max_sense); in reduce_model()
519 iteratedModel, in configure_constraint_maps()
547 iteratedModel.update_from_subordinate_model(myModelLayers-1); in initialize_run()
[all …]
H A DCOLINOptimizer.cpp281 = iteratedModel.evaluation_capacity(); in core_run()
291 colinProblem.second->set_problem(iteratedModel); in core_run()
323 const RealVector& cv_init = iteratedModel.continuous_variables(); in core_run()
327 iteratedModel.discrete_string_variables(); in core_run()
623 if (iteratedModel.asynch_flag()) in set_solver_parameters()
960 iteratedModel.subordinate_model() : iteratedModel; in post_run()
1058 iteratedModel.primary_response_fn_sense(), in post_run()
1059 iteratedModel.primary_response_fn_weights()); in post_run()
1178 = iteratedModel.nonlinear_ineq_constraint_lower_bounds(); in constraint_violation()
1180 = iteratedModel.nonlinear_ineq_constraint_upper_bounds(); in constraint_violation()
[all …]
H A DNonDGPImpSampling.cpp49 if (iteratedModel.gradient_type() != "none") data_order |= 2; in NonDGPImpSampling()
50 if (iteratedModel.hessian_type() != "none") data_order |= 4; in NonDGPImpSampling()
118 iteratedModel.init_communicators(pl_iter, maxEvalConcurrency); in derived_init_communicators()
143 iteratedModel.free_communicators(pl_iter, maxEvalConcurrency); in derived_free_communicators()
168 int num_problem_vars=iteratedModel.acv(); in core_run()
169 RealVector c_upper = iteratedModel.continuous_upper_bounds(), in core_run()
170 c_lower = iteratedModel.continuous_lower_bounds(); in core_run()
342 iteratedModel.continuous_variables(new_X); in core_run()
343 iteratedModel.evaluate(); in core_run()
344 IntResponsePair resp_truth(iteratedModel.evaluation_id(), in core_run()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/demo_tpl/dakota_src/
H A DDemoOptimizer.cpp143 const BoolDeque& max_sense = iteratedModel.primary_response_fn_sense(); in core_run()
144 RealVector best_fns(iteratedModel.response_size()); in core_run()
175 set_variables<>(best_x, iteratedModel, bestVariablesArray.front()); in core_run()
261 get_variables(iteratedModel, init_point); in initialize_variables_and_constraints()
289 set_variables<>(x, iteratedModel, iteratedModel.current_variables()); in compute_obj()
292 iteratedModel.evaluate(); in compute_obj()
297 double f = dataTransferHandler->get_response_value_from_dakota(iteratedModel.current_response()); in compute_obj()
326 set_variables<>(x, iteratedModel, iteratedModel.current_variables()); in compute_nln_eq()
329 iteratedModel.evaluate(); in compute_nln_eq()
359 set_variables<>(x, iteratedModel, iteratedModel.current_variables()); in compute_nln_ineq()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/inactive/
H A DrSQPOptimizer.H281 { return iteratedModel.linear_ineq_constraint_lower_bounds(); } in lin_ineq_lb()
284 { return iteratedModel.linear_ineq_constraint_upper_bounds(); } in lin_ineq_ub()
287 { return iteratedModel.nonlinear_ineq_constraint_lower_bounds(); } in nonlin_ineq_lb()
290 { return iteratedModel.nonlinear_ineq_constraint_upper_bounds(); } in nonlin_ineq_ub()
293 { return iteratedModel.linear_eq_constraint_targets(); } in lin_eq_targ()
296 { return iteratedModel.nonlinear_eq_constraint_targets(); } in nonlin_eq_targ()
299 { return iteratedModel.linear_eq_constraint_coeffs(); } in lin_eq_jac()
302 { return iteratedModel.linear_ineq_constraint_coeffs(); } in lin_ineq_jac()

12345