bisector.m

来自「优化设计中的一维搜索方法」· M 代码 · 共 19 行

function [fx,fy,iter] = bisector(func,limt)
if length(limt)~=2
    error('error input limt!');
end
newp = sum(limt)/2;
fdnewp = subs(diff(func),newp);
iter = 0;
while abs(fdnewp)>10^10*eps
    if fdnewp<0
        limt(1) = newp;
    else
        limt(2) = newp;
    end
    newp = sum(limt)/2;
    fdnewp = subs(diff(func),newp);
    iter = iter+1;
end
fx = newp;
fy = subs(func,newp);