-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMINMAXBD.SIF
131 lines (84 loc) · 2.31 KB
/
MINMAXBD.SIF
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
***************************
* SET UP THE INITIAL DATA *
***************************
NAME MINMAXBD
* Problem :
* *********
* The minmax version of the Brown and Dennis problem in 4 variables.
* This function involves 20 groups. Each group has 2 nonlinear elements.
* Source: Problem 16 in
* J.J. More', B.S. Garbow and K.E. Hillstrom,
* "Testing Unconstrained Optimization Software",
* ACM Transactions on Mathematical Software, vol. 7(1), pp. 17-41, 1981.
* See also Buckley#30
* SDIF input: Ph. Toint, Dec 1989, modified by Nick Gould, Oct 1992.
* classification LOR2-AN-5-20
* Number of groups
IE M 20
* Useful parameters
IE 1 1
VARIABLES
X1
X2
X3
X4
F
GROUPS
XN OBJ F 1.0
DO I 1 M
XL G(I) F -1.0
ND
BOUNDS
FR MINMAXBD 'DEFAULT'
START POINT
MINMAXBD X1 25.0
MINMAXBD X2 5.0
MINMAXBD X3 -5.0
MINMAXBD X4 -1.0
MINMAXBD F 8.25559D+2
ELEMENT TYPE
EV BRD V1 V2
EP BRD CV2 CIND
ELEMENT USES
XT 'DEFAULT' BRD
DO I 1 M
RI RI I
RM I/5 RI 0.2
R( EI5 EXP I/5
ZV A(I) V1 X1
ZV A(I) V2 X2
ZP A(I) CV2 I/5
ZP A(I) CIND EI5
R( SI5 SIN I/5
R( CI5 COS I/5
ZV B(I) V1 X3
ZV B(I) V2 X4
ZP B(I) CV2 SI5
ZP B(I) CIND CI5
ND
GROUP USES
DO I 1 M
XE G(I) A(I) B(I)
ND
ENDATA
***********************
* SET UP THE FUNCTION *
* AND RANGE ROUTINES *
***********************
ELEMENTS MINMAXBD
TEMPORARIES
R A
M EXP
M SIN
M COS
INDIVIDUALS
* Square of a linear combination
T BRD
A A V1 + CV2 * V2 - CIND
F A * A
G V1 2.0 * A
G V2 2.0 * A * CV2
H V1 V1 2.0
H V1 V2 2.0 * CV2
H V2 V2 2.0 * CV2 * CV2
ENDATA