-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathJANNSON4.SIF
147 lines (101 loc) · 2.33 KB
/
JANNSON4.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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
***************************
* SET UP THE INITIAL DATA *
***************************
NAME JANNSON4
* Problem :
* *********
* Source: example 4 in
* C. Jannson
* "Convex-concave extensions"
* BIT 40(2) 2000:291-313
* SIF input: Nick Gould, September 2000
* classification OQR2-AN-V-2
*IE N 3 $-PARAMETER
IE N 10000 $-PARAMETER
* Other parameters
IE 0 0
IE 1 1
IE 2 2
VARIABLES
DO I 1 N
X X(I)
ND
GROUPS
XN G X2 -1.0
XN G0 X1 1.0
DO I 1 N
XN G(I) X(I) 1.0
ND
XL Q
XL P
CONSTANTS
X JANNSON4 G0 1.0
DO I 1 N
X JANNSON4 G(I) 1.0
ND
X JANNSON4 Q 1.0
X JANNSON4 P 0.1
BOUNDS
LO JANNSON4 'DEFAULT' -1.0
UP JANNSON4 'DEFAULT' 1.0
ELEMENT TYPE
EV SQR X
EV PROD X Y
ELEMENT USES
DO I 1 N
XT E(I) SQR
ZV E(I) X X(I)
ND
XT P PROD
ZV P X X1
ZV P Y X2
GROUP TYPE
GV L2 GVAR
GV L22 GVAR
GROUP USES
XT G L22
XE G E(1)
DO I 0 N
XT G(I) L2
ND
DO I 1 N
XE Q E(I)
ND
XE P P
OBJECT BOUND
* Least square problems are bounded below by zero
LO JANNSON4 0.0
* Solution
*XL SOLUTION 9.80197D+03 $ n=10000
ENDATA
***********************
* SET UP THE FUNCTION *
* AND RANGE ROUTINES *
***********************
ELEMENTS JANNSON4
INDIVIDUALS
T SQR
F X * X
G X X + X
H X X 2.0
T PROD
F X * Y
G X Y
G Y X
H X Y 1.0
ENDATA
*********************
* SET UP THE GROUPS *
* ROUTINE *
*********************
GROUPS JANNSON4
INDIVIDUALS
T L2
F GVAR * GVAR
G GVAR + GVAR
H 2.0
T L22
F 0.5 * GVAR * GVAR
G GVAR
H 1.0
ENDATA