Talk:Beginning with CVX - Revision history

Kwokwah at 09:00, 10 February 2009

Kwokwah — Tue, 10 Feb 2009 09:00:55 GMT

←Older revision		Revision as of 09:00, 10 February 2009
Line 14:		Line 14:
	clear all;		clear all;

-	cvx_setup	+	%cvx_setup
	n=2; m=1;		n=2; m=1;

Mtxu at 07:13, 10 February 2009

Mtxu — Tue, 10 Feb 2009 07:13:18 GMT

←Older revision		Revision as of 07:13, 10 February 2009
Line 6:		Line 6:
	Thanks a lot for all the ideas, they all are greats.		Thanks a lot for all the ideas, they all are greats.

-		+	The code still not working. I think I’m making thinks wrong (sure). I have a dude.
-	I think I’m making thinks wrong. I have a dude.	+

	The new code could be:		The new code could be:
		+
	<pre>		<pre>
	%0)Initialization		%0)Initialization
Line 29:		Line 29:
	lamda_W=min(eig(full(W)))		lamda_W=min(eig(full(W)))
	lamda_H=max(eig(H))		lamda_H=max(eig(H))
-
-	DOK.W=W;
-	DOK.R=R
-	DOK.lW=lamda_W;
-	DOK.lH=lamda_H;
-
	Epsilon1=1e-6;		Epsilon1=1e-6;
	Epsilon2=1e-6;		Epsilon2=1e-6;
-		+	%3)3
-	~~if(lamda_W>=Epsilon1)~~	+	[v_W,D] = eig( full ( W ) )
-	~~if(lamda_H<=-Epsilon2) para=1~~	+	[v_H,D] = eig( full ( H ) )
-	~~else para = 0~~	+
-	~~end~~	+
-	~~else para =0~~	+
-	~~end~~	+
-		+
-	~~while para==0~~	+
-	%3)3	+
-	[v_W,D] = eig( full ( W ) )	+
-	[v_H,D] = eig( full ( H ) )	+

-	%4a)4a
-	if ( Epsilon1 - lamda_W )>(lamda_H+Epsilon2)
-	Caso=1 %For know where am I
-
-	DOK.W=W;
-	DOK.R=R
-	DOK.lW=lamda_W;
-	DOK.lH=lamda_H;
-
	cvx_begin		cvx_begin
	variables p1 p2 W(4,4) R(2,4)		variables p1 p2 W(4,4) R(2,4)
		+	if ( Epsilon1 - lamda_W )>(lamda_H+Epsilon2) CK=v_W'Wv_W - Epsilon1eye(2n) ;
		+	else CK=-Epsilon2eye(2n) - v_H'Hv_H ;
		+	end
		+
		+	minimize (p1+p2)

-	~~minimize (p1+p2)~~	+	subject to
-		+
-	subject to	+

-	W(1,1)<=p1	+	W(1,1)<=p1
-	W(2,2)<=p1	+	W(2,2)<=p1
-	W(1,1)>=Epsilon1	+	W(1,1)>=Epsilon1
-	W(2,2)>=Epsilon1	+	W(2,2)>=Epsilon1
-	W(3,3)==W(1,1)	+	W(3,3)==W(1,1)
-	W(4,4)==W(2,2)	+	W(4,4)==W(2,2)

-	R(1,1)>=-p2	+	R(1,1)>=-p2
-	R(1,1)<=p2	+	R(1,1)<=p2
-	R(2,3)==R(1,1)	+	R(2,3)==R(1,1)
-	R(1,2)>=-p2	+	R(1,2)>=-p2
-	R(1,2)<=p2	+	R(1,2)<=p2
-	R(2,4)==R(1,2)	+	R(2,4)==R(1,2)

