bisect.m

来自「optimization using golden section search」· M 代码 · 共 34 行

function [c,fc,i] = bisect(xl, xu, tol, maxi, g)
% clear all
% clc
% xl=0.5
% xu=2
% maxi=100
% tol=0.001;

fl=feval(g,0.5);
error=xu-xl;
i=0;


while ( error > tol & i<maxi)
    
    
    error=error/2;
    c=xl+error;
    fc=feval(g,c);
    i=i+1;
    if fl*fc<0
        xu=c;
        fu=fc;
    else
        xl=c;
        fl=fc;
    end
end