I saw a paper, it give a SDP problem, but i can not realize it!
the paper and my result Y( 7x7 matrix) is below:
in this paper, y11 = y1y1, y12 = y1y2,
my code is:
clear;
fs = 100;
tt = 0:1/fs:1;
I = sin(2pi10tt);
Q = cos(2pi10tt);
A = [];
at = [];
for i = 1:length(I)
at = [I(i)*I(i) I(i)*Q(i) Q(i)*Q(i) I(i) Q(i) 1];
A = [A
at];
end
m=length(I);
cvx_begin
variable X(7,7)
% variable y(7)
% y(1) = 1;
% X = y*y’;
% X(1,3)-X(3,1) == 0;
% X(2,2) - X(1,2)*X(2,1) == 0;
% square(X(1,2)) - X(2,2) == 0; %this is some test for X(2,2) = X(1,2)X(1,2)
X(1,1) == 1;
X(3,3)-4X(2,4) <= 0;
X == semidefinite(7);
r = A*X(2:7,1)
minimize norm(r,1)
cvx_end
so the result is not show the y11 = y1y1, y12 = y1y2, and so on,
so how to solve this problem???