Dear,
The CVX information are given as following,
Successive approximation method to be employed.
For improved efficiency, SDPT3 is solving the dual problem.
SDPT3 will be called several times to refine the solution.
Original size: 7596 variables, 3191 equality constraints
800 exponentials add 6400 variables, 4000 equality constraints
-----------------------------------------------------------------
Cones | Errors |
Mov/Act | Centering Exp cone Poly cone | Status
--------±--------------------------------±--------
227/227 | 8.000e+00 1.225e+01 0.000e+00 | Unbounded
800/800 | 8.000e+00 1.916e+01 0.000e+00 | Solved
800/800 | 6.020e+00 2.016e+01s 0.000e+00 | Solved
770/771 | 5.601e+00 1.389e+01 0.000e+00 | Solved
467/467 | 5.283e+00 1.187e+01 0.000e+00 | Solved
402/402 | 4.627e+00 1.012e+01 0.000e+00 | Solved
382/382 | 3.458e+00 8.094e+00 0.000e+00 | Solved
172/172 | 2.485e+00 6.526e+00 0.000e+00 | Solved
170/170 | 3.801e+00 7.425e+00 0.000e+00 | Solved
57/ 57 | 1.886e+00 2.335e+00 0.000e+00 | Solved
41/ 41 | 2.153e+00 1.218e+00 0.000e+00 | Solved
244/244 | 3.448e+00 3.507e+00 0.000e+00 | Solved
725/725 | 4.579e+00 6.970e+00 0.000e+00 | Solved
364/365 | 3.056e+00 4.965e+00 0.000e+00 | Solved
41/ 41 | 2.102e+00 1.307e+00 0.000e+00 | Solved
244/244 | 3.219e+00 3.765e+00 0.000e+00 | Solved
737/737 | 4.540e+00 6.813e+00 0.000e+00 | Solved
293/294 | 1.744e+00 4.119e+00 0.000e+00 | Solved
66/ 66 | 2.324e+00 3.646e+00 0.000e+00 | Solved
38/ 38 | 2.062e+00 1.382e+00 0.000e+00 | Solved
490/490 | 8.000e+00 8.080e+00 0.000e+00 | Inaccurate/Solved
698/698 | 8.000e+00 8.125e+00 0.000e+00 | Solved
240/281 | 1.743e+00 3.214e+00 0.000e+00 | Solved
49/ 49 | 2.056e+00 2.238e+00 0.000e+00 | Solved
29/ 29 | 2.317e+00 9.870e-01 0.000e+00 | Solved
-----------------------------------------------------------------
Status: Failed
Optimal value (cvx_optval): NaN
///////////////////////////////// code//////////////
function [ p,q,object_value ] = TrajectoryUsingCVX( a,y_l )
global R_th K N User_Position P_max V_max delta H snr
cvx_begin
variable p(N,1)
variable y(N,K)
variable q(2,N)
expression R(1,K)
expression R_1(N,K)
expression R_2(N,K)
for k=1:K
for n=1:N
R_1(n,k)=1./log(2)*log(y(n,k)+H^2+p(n)*snr);
end
end
R_2=1/log(2)*(log(y_l+H^2)+1./(y_l+H^2).*(y-y_l));
R=1./N*sum(a.*R_1)-1./N*sum(a.*R_2);
minimize sum(p)
subject to
R>=R_th;
for k=1:K
for n=1:N
sum_square(q(:,n)-User_Position(:,k))<=y(n,k);
end
end
0<=p<=P_max;
for n=1:N-1
norm(q(:,n+1)-q(:,n))<=V_max*delta;
end
q(:,1)==[-800 0]';
q(:,N)==[800 0]';
cvx_end
object_value=cvx_optval;
end
why did it happen?
Thanks in advance!