This is Dikin’s method for minimizing
, subject to
and
. Start with x at a feasible point.
for i=1:80,p=diag(x)^2;r=p*(c-A'*(A*p*A'\A*p*c));m=x./r;x=x-.9*r*min(m(r>0));end
A = randn(100, 300); x0 = rand(300, 1); b = A*x0; c = rand(300, 1); x = x0; for i=1:80,p=diag(x)^2;r=p*(c-A'*(A*p*A'\A*p*c));m=x./r;x=x-.9*r*min(m(r>0));end