-	~~H=WA_a'+A_aW-B_aR-R'B_a'~~	+	CK == semidefinite(2*n);
-		+
-	~~v_W'Wv_W - Epsilon1eye(2n) == semidefinite(2*n);~~	+
-		+
-	~~cvx_end~~	+
-		+
-	~~else %4b)4b~~	+
-		+
-	~~Caso = 2~~	+
-	~~DOK.W=W;~~	+
-	~~DOK.R=R~~	+
-	~~DOK.lW=lamda_W;~~	+
-	~~DOK.lH=lamda_H;~~	+
-		+
-	~~cvx_begin~~	+
-		+
-	~~variables p1 p2 W(4,4) R(2,4)~~	+
-		+
-	~~minimize (p1+p2)~~	+
-		+
-	~~subject to~~	+
-		+
-	~~W(1,1)>=Epsilon1~~	+
-	~~W(2,2)>=Epsilon1~~	+
-	~~W(1,1)<=p1~~	+
-	~~W(2,2)<=p1~~	+
-	~~W(3,3)==W(1,1)~~	+
-	~~W(4,4)==W(2,2)~~	+
-		+
-	~~R(1,1)>=-p2~~	+
-	~~R(1,1)<=p2~~	+
-	~~R(2,3)==R(1,1)~~	+
-	~~R(1,2)>=-p2~~	+
-	~~R(1,2)<=p2~~	+
-	~~R(2,4)==R(1,2)~~	+
-		+
-	~~H=WA_a'+A_aW-B_aR-R'B_a'~~	+
-		+
-	~~Epsilon2eye(2n) + v_H'Hv_H~~ == -semidefinite(2*n);	+

	cvx_end		cvx_end
-	end

	lamda_W = min ( eig ( full ( W ) ) )		lamda_W = min ( eig ( full ( W ) ) )
	lamda_H = max ( eig ( full ( H ) ) )		lamda_H = max ( eig ( full ( H ) ) )
-
-	end

	R		R
	W=full(W)		W=full(W)
-	K=R/W</pre>	+	K=R/W
		+
		+	</pre>

Mtxu at 14:51, 9 February 2009

Mtxu — Mon, 09 Feb 2009 14:51:19 GMT

←Older revision		Revision as of 14:51, 9 February 2009
Line 6:		Line 6:
	Thanks a lot for all the ideas, they all are greats.		Thanks a lot for all the ideas, they all are greats.

-	Kwokwah That was my first idea (could be great if it works), but isn't possible to do one "if" inside the "cvx_begin - cvx_end" Because it isn't a convex problem.
-
-	Michael Grant explains to me (I'm going to copy it's explanation):
-
-	"Do make sure you understand that if-then statements are typically not
-	possible in CVX. In general such constraints will not be convex, and
-	CVX does not handle nonconvex problems. CVX requires not only that
-	problems be convex, but they must be constructed according to the very
-	specific rules outlined in the user guide. If those rules are not
-	satisfied then CVX rejects the model."
-
-	I think I'm wrong with this code, I would like to put the "if" with the another constraits, inside the cxv_begin, but the CVX don't let me doing it. Some ideas?

	I think I’m making thinks wrong. I have a dude.		I think I’m making thinks wrong. I have a dude.

	The new code could be:		The new code could be:
-	<pre>
-	1º I calculate some variables,
-
-	2º with one if (with depends to variables point 1º) I select one linear constrint depending
-	value of variables in 1º and I make all the: minimize…subjet to with apropiate constraints, convex
-	and the one linear,
-
-	if
-	cvx_begin
-	...
-	cvx_end
-	else
-	cvx_begin
-	...
-	cvx_end
-	end
-
-	3ºIf there is not solution STOP, if there is, go to 1º,
-	</pre>
-	I’ve tried making this, I make: 1º, 2, 3º; return to 1º,2º, 3º And here the CVX says that there is not solution, that’s the reason for trying to keep inside the if – else.
-
-	My dude is, why CVX says there is not solution, it could be because the iteration (making steps 1-2-3) before is the correct. For explain (I know my English isn’t the best, and it’s hard for me to explain and for you to read)
-	<pre>
-	One iteracion (steps 1, 2, 3)
-
-	All well
-
-	Save data = DATA1
-
-	One iteracion (steps 1, 2, 3)
-
-	All well
-
-	Save data = DATA2
-
-	One iteracion (steps 1, 2, 3)
-
-	Wrong, no solution
-
-	Correct data = DATA2
-	</pre>
-	What do you think? Any idea?
-
-	Thanks a lot for all, again.
-
-	-----------------------------------------------------------------------
-
-	I don't know how to initialice Epsilon1 and Epsilon2. I'm trying different values.
-
-	Thanks a lot again.
-
-	Here is the new code:
-
	<pre>		<pre>
	%0)Initialization		%0)Initialization
	clear all;		clear all;
		+
		+	cvx_setup
	n=2; m=1;		n=2; m=1;

	A_a=3eye(2n,2*n)		A_a=3eye(2n,2*n)
