-
Notifications
You must be signed in to change notification settings - Fork 58
/
C_wrapper.jl
214 lines (192 loc) · 6.11 KB
/
C_wrapper.jl
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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
module TestCWrapper
using Ipopt
using Test
function test_hs071()
# hs071
# min x1 * x4 * (x1 + x2 + x3) + x3
# st x1 * x2 * x3 * x4 >= 25
# x1^2 + x2^2 + x3^2 + x4^2 = 40
# 1 <= x1, x2, x3, x4 <= 5
# Start at (1,5,5,1)
# End at (1.000..., 4.743..., 3.821..., 1.379...)
function eval_f(x::Vector{Float64})
return x[1] * x[4] * (x[1] + x[2] + x[3]) + x[3]
end
function eval_g(x::Vector{Float64}, g::Vector{Float64})
# Bad: g = zeros(2) # Allocates new array
# OK: g[:] = zeros(2) # Modifies 'in place'
g[1] = x[1] * x[2] * x[3] * x[4]
return g[2] = x[1]^2 + x[2]^2 + x[3]^2 + x[4]^2
end
function eval_grad_f(x::Vector{Float64}, grad_f::Vector{Float64})
# Bad: grad_f = zeros(4) # Allocates new array
# OK: grad_f[:] = zeros(4) # Modifies 'in place'
grad_f[1] = x[1] * x[4] + x[4] * (x[1] + x[2] + x[3])
grad_f[2] = x[1] * x[4]
grad_f[3] = x[1] * x[4] + 1
return grad_f[4] = x[1] * (x[1] + x[2] + x[3])
end
function eval_jac_g(
x::Vector{Float64},
rows::Vector{Int32},
cols::Vector{Int32},
values::Union{Nothing,Vector{Float64}},
)
if values === nothing
# Constraint (row) 1
rows[1] = 1
cols[1] = 1
rows[2] = 1
cols[2] = 2
rows[3] = 1
cols[3] = 3
rows[4] = 1
cols[4] = 4
# Constraint (row) 2
rows[5] = 2
cols[5] = 1
rows[6] = 2
cols[6] = 2
rows[7] = 2
cols[7] = 3
rows[8] = 2
cols[8] = 4
else
# Constraint (row) 1
values[1] = x[2] * x[3] * x[4] # 1,1
values[2] = x[1] * x[3] * x[4] # 1,2
values[3] = x[1] * x[2] * x[4] # 1,3
values[4] = x[1] * x[2] * x[3] # 1,4
# Constraint (row) 2
values[5] = 2 * x[1] # 2,1
values[6] = 2 * x[2] # 2,2
values[7] = 2 * x[3] # 2,3
values[8] = 2 * x[4] # 2,4
end
return
end
function eval_h(
x::Vector{Float64},
rows::Vector{Int32},
cols::Vector{Int32},
obj_factor::Float64,
lambda::Vector{Float64},
values::Union{Nothing,Vector{Float64}},
)
if values === nothing
# Symmetric matrix, fill the lower left triangle only
idx = 1
for row in 1:4
for col in 1:row
rows[idx] = row
cols[idx] = col
idx += 1
end
end
else
# Again, only lower left triangle
# Objective
values[1] = obj_factor * (2 * x[4]) # 1,1
values[2] = obj_factor * (x[4]) # 2,1
values[3] = 0 # 2,2
values[4] = obj_factor * (x[4]) # 3,1
values[5] = 0 # 3,2
values[6] = 0 # 3,3
values[7] = obj_factor * (2 * x[1] + x[2] + x[3]) # 4,1
values[8] = obj_factor * (x[1]) # 4,2
values[9] = obj_factor * (x[1]) # 4,3
values[10] = 0 # 4,4
# First constraint
values[2] += lambda[1] * (x[3] * x[4]) # 2,1
values[4] += lambda[1] * (x[2] * x[4]) # 3,1
values[5] += lambda[1] * (x[1] * x[4]) # 3,2
values[7] += lambda[1] * (x[2] * x[3]) # 4,1
values[8] += lambda[1] * (x[1] * x[3]) # 4,2
values[9] += lambda[1] * (x[1] * x[2]) # 4,3
# Second constraint
values[1] += lambda[2] * 2 # 1,1
values[3] += lambda[2] * 2 # 2,2
values[6] += lambda[2] * 2 # 3,3
values[10] += lambda[2] * 2 # 4,4
end
return
end
n = 4
x_L = [1.0, 1.0, 1.0, 1.0]
x_U = [5.0, 5.0, 5.0, 5.0]
m = 2
g_L = [25.0, 40.0]
g_U = [2.0e19, 40.0]
prob = Ipopt.CreateIpoptProblem(
n,
x_L,
x_U,
m,
g_L,
g_U,
8,
10,
eval_f,
eval_g,
eval_grad_f,
eval_jac_g,
eval_h,
)
prob.x = [1.0, 5.0, 5.0, 1.0]
solvestat = Ipopt.IpoptSolve(prob)
@test solvestat == 0
@test prob.x[1] ≈ 1.0000000000000000 atol = 1e-5
@test prob.x[2] ≈ 4.7429996418092970 atol = 1e-5
@test prob.x[3] ≈ 3.8211499817883077 atol = 1e-5
@test prob.x[4] ≈ 1.3794082897556983 atol = 1e-5
@test prob.obj_val ≈ 17.014017145179164 atol = 1e-5
# This tests callbacks.
function intermediate(
alg_mod::Cint,
iter_count::Cint,
obj_value::Float64,
inf_pr::Float64,
inf_du::Float64,
mu::Float64,
d_norm::Float64,
regularization_size::Float64,
alpha_du::Float64,
alpha_pr::Float64,
ls_trials::Cint,
)
return iter_count < 1 # Interrupts after one iteration.
end
Ipopt.SetIntermediateCallback(prob, intermediate)
solvestat = Ipopt.IpoptSolve(prob)
@test solvestat == 5
# Test setting some options
# String option
println("\nString option")
Ipopt.AddIpoptStrOption(prob, "hessian_approximation", "exact")
@test_throws(
ErrorException,
Ipopt.AddIpoptStrOption(prob, "hessian_approximation", "badoption"),
)
println("\nInt option")
# Int option
@test Ipopt.AddIpoptIntOption(prob, "file_print_level", 3) === nothing
@test_throws(
ErrorException,
Ipopt.AddIpoptIntOption(prob, "file_print_level", -1),
)
# Double option
println("\nFloat option")
Ipopt.AddIpoptNumOption(prob, "derivative_test_tol", 0.5)
@test_throws(
ErrorException,
Ipopt.AddIpoptNumOption(prob, "derivative_test_tol", -1.0),
)
# Test opening an output file
Ipopt.OpenIpoptOutputFile(prob, "blah.txt", 5)
finalize(prob) # Needed before the `rm` on Windows.
# unlink the output file
rm("blah.txt")
return
end
end # TestCWrapper
runtests(TestCWrapper)