最优化方法与实践-黄金分割法（matlab实现）

作用：确定单变量函数的近似极小点

算法：

代码：

%Author:风君子
%Date:2022.9.24
%Course:Optimization
%Golden section method
function [s, phis, k, G, E] = golds(phi, a, b, delta, epsilon)
%输入：phi目标函数；[a, b]是搜索区间的
%delta, epsilon分别为自变量和函数值的容许误差
%输出：s，phis分别是近似极小点和极小值
%G是n*4矩阵：其第k行分别为第k次迭代值[ak,pk,qk,bk]
%E=[ds,dphi]为s和phis的误差限
t = (sqrt(5) - 1) / 2;%黄金分割率
h = b - a;
phia = feval(phi, a);
phib = feval(phi, b);
p = a + (1 -t)*h;
q = a + t*h;
phip = feval(phi, p);
phiq = feval(phi, q);
k = 1;
G(k, :) = [a, p, q, b];
while(abs(phib - phia) > epsilon) | (h > delta)
    if (phip < phiq)
        b = q;
        phib = phiq;
        q =p;
        phiq = phip;
        h = b - a;
        p = a + (1 - t) * h;
        phip = feval(phi,p);
    else
        a = p;
        phia = phip;
        p = q;
        phip = phiq;
        h = b - a;
        q = a + t * h;
        phiq = feval(phi,q);
    end
    k = k + 1;
    G(k,:) = [a, p, q, b];
end
ds = abs(b - a);
dphi = abs(phib - phia);
if (phip <= phiq)
    s = p;
    phis = phip;
else
    s = q;
    phis = phiq;
end
E = [ds, dphi];