-	B_a=4eye(2n,2*m)	+	B_a=4eye(2n,2*m)

	%1)1		%1)1
Line 93:		Line 30:
	lamda_H=max(eig(H))		lamda_H=max(eig(H))

-	Epsilon1=11;	+	DOK.W=W;
-	Epsilon2=~~0.1~~;	+	DOK.R=R
		+	DOK.lW=lamda_W;
		+	DOK.lH=lamda_H;
		+
		+	Epsilon1=1e-6;
		+	Epsilon2=1e-6;

	if(lamda_W>=Epsilon1)		if(lamda_W>=Epsilon1)
-	if(lamda_H<=-Epsilon2), para=1	+	if(lamda_H<=-Epsilon2) para=1
-	else para = 0	+	else para = 0
-	end	+	end
	else para =0		else para =0
	end		end

-	%while para==0	+	while para==0
-	%3)3	+	%3)3
-	[v_W,D] = eig(full(W))	+	[v_W,D] = eig( full ( W ) )
-	[v_H,D] = eig(full(H))	+	[v_H,D] = eig( full ( H ) )
		+
		+	%4a)4a
		+	if ( Epsilon1 - lamda_W )>(lamda_H+Epsilon2)
		+	Caso=1 %For know where am I

-	~~%4a)4a~~	+	DOK.W=W;
-	~~cvx_begin~~	+	DOK.R=R
-	~~variables p1 p2 W(4,4) R(2,4);~~	+	DOK.lW=lamda_W;
-	~~minimize (p1+p2);~~	+	DOK.lH=lamda_H;
-	~~subject to~~	+
-	W~~(1,1)<~~=~~p1;~~	+
-	W~~(2,2)<=p1~~;	+
-	~~W(1,1)>~~=~~Epsilon1;~~	+
-	~~W(2,2)>~~=~~Epsilon1~~;	+
-	~~W(3,3)~~=~~=W(1,1);~~	+
-	~~W(4,4)==W(2,2)~~;	+

-	R(1,1)>=-p2;	+	cvx_begin
-	R(1,1)<=p2;	+	variables p1 p2 W(4,4) R(2,4)
-	R(2,3)==R(1,1);	+
-	R(1,2)>=-p2;	+	minimize (p1+p2)
-	R(1,2)<=p2;	+
-	R(2,4)==R(1,2);	+	subject to
		+
		+	W(1,1)<=p1
		+	W(2,2)<=p1
		+	W(1,1)>=Epsilon1
		+	W(2,2)>=Epsilon1
		+	W(3,3)==W(1,1)
		+	W(4,4)==W(2,2)
		+
		+	R(1,1)>=-p2
		+	R(1,1)<=p2
		+	R(2,3)==R(1,1)
		+	R(1,2)>=-p2
		+	R(1,2)<=p2
		+	R(2,4)==R(1,2)
		+
		+	H=WA_a'+A_aW-B_aR-R'B_a'
		+
		+	v_W'Wv_W - Epsilon1eye(2n) == semidefinite(2*n);

-	H=WA_a'+A_aW-B_aR-R'B_a';
-	if (Epsilon1 - lamda_W) > (lamda_H + Epsilon2)
-	v_W'Wv_W - Epsilon1eye(2n) == semidefinite(2*n);
-	else
-	Epsilon2eye(2n) + v_H'Hv_H == -semidefinite(2*n);
-	end
	cvx_end		cvx_end
		+
		+	else %4b)4b
		+
		+	Caso = 2
		+	DOK.W=W;
		+	DOK.R=R
		+	DOK.lW=lamda_W;
		+	DOK.lH=lamda_H;
		+
		+	cvx_begin
		+
		+	variables p1 p2 W(4,4) R(2,4)
		+
		+	minimize (p1+p2)
		+
		+	subject to
		+
		+	W(1,1)>=Epsilon1
		+	W(2,2)>=Epsilon1
		+	W(1,1)<=p1
		+	W(2,2)<=p1
		+	W(3,3)==W(1,1)
		+	W(4,4)==W(2,2)
		+
		+	R(1,1)>=-p2
		+	R(1,1)<=p2
		+	R(2,3)==R(1,1)
		+	R(1,2)>=-p2
		+	R(1,2)<=p2
		+	R(2,4)==R(1,2)
		+
		+	H=WA_a'+A_aW-B_aR-R'B_a'
		+
		+	Epsilon2eye(2n) + v_H'Hv_H == -semidefinite(2*n);
		+
		+	cvx_end
		+	end
		+
		+	lamda_W = min ( eig ( full ( W ) ) )
		+	lamda_H = max ( eig ( full ( H ) ) )
		+
		+	end

	R		R
	W=full(W)		W=full(W)
