-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCB2.SIF
123 lines (83 loc) · 2.01 KB
/
CB2.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
***************************
* SET UP THE INITIAL DATA *
***************************
NAME CB2
* Problem :
* *********
* A nonlinear minmax problem.
* Source:
* R. Wommersley and R. Fletcher,
* "An algorithm for composite nonsmooth optimization problems"
* JOTA, vol.48, pp.493-523, 1986
* SIF input: Ph. Toint, April 1992.
* classification LOR2-AN-3-3
VARIABLES
X1
X2
U
GROUPS
XN OBJ U 1.0
XG C1 U 1.0
XG C2 U 1.0
XG C3 U 1.0
BOUNDS
FR CB2 'DEFAULT'
START POINT
XV CB2 X1 2.0
XV CB2 X2 2.0
XV CB2 U 1.0
ELEMENT TYPE
EV SQ X
EV FR X
EV SSQ X
EV EXY X Y
ELEMENT USES
T X1SQ SQ
ZV X1SQ X X1
T X2FR FR
ZV X2FR X X2
T SSQ1 SSQ
ZV SSQ1 X X1
T SSQ2 SSQ
ZV SSQ2 X X2
T EEX EXY
ZV EEX X X1
ZV EEX Y X2
GROUP USES
E C1 X1SQ - 1.0 X2FR - 1.0
E C2 SSQ1 - 1.0 SSQ2 - 1.0
E C3 EEX - 2.0
OBJECT BOUND
* Solution
*LO SOLTN 0.0
ENDATA
***********************
* SET UP THE FUNCTION *
* AND RANGE ROUTINES *
***********************
ELEMENTS CB2
TEMPORARIES
R EE
M EXP
INDIVIDUALS
T SQ
F X * X
G X X + X
H X X 2.0
T FR
F X**4
G X 4.0 * X**3
H X X 12.0 * X**2
T SSQ
F ( 2.0 - X )**2
G X - 2.0 * ( 2.0 - X )
H X X 2.0
T EXY
A EE EXP( Y - X )
F EE
G X - EE
G Y EE
H X X EE
H X Y - EE
H Y Y EE
ENDATA