1#@ s*: Label=FastTest 2# DAKOTA INPUT FILE - dakota_nl2test.in 3 4# Run DAKOTA/nl2sol on several test problems (Osborne 1, Watson 6, Chebyquad 8, 5# Osborne 2) from the NL2SOL paper ("An Adaptive Nonlinear Least-Squares Algorithm", 6# by John E. Dennis, Jr., David M. Gay, and Roy E. Welsch, ACM Trans. Math. 7# Software 7 (1981), 348-368). 8# Original references for the test problems appear in the above paper. 9 10method, 11 nl2sol 12 output silent 13 convergence_tolerance = -1. 14 speculative #s0,#s1,#s2,#s3,#s4,#s5,#s6 15 16variables, 17 continuous_design = 5 #s0,#s1 18# continuous_design = 6 #s2,#s3 19# continuous_design = 8 #s4,#s5,#s8 20# continuous_design = 11 #s6,#s7 21 initial_point .5 1.5 -1 .01 .02 #s0,#s1 22# lower_bounds .3 0.7 -2 .001 .001 #s1 23# upper_bounds .6 1.8 0 .2 .23 #s1 24 descriptors 'x1' 'x2' 'x3' 'x4' 'x5' #s0,#s1 25# initial_point 0 0 -3 0 -1 0 #s2,#s3 26# lower_bounds -.1 -1 0 .2 .23 0 #s3 27# upper_bounds .6 1.7 3 2 1 2 #s3 28# descriptors 'x1' 'x2' 'x3' 'x4' 'x5' 'x6' #s2,#s3 29# initial_point .111111 .222222 .333333 .444444 #s4,#s5,#s8 30# .555556 .666667 .777778 .888889 #s4,#s5,#s8 31# lower_bounds .1 .2 .3 .4 #s5 32# .5 .6 .7 .8 #s5 33# upper_bounds .2 .3 .4 .5 #s5 34# .6 .7 .8 .9 #s5 35# descriptors 'x1' 'x2' 'x3' 'x4' #s4,#s5,#s8 36# 'x5' 'x6' 'x7' 'x8' #s4,#s5,#s8 37# initial_point 1.3 .65 .65 .7 .6 3 #s6,#s7 38# 5 7 2 4.5 5.5 #s6,#s7 39# descriptors 'x1' 'x2' 'x3' 'x4' 'x5' 'x6' #s6,#s7 40# 'x7' 'x8' 'x9' 'x10' 'x11' #s6,#s7 41 42interface, 43 system 44 analysis_driver = 'nl2func' 45 46responses, 47 calibration_terms = 33 #s0,#s1 48# calibration_terms = 31 #s2,#s3 49# calibration_terms = 8 #s4,#s5,#s8 50# calibration_terms = 65 #s6,#s7 51# least_squares_weights = 1. 10000. 1. 10000. 1. 2500. 1. 2500. #s8 52 analytic_gradients 53 no_hessians 54