A=[0.8 -0.

25;1 0];
B1=[0;0.1];
B2=[0.1;0.09];
C1=[0 0.1];
D11=[0.05];
D12=[0.1];
n=size(A,1);
m=size(B2,2);
setlmis([])
Y=lmivar(1,[n,1]);
Z=lmivar(2,[m n]);
g=lmivar(1,[1 1]);
lmiterm([1 1 1 Y],1,A','S');
lmiterm([1 1 1 Z],B2,1,'S');
lmiterm([1 1 2 0],B1);
lmiterm([1 2 1 0],B1');
lmiterm([1 3 2 0],D11);
lmiterm([1 2 3 0],D11');
lmiterm([1 3 1 Y],C1,1,'S');
lmiterm([1 3 1 Z],D12,1,'S');
lmiterm([1 2 2 g],-1,1);
lmiterm([1 3 3 g],-1,1);
lmiterm([2 1 1 Y],-1,1);
Lmis=getlmis;
[t,sol]=feasp(Lmis);
Y=dec2mat(Lmis,sol,Y)
Z=dec2mat(Lmis,sol,Z)
g=dec2mat(Lmis,sol,g)

Solver for LMI feasibility problems L(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 0.184910
2 0.026939
3 -0.823627

Result: best value of t: -0.823627

f-radius saturation: 0.000% of R = 1.00e+09

Y =

59.7500 17.9218
17.9218 27.0633

Z =

1
 -731.0613 -487.5174

g =

157.4038

Published with MATLAB® R2022a