function [Y,t] = initial(L,VT,P,Q,eq,n,Jb);
% min tr AXBX^t + CX^t
% starting with feasible?
% 14.06.2002, waterloo  
% call: [Z,t1] = initial(L,VT,t,P,Q,eq,n,Jb); 


stop = 0;
par = 2;
Y =[n-1+ par,zeros(1,n*n); zeros(n*n,1), kron(eye(n),(eye(n) - ones(n)))];

while stop < 1,  
       Z = VT'*Y*VT; 
       [Z11,p] = chol(Z);
 
  if p == 0, 
    stop = 1; 
  else
     par = par*2;
     Y(1,1) = par+Y(1,1);
     if par > 1000, stop=1; end;
     end;
end;



stop = 0;
par = 1;

while stop < 1,  
    Z =  L + VT'*Y*VT; 
    [Z11,p] = chol(Z);
 
  if p == 0, 
    stop = 1; 
  else
     par = par*2;
     Y = par*Y;
     if par > 1000, stop=1; disp('p>0 wrong'); end;
     end;
end;
[t] = G(Y,P,Q,eq,n);

