from
Steepest Decent Method
by Duc Solves a multi-variable unconstrained optimization problem using the Steepest Decent Method
realVT=removeComplexVals(complexVT)
function realVT=removeComplexVals(complexVT)
%remove all complex values in complex vector complexVT
[m n]=size(complexVT);
for k=1:m
if isreal(complexVT(k))
realVT(k)=complexVT(k);
end
end
