Yalmip example

Ulin TE

unread,

Oct 12, 2016, 9:44:29 AM10/12/16

to YALMIP

can someone help me mit Yamip preogramm this example.... i try so many times. but the result is different.

Ulin TE

unread,

Oct 12, 2016, 10:14:34 AM10/12/16

to YALMIP

pls....online waiting...thx

Mark L. Stone

unread,

Oct 12, 2016, 10:32:44 AM10/12/16

to YALMIP

Johan is very responsive to questions on this board - unbelievably so given all the other things I'm sure he has to do. I think you should exhibit patience beyond waiting half an hour for a reply.

Mark L. Stone

unread,

Oct 12, 2016, 10:34:58 AM10/12/16

to YALMIP

In the meantime, why don't you show what you already tried and what the results were?

Ulin TE

unread,

Oct 12, 2016, 10:38:30 AM10/12/16

to YALMIP

clc

clear

A=[0.1 0.4;0.8 0.5];

B=[0 ;1 ];

C=[0.2 0.1];

D=0;

x=sdpvar(2,1);

x0=sdpvar(2,1);

a=norm(x0)<=1;

K=sdpvar(1,2);

Umax=5;

b=norm(K*x)<=Umax;

Q = sdpvar(2,2);

c=x'*Q*x<=1;

constraint = [a,b,c];

obj = K;

optimize(constraint,obj)

Value_K=value(K)

Value_Q=value(Q)

Johan Löfberg

unread,

Oct 12, 2016, 2:08:46 PM10/12/16

to YALMIP

Indeed, believe it or not but responding here is not top #1 priority (top #1 is enduro race practice, yalmip forum comes somewhere after beer)

Johan Löfberg

unread,

Oct 12, 2016, 2:12:56 PM10/12/16

to YALMIP

This is not an optimization problem to find invariant sets and controllers etc. You've completely misunderstood/not read some paper. These problems are initially infinite dimensional in x (for all x such that...), and the first step is to eliminate x, and get an optimization problem in, e.g., K and Q.

Reply all

Reply to author

Forward