-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPOLAK3.SIF
117 lines (80 loc) · 2.07 KB
/
POLAK3.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
***************************
* SET UP THE INITIAL DATA *
***************************
NAME POLAK3
* Problem :
* *********
* A nonlinear minmax problem in eleven variables.
* Note: the original statement of the problem contains an inconsistant
* index i. This has been replaced by 1, assuming a very common typo.
* But the optimal solution of the resulting problem differs from that
* quoted in the source.
* Source:
* E. Polak, D.H. Mayne and J.E. Higgins,
* "Superlinearly convergent algorithm for min-max problems"
* JOTA 69, pp. 407-439, 1991.
* SIF input: Ph. Toint, Nov 1993.
* classification LOR2-AN-12-10
IE 1 1
IE 10 10
IE 11 11
VARIABLES
DO I 1 11
X X(I)
OD I
U
GROUPS
XN OBJ U 1.0
DO I 1 10
XL F(I) U -1.0
OD I
BOUNDS
* All variables are free
FR POLAK3 'DEFAULT'
START POINT
V POLAK3 'DEFAULT' 1.0
ELEMENT TYPE
EV EL XX
EP EL A B
ELEMENT USES
DO I 1 10
IA I-1 I -1
RI RI-1 I-1
DO J 1 11
IA J-1 J -1
RI RJ-1 J
XT E(I,J) EL
ZV E(I,J) XX X(J)
ZP E(I,J) A RI-1
ZP E(I,J) B RJ-1
OD J
OD I
GROUP USES
DO I 1 10
DO J 1 11
RI RJ J
RD 1/J RJ 1.0
ZE F(I) E(I,J) 1/J
OD J
OD I
OBJECT BOUND
* Solution
*LO SOLTN 5.93300252
ENDATA
***********************
* SET UP THE FUNCTION *
* AND RANGE ROUTINES *
***********************
ELEMENTS POLAK3
TEMPORARIES
R V
R EV
M EXP
INDIVIDUALS
T EL
A V XX - SIN( A + B + B )
A EV EXP( V * V )
F EV
G XX 2.0 * V * EV
H XX XX ( 4.0 * V * V + 2.0 ) * EV
ENDATA