-	K=R/W	+	K=R/W</pre>
-	</pre>	+

Mtxu at 10:12, 6 February 2009

Mtxu — Fri, 06 Feb 2009 10:12:46 GMT

←Older revision		Revision as of 10:12, 6 February 2009
Line 6:		Line 6:
	Thanks a lot for all the ideas, they all are greats.		Thanks a lot for all the ideas, they all are greats.

-	~~I think I~~'~~m wrong with this code, I would like~~ to ~~put the <pre>~~if ~~- else - end </pre>with the another constraits,~~ inside the ~~cxv_begin, but the CVX don~~'t ~~let me doing it~~. ~~Some ideas?~~	+	Kwokwah That was my first idea (could be great if it works), but isn't possible to do one "if" inside the "cvx_begin - cvx_end" Because it isn't a convex problem.

-	I ~~come work thinking on you idea. I think you idea it’s right and I’m making thinks wrong.~~	+	Michael Grant explains to me (I'm going to copy it's explanation):

-	I have a dude.	+	"Do make sure you understand that if-then statements are typically not
		+	possible in CVX. In general such constraints will not be convex, and
		+	CVX does not handle nonconvex problems. CVX requires not only that
		+	problems be convex, but they must be constructed according to the very
		+	specific rules outlined in the user guide. If those rules are not
		+	satisfied then CVX rejects the model."
		+
		+	I think I'm wrong with this code, I would like to put the "if" with the another constraits, inside the cxv_begin, but the CVX don't let me doing it. Some ideas?
		+
		+	I think I’m making thinks wrong. I have a dude.

	The new code could be:		The new code could be:
Line 16:		Line 25:
	1º I calculate some variables,		1º I calculate some variables,

-	2º with one if (with depends to variables point 1º) I select one linear constrint depending value of variables in 1º and I make all the: minimize…subjet to with apropiate constraints, convex and the one linear,	+	2º with one if (with depends to variables point 1º) I select one linear constrint depending
		+	value of variables in 1º and I make all the: minimize…subjet to with apropiate constraints, convex
		+	and the one linear,

	if		if
Line 54:		Line 65:
	What do you think? Any idea?		What do you think? Any idea?

-	Thanks a lot for all.	+	Thanks a lot for all, again.

	-----------------------------------------------------------------------		-----------------------------------------------------------------------

Kwokwah at 09:39, 6 February 2009

Kwokwah — Fri, 06 Feb 2009 09:39:18 GMT

←Older revision		Revision as of 09:39, 6 February 2009
Line 64:		Line 64:
	Here is the new code:		Here is the new code:

-	<pre>%0)Initialization	+	<pre>
		+	%0)Initialization
	clear all;		clear all;
	n=2; m=1;		n=2; m=1;

	A_a=3eye(2n,2*n)		A_a=3eye(2n,2*n)
-	B_a=4eye(2n,2*m)	+	B_a=4eye(2n,2*m)

	%1)1		%1)1
Line 85:		Line 86:

	if(lamda_W>=Epsilon1)		if(lamda_W>=Epsilon1)
-	if(lamda_H<=-Epsilon2) para=1	+	if(lamda_H<=-Epsilon2), para=1
-	else para = 0	+	else para = 0
-	end	+	end
	else para =0		else para =0
	end		end

	%while para==0		%while para==0
