function b_con = FindingAlpha(A,c,b_star,b_guess,mu,lambda,T)
% Given a b_star not in convex set script B(A,c) and b_guess in convex set
% script B(A,c). Using a standard bisection algorithm and the Budan-Fourier
% sequence we find a b_con (i.e. b constrained ) as a convex combination of
% b_star and b_guess which lies on the boundary of the convex set script
% B(A,c)
eps = 1;
l = 0;
r = 1;
while (eps > 0.001)
alpha = (l+r)/2;
b = (1-alpha)*b_guess + alpha*b_star;
Indicator = Zeros_EPT_DP(A,b,c,mu,lambda,T);
if(Indicator == 1);
r = alpha;
else
l = alpha;
end
eps = abs(l-r);
end
b_con = b;
end