#@ s*: Label=FastTest
# DAKOTA INPUT FILE - dakota_nl2test.in

# Run DAKOTA/nl2sol on several test problems (Osborne 1, Watson 6, Chebyquad 8,
# Osborne 2) from the NL2SOL paper ("An Adaptive Nonlinear Least-Squares Algorithm",
# by John E. Dennis, Jr., David M. Gay, and Roy E. Welsch, ACM Trans. Math.
# Software 7 (1981), 348-368).
# Original references for the test problems appear in the above paper.

method,
	nl2sol
	  output silent
	  convergence_tolerance = -1.
	  speculative		#s0,#s1,#s2,#s3,#s4,#s5,#s6

variables,
	continuous_design = 5	#s0,#s1
#	continuous_design = 6	#s2,#s3
#	continuous_design = 8	#s4,#s5,#s8
#	continuous_design = 11	#s6,#s7
	initial_point	.5	1.5	-1	.01	.02		#s0,#s1
#	lower_bounds	.3	0.7	-2	.001	.001		#s1
#	upper_bounds	.6	1.8	0	.2	.23		#s1
	descriptors		'x1'	'x2'	'x3'	'x4'	'x5'		#s0,#s1
#	initial_point	0	0	-3	0	-1	0	#s2,#s3
#	lower_bounds	-.1	-1	0	.2	.23	0	#s3
#	upper_bounds	.6	1.7	3	2	1	2	#s3
#	descriptors		'x1'	'x2'	'x3'	'x4'	'x5'	'x6'	#s2,#s3
#	initial_point	.111111	.222222	.333333	.444444			#s4,#s5,#s8
#				.555556	.666667	.777778	.888889			#s4,#s5,#s8
#	lower_bounds	.1	.2	.3	.4			#s5
#				.5	.6	.7	.8			#s5
#	upper_bounds	.2	.3	.4	.5			#s5
#				.6	.7	.8	.9			#s5
#	descriptors		'x1'	'x2'	'x3'	'x4'			#s4,#s5,#s8
#				'x5'	'x6'	'x7'	'x8'			#s4,#s5,#s8
#	initial_point	1.3	.65	.65	.7	.6	3	#s6,#s7
#				5	7	2	4.5	5.5		#s6,#s7
#	descriptors		'x1'	'x2'	'x3'	'x4'	'x5'	'x6'	#s6,#s7
#				'x7'	'x8'	'x9'	'x10'	'x11'		#s6,#s7

interface,
	system
	  analysis_driver = 'nl2func'

responses,
	calibration_terms = 33		#s0,#s1
#	calibration_terms = 31		#s2,#s3
#	calibration_terms = 8		#s4,#s5,#s8
#	calibration_terms = 65		#s6,#s7
#	least_squares_weights = 1. 10000. 1. 10000. 1. 2500. 1. 2500. #s8
	analytic_gradients
	no_hessians