1#@ s*: Label=FastTest
2## DAKOTA INPUT FILE - dakota_nonlinear_cg
3## Test DAKOTA's built-in nonlinear conjugate gradient solver
4## TODO: compare to other CG solvers and use harder problem
5
6method,
7	nonlinear_cg
8	  max_iterations = 50
9	  convergence_tolerance = 1e-4
10	  misc_options
11	    # use Fletcher-Reeves update type
12	    'update_type=fletcher_reeves'
13	    # for each linesearch, start with a step of 5.0, then backtrack
14	    # until simple decrease
15	    'initial_step=5.0'
16	    'reset_step=true'
17	    'linesearch_type=ls_simple'
18	    # Reset to steepest descent every 5 iterations
19	    'restart_iter=5'
20
21variables,
22	continuous_design = 2
23	  initial_point    3.0    2.0
24	  descriptors      'x1'   'x2'
25
26interface,
27	direct
28	  analysis_driver =       'text_book'
29
30responses,
31	objective_functions = 1
32	analytic_gradients
33	no_hessians
34