|
出现These LMI constraints were found infeasible
但运行出结果了,结果两个K相同
Solver for LMI feasibility proble***(x) < R(x)
This solver minimizes t subject to L(x) < R(x) + t*I
The best value of t should be negative for feasibility Iteration : Best value of t so far
* switching to QR
1 4.286890
2 1.800517
3 1.510866
4 1.255956
5 1.255956
6 1.255956
7 1.187347
8 1.187347
9 1.111091
10 1.111091
11 1.093537
12 1.093537
13 1.083196
14 1.083196
15 1.083196
16 1.082546
17 1.082546
18 1.082363
19 1.082363
20 1.082363
21 1.082344
22 1.082344
23 1.082344 Result: could not establish feasibility nor infeasibility
f-radius saturation: 3.677% of R = 1.00e+009
Termination due to SLOW PROGRESS:
t was decreased by less than 10.000% during
the last 10 iterations.
These LMI constraints were found infeasible
tmin = 1.0823
xfeas = 1.0e+007 * 0.0000
0.0000
0.0000
2.6020
0.0047
2.5974
-0.0000
0.0000
0.0000
0.0000
-0.0000
-0.0000
Solver for LMI feasibility proble***(x) < R(x)
This solver minimizes t subject to L(x) < R(x) + t*I
The best value of t should be negative for feasibility Iteration : Best value of t so far
1
2 2.463023
3 1.909151
4 1.493367
*** new lower bound: -2.511580
5 1.493367
*** new lower bound: -1.854244
6 1.493367
*** new lower bound: -0.897262
7 1.370090
*** new lower bound: 0.794775 Result: best value of t: 1.370090
f-radius saturation: 85.760% of R = 1.00e+001 These LMI constraints were found infeasible
tmin = 1.3701
xfeas = 0.3071
0.0511
0.0110
5.9708
0.2542
5.9783
-0.1508
-0.1385
-0.1293
-0.1508
-0.1385
-0.1293
P = 0.3071 0.0511
0.0511 0.0110
S = 5.9708 0.2542
0.2542 5.9783
K1 = -0.1508 -0.1385
-0.1385 -0.1293
K2 = -0.1508 -0.1385
-0.1385 -0.1293
|
|