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
|
//Find x in R^6 such that:
// A simple example with constraints
Aeq= [1,-1,1,0,3,1;
-1,0,-3,-4,5,6;
2,5,3,0,1,0];
beq=[1; 2; 3];
A= [0,1,0,1,2,-1;
-1,0,2,1,1,0];
b = [-1; 2.5];
lb=[-1000; -10000; 0; -1000; -1000; -1000];
ub=[10000; 100; 1.5; 100; 100; 1000];
param = list("MaxIter", 1);
//and minimize 0.5*x'*H*x + f'*x with
f=[1; 2; 3; 4; 5; 6]; H=eye(6,6);
//Output
//
//Maximum Number of Iterations Exceeded. Output may not be optimal.
// lambda =
//
// lower: [0x0 constant]
// upper: [0x0 constant]
// eqlin: [0x0 constant]
// ineqlin: [0x0 constant]
// output =
//
// Iterations: 1
// ConstrViolation: 1.3770464
// exitflag =
//
// 1
// fopt =
//
// - 9.9784864
// xopt =
//
// 0.9103357
// - 0.1104630
// 0.0476471
// - 2.0070896
// 0.2116560
// - 1.1624291
[xopt,fopt,exitflag,output,lambda]=qpipoptmat(H,f,A,b,Aeq,beq,lb,ub,[],param)
|