-	%3)3	+	%3)3
-	[v_W,D] = eig( full ( W ) )	+	[v_W,D] = eig(full(W))
-	[v_H,D] = eig( full ( H ) )	+	[v_H,D] = eig(full(H))
-		+
-	~~% v_W_1 = v_W( : , 1 ) / norm ( v_W ( : , 1 ) ) ;~~	+
-	~~% v_W_2 = v_W( : , 2 ) / norm ( v_W ( : , 2 ) ) ;~~	+
-	~~% v_W_3 = v_W( : , 3 ) / norm ( v_W ( : , 3 ) ) ;~~	+
-	~~% v_W_4 = v_W( : , 4 ) / norm ( v_W ( : , 4 ) ) ;~~	+
-		+
-	~~% v_H_1 = v_H( : , 1 ) / norm ( v_H ( : , 1 ) ) ;~~	+
-	~~% v_H_2 = v_H( : , 2 ) / norm ( v_H ( : , 2 ) ) ;~~	+
-	~~% v_H_3 = v_H( : , 3 ) / norm ( v_H ( : , 3 ) ) ;~~	+
-	~~% v_H_4 = v_H( : , 4 ) / norm ( v_H ( : , 4 ) ) ;~~	+

-	%4a)4a	+	%4a)4a
-	if ( ~~Epsilon1 - lamda_W~~ )>(~~lamda_H~~+~~Epsilon2~~)	+	cvx_begin
-	~~Caso~~=1 ~~%For know where am I~~	+	variables p1 p2 W(4,4) R(2,4);
		+	minimize (p1+p2);
		+	subject to
		+	W(1,1)<=p1;
		+	W(2,2)<=p1;
		+	W(1,1)>=Epsilon1;
		+	W(2,2)>=Epsilon1;
		+	W(3,3)==W(1,1);
		+	W(4,4)==W(2,2);

-	~~cvx_begin~~	+	R(1,1)>=-p2;
-	~~variables p1 p2 W(4,4) R(2,4)~~	+	R(1,1)<=p2;
-		+	R(2,3)==R(1,1);
-	~~minimize (p1+p2)~~	+	R(1,2)>=-p2;
-		+	R(1,2)<=p2;
-	~~subject to~~	+	R(2,4)==R(1,2);
-		+
-	~~W(1,1)<=p1~~	+
-	~~W(2,2)<=p1~~	+
-	~~W(1,1)>=Epsilon1~~	+
-	~~W(2,2)>=Epsilon1~~	+
-	~~W(3,3)==W(1,1)~~	+
-	~~W(4,4)==W(2,2)~~	+
-		+
-	R(1,1)>=-p2	+
-	R(1,1)<=p2	+
-	R(2,3)==R(1,1)	+
-	R(1,2)>=-p2	+
-	R(1,2)<=p2	+
-	R(2,4)==R(1,2)	+
-		+
-	~~H=WA_a'+A_aW-B_aR-R'B_a'~~	+
-		+
-	~~v_W'Wv_W - Epsilon1eye(2n) == semidefinite(2*n~~);	+

		+	H=WA_a'+A_aW-B_aR-R'B_a';
		+	if (Epsilon1 - lamda_W) > (lamda_H + Epsilon2)
		+	v_W'Wv_W - Epsilon1eye(2n) == semidefinite(2*n);
		+	else
		+	Epsilon2eye(2n) + v_H'Hv_H == -semidefinite(2*n);
		+	end
	cvx_end		cvx_end
-
-	else %4b)4b
-
-	Caso = 2
-	cvx_begin
-
-	variables p1 p2 W(4,4) R(2,4)
-
-	minimize (p1+p2)
-
-	subject to
-
-	W(1,1)>=Epsilon1
-	W(2,2)>=Epsilon1
-	W(1,1)<=p1
-	W(2,2)<=p1
-	W(3,3)==W(1,1)
-	W(4,4)==W(2,2)
-
-	R(1,1)>=-p2
-	R(1,1)<=p2
-	R(2,3)==R(1,1)
-	R(1,2)>=-p2
-	R(1,2)<=p2
-	R(2,4)==R(1,2)
-
-	H=WA_a'+A_aW-B_aR-R'B_a'
-
-	Epsilon2eye(2n) + v_H'Hv_H == -semidefinite(2*n);
-
-	cvx_end
-	end
-

	R		R

Mtxu at 09:18, 6 February 2009

Mtxu — Fri, 06 Feb 2009 09:18:04 GMT

←Older revision		Revision as of 09:18, 6 February 2009
Line 6:		Line 6:
	Thanks a lot for all the ideas, they all are greats.		Thanks a lot for all the ideas, they all are greats.

