gra.m

来自「线性规划 包括单纯形法」· M 代码 · 共 13 行

%------------梯度法------------%
function gra = gra(x,N)
eps = 1/10^6;
gx = gradf(x);
while (dist(gx,N) > eps)
    gx = -gradf(x);
    [fmin xinla] = Golden([0,3],x,gx);
    x = x + xinla*gx;
    gx = gradf(x);
 end
 x
 fmin = fun(x)