-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathARGLINA.SIF
106 lines (73 loc) · 2.17 KB
/
ARGLINA.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
***************************
* SET UP THE INITIAL DATA *
***************************
NAME ARGLINA
* Problem :
* *********
* Variable dimension full rank linear problem
* Source: Problem 32 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#80 (with different N and M)
* SIF input: Ph. Toint, Dec 1989.
* classification SUR2-AN-V-0
* This problem is a linear least squares
* N is the number of free variables
* M is the number of equations ( M.ge.N)
*IE N 10 $-PARAMETER
*IE N 50 $-PARAMETER
*IE N 100 $-PARAMETER
IE N 200 $-PARAMETER
*IE M 20 $-PARAMETER .ge. N
*IE M 100 $-PARAMETER .ge. N
*IE M 200 $-PARAMETER .ge. N
IE M 400 $-PARAMETER .ge. N
* Define useful parameters
IE 1 1
RE -2.0 -2.0
IA N+1 N 1
RI RM M
R/ -2/M -2.0 RM
RA 1-2/M -2/M 1.0
VARIABLES
DO I 1 N
X X(I)
ND
GROUPS
DO I 1 N
IA I-1 I -1
IA I+1 I 1
DO J 1 I-1
ZN G(I) X(J) -2/M
OD J
ZN G(I) X(I) 1-2/M
DO J I+1 N
ZN G(I) X(J) -2/M
ND
DO I N+1 M
DO J 1 N
ZN G(I) X(J) -2/M
ND
CONSTANTS
X ARGLINA 'DEFAULT' 1.0
BOUNDS
FR ARGLINA 'DEFAULT'
START POINT
XV ARGLINA 'DEFAULT' 1.0
GROUP TYPE
GV L2 GVAR
GROUP USES
XT 'DEFAULT' L2
ENDATA
*********************
* SET UP THE GROUPS *
* ROUTINE *
*********************
GROUPS ARGLINA
INDIVIDUALS
T L2
F GVAR * GVAR
G GVAR + GVAR
H 2.0
ENDATA