-	I think I'm wrong with this code, I would like to put the if - else - end with the another constraits, inside the cxv_begin, but the CVX don't let me doing it. Some ideas?	+	I think I'm wrong with this code, I would like to put the <pre>if - else - end </pre>with the another constraits, inside the cxv_begin, but the CVX don't let me doing it. Some ideas?

	I come work thinking on you idea. I think you idea it’s right and I’m making thinks wrong.		I come work thinking on you idea. I think you idea it’s right and I’m making thinks wrong.
Line 13:		Line 13:

	The new code could be:		The new code could be:
-		+	<pre>
	1º I calculate some variables,		1º I calculate some variables,

Line 29:		Line 29:

	3ºIf there is not solution STOP, if there is, go to 1º,		3ºIf there is not solution STOP, if there is, go to 1º,
-		+	</pre>
	I’ve tried making this, I make: 1º, 2, 3º; return to 1º,2º, 3º And here the CVX says that there is not solution, that’s the reason for trying to keep inside the if – else.		I’ve tried making this, I make: 1º, 2, 3º; return to 1º,2º, 3º And here the CVX says that there is not solution, that’s the reason for trying to keep inside the if – else.

	My dude is, why CVX says there is not solution, it could be because the iteration (making steps 1-2-3) before is the correct. For explain (I know my English isn’t the best, and it’s hard for me to explain and for you to read)		My dude is, why CVX says there is not solution, it could be because the iteration (making steps 1-2-3) before is the correct. For explain (I know my English isn’t the best, and it’s hard for me to explain and for you to read)
-		+	<pre>
	One iteracion (steps 1, 2, 3)		One iteracion (steps 1, 2, 3)

Line 51:		Line 51:

	Correct data = DATA2		Correct data = DATA2
-		+	</pre>
	What do you think? Any idea?		What do you think? Any idea?

Mtxu at 09:15, 6 February 2009

Mtxu — Fri, 06 Feb 2009 09:15:50 GMT

←Older revision		Revision as of 09:15, 6 February 2009
Line 7:		Line 7:

	I think I'm wrong with this code, I would like to put the if - else - end with the another constraits, inside the cxv_begin, but the CVX don't let me doing it. Some ideas?		I think I'm wrong with this code, I would like to put the if - else - end with the another constraits, inside the cxv_begin, but the CVX don't let me doing it. Some ideas?
		+
		+	I come work thinking on you idea. I think you idea it’s right and I’m making thinks wrong.
		+
		+	I have a dude.
		+
		+	The new code could be:
		+
		+	1º I calculate some variables,
		+
		+	2º with one if (with depends to variables point 1º) I select one linear constrint depending value of variables in 1º and I make all the: minimize…subjet to with apropiate constraints, convex and the one linear,
		+
		+	if
		+	cvx_begin
		+	...
		+	cvx_end
		+	else
		+	cvx_begin
		+	...
		+	cvx_end
		+	end
		+
		+	3ºIf there is not solution STOP, if there is, go to 1º,
		+
		+	I’ve tried making this, I make: 1º, 2, 3º; return to 1º,2º, 3º And here the CVX says that there is not solution, that’s the reason for trying to keep inside the if – else.
		+
		+	My dude is, why CVX says there is not solution, it could be because the iteration (making steps 1-2-3) before is the correct. For explain (I know my English isn’t the best, and it’s hard for me to explain and for you to read)
		+
		+	One iteracion (steps 1, 2, 3)
		+
		+	All well
		+
		+	Save data = DATA1
		+
		+	One iteracion (steps 1, 2, 3)
		+
		+	All well
		+
		+	Save data = DATA2
		+
		+	One iteracion (steps 1, 2, 3)
		+
		+	Wrong, no solution
		+
		+	Correct data = DATA2
		+
		+	What do you think? Any idea?
		+
		+	Thanks a lot for all.
		+
		+	-----------------------------------------------------------------------

	I don't know how to initialice Epsilon1 and Epsilon2. I'm trying different values.		I don't know how to initialice Epsilon1 and Epsilon2. I'm trying different values.

Kwokwah at 06:54, 6 February 2009

Kwokwah — Fri, 06 Feb 2009 06:54:07 GMT

←Older revision		Revision as of 06:54, 6 February 2009
Line 46:		Line 46:
	[v_H,D] = eig( full ( H ) )		[v_H,D] = eig( full ( H ) )

