goldsplictobj.m

来自「最速下降法 优化算法问题以及其说明等等」· M 代码 · 共 27 行

%The following subfunction is on the goldspliction
%search of the substi function
function y=goldsplictobj(x)
a=0;
b=10;
eps=0.01;
y1=a+0.382*(b-a);
y2=a+0.618*(b-a);
while abs(b-a)>eps
   if substi(y1,x)>substi(y2,x)
      a=y1;
      b=b;
      y1=a+0.382*(b-a);
      y2=a+0.618*(b-a);
   elseif substi(y2,x)>substi(y1,x)
      a=a;
      b=y2;
      y1=a+0.382*(b-a);
      y2=a+0.618*(b-a);
   else
      a=y1;
      b=y2;
      y1=a+0.382*(b-a);
      y2=a+0.618*(b-a);
   end
end
y=(y1+y2)/2;