1# DAKOTA INPUT FILE - dakota_grid.in
2
3# Each DAKOTA test file is capable of running multiple tests. The
4# manual process for doing this is to add or uncomment specific lines
5# needed for a test and comment out other lines which are not needed
6# for that specific test.  Within the automatic test script, a special
7# syntax is used to automatically determine which lines are to be used
8# for a specific test. A #n (0 - 9) is used to associate lines in the
9# test file with a specific test.  The #0 is used to designate lines
10# which are to be run as part of the baseline test but not part of the
11# other tests. To add multiple tests to a file add the #n to the
12# trailing comment of a line, the dakota_test script will parse
13# through the file uncommenting the lines marked for a specific test,
14# and commenting out unneeded lines marked with the #0. Specific lines
15# can be included in multiple tests by adding multiple #n designaters
16# seperated by a comma.
17
18strategy,
19	single_method #graphics
20
21method,
22	max_iterations 100
23        output debug
24	max_function_evaluations 1000		#0,#1,#2,#3,#4,#5,#7,#8,#9
25#	max_function_evaluations 10000			#6
26#	max_cpu_time = 1.0
27#	convergence_tolerance = 1.e-5
28	solution_accuracy = 1.e-6
29	asynch_pattern_search				#0,#5
30	  initial_delta = .2				#0,#5
31	  variable_tolerance = 1.e-4			#0,#5
32	  synchronization blocking			#0,#5
33#
34#	seed = 1234					#1,#2,#3,#4,#6,#7,#8,#9
35#
36#	coliny_direct					#1,#6
37#	  global_balance_parameter = 0.001		#1,#6
38#	  min_boxsize_limit = 1.e-6			#1,#6
39#
40#	coliny_pattern_search				#2,#7
41#	  initial_delta = .2				#2,#7
42#	  variable_tolerance = 1.e-4			#2,#7
43#	  pattern_basis coordinate			#2,#7
44#	  synchronization nonblocking			#2,#7
45#	  exploratory_moves basic_pattern		#2,#7
46#
47#	coliny_solis_wets,				#3,#8
48#	  misc_options  = 'max_failure=6'		#3,#8
49#	  initial_delta = 0.2 variable_tolerance = 0.001	#3,#8
50#
51#	coliny_cobyla					#4,#9
52# 	  initial_delta = .2				#4,#9
53# 	  variable_tolerance = 1.e-4			#4,#9
54
55variables,
56	continuous_design = 3
57	  initial_point    0.5    1.5   2.0
58	  upper_bounds    10.0   10.0  10.0
59	  lower_bounds   -10.0  -10.0 -10.0
60	  descriptors      'x1'   'x2'   'x3'
61
62interface,
63        grid asynchronous evaluation_concurrency = 10
64          analysis_drivers = 'text_book1'
65
66responses,
67	objective_functions = 1
68#	nonlinear_inequality_constraints = 2	#5,#6,#7,#8,#9
69	no_gradients
70	no_hessians
71