-	v_W_1 = v_W( : , 1 ) / norm ( v_W ( : , 1 ) ) ;	+	% v_W_1 = v_W( : , 1 ) / norm ( v_W ( : , 1 ) ) ;
-	v_W_2 = v_W( : , 2 ) / norm ( v_W ( : , 2 ) ) ;	+	% v_W_2 = v_W( : , 2 ) / norm ( v_W ( : , 2 ) ) ;
-	v_W_3 = v_W( : , 3 ) / norm ( v_W ( : , 3 ) ) ;	+	% v_W_3 = v_W( : , 3 ) / norm ( v_W ( : , 3 ) ) ;
-	v_W_4 = v_W( : , 4 ) / norm ( v_W ( : , 4 ) ) ;	+	% v_W_4 = v_W( : , 4 ) / norm ( v_W ( : , 4 ) ) ;

-	v_H_1 = v_H( : , 1 ) / norm ( v_H ( : , 1 ) ) ;	+	% v_H_1 = v_H( : , 1 ) / norm ( v_H ( : , 1 ) ) ;
-	v_H_2 = v_H( : , 2 ) / norm ( v_H ( : , 2 ) ) ;	+	% v_H_2 = v_H( : , 2 ) / norm ( v_H ( : , 2 ) ) ;
-	v_H_3 = v_H( : , 3 ) / norm ( v_H ( : , 3 ) ) ;	+	% v_H_3 = v_H( : , 3 ) / norm ( v_H ( : , 3 ) ) ;
-	v_H_4 = v_H( : , 4 ) / norm ( v_H ( : , 4 ) ) ;	+	% v_H_4 = v_H( : , 4 ) / norm ( v_H ( : , 4 ) ) ;

	%4a)4a		%4a)4a

Mtxu at 22:35, 5 February 2009

Mtxu — Thu, 05 Feb 2009 22:35:09 GMT

←Older revision		Revision as of 22:35, 5 February 2009
Line 6:		Line 6:
	Thanks a lot for all the ideas, they all are greats.		Thanks a lot for all the ideas, they all are greats.

-	I ~~don~~'~~t know how~~ to ~~initialice Epsilon1 and Epsilon2. At~~ the ~~article~~ don't ~~put anything~~.	+	I think I'm wrong with this code, I would like to put the if - else - end with the another constraits, inside the cxv_begin, but the CVX don't let me doing it. Some ideas?

-	I ~~put off the while structure~~.	+	I don't know how to initialice Epsilon1 and Epsilon2. I'm trying different values.

	Thanks a lot again.		Thanks a lot again.

Mtxu at 18:02, 5 February 2009

Mtxu — Thu, 05 Feb 2009 18:02:22 GMT

←Older revision		Revision as of 18:02, 5 February 2009
Line 3:		Line 3:
	</pre>		</pre>
	--------------------------------------------------------------------		--------------------------------------------------------------------
-
-	The paper its: Pole assignment of linear uncertain systems in a sector via a lyapunov - tipe approach. D. Arzeiler, J. Bernussou and G. Garcia. IEEE transactions automatic control, vol 38, nº 7, July 1993.

	Thanks a lot for all the ideas, they all are greats.		Thanks a lot for all the ideas, they all are greats.

-	I don't know how to initialice Epsilon1 and Epsilon2 ~~I'm going to research in~~ the ~~references of my~~ article ~~(Cross fingers)~~	+	I don't know how to initialice Epsilon1 and Epsilon2. At the article don't put anything.
		+
		+	I put off the while structure.

	Thanks a lot again.		Thanks a lot again.
Line 14:		Line 14:
	Here is the new code:		Here is the new code:

-	<pre>	+	<pre>%0)Initialization
-	%0)Initialization	+
	clear all;		clear all;
	n=2; m=1;		n=2; m=1;
Line 42:		Line 41:
	end		end

		+	%while para==0
	%3)3		%3)3
	[v_W,D] = eig( full ( W ) )		[v_W,D] = eig( full ( W ) )
Line 119:		Line 119:
	end		end

-	lamda_W = min ( eig ( full ( W ) ) )
-	lamda_H = max ( eig ( full ( H ) ) )

	R		R
	W=full(W)		W=full(W)
	K=R/W		K=R/W
-
	</pre>		</pre>