优化设计-鲍威尔法程序(c语言)

1、.#include <stdio.h>#include <math.h>#define m 10/* 数组长度m>=维数 n*/float f(float x);void mjtf(int n,float x0,float h,float s,float a,float b);void mhjfgf(int n,float a,float b,float flag,float x);void mbwef(int n,float x0,float h,float flag,float a,float b,float x);float f(float x)float

2、result;result=60-10*x0-4*x1+x0*x0+x1*x1-x0*x1;return result;/* 多维进退法子程序*/void mjtf(int n,float x0,float h,float s,float a,float b)int i;float x1m,x2m,x3m,f1,f2,f3;for(i=0;i<n;i+)/* 计算初始两试点*/x1i=x0i;x2i=x0i+h*si;可编辑.f1=f(x1);f2=f(x2);if(f2>=f1)/* 判断搜索方向 */* 搜索方向为反向，转身*/h=(-1)*h;for(i=0;i<n;i

3、+)x3i=x1i;f3=f1;for(i=0;i<n;i+)x1i=x2i;f1=f2;for(i=0;i<n;i+)x2i=x3i;f2=f3;/* 搜索方向为正向*/for(i=0;i<n;i+)/* 计算第三试点*/x3i=x2i+h*si;f3=f(x3);while(f3<f2)/* 判断是否未完成搜索*/* 未完成，继续搜索*/h=2*h;可编辑.for(i=0;i<n;i+)x1i=x2i;f1=f2;for(i=0;i<n;i+)x2i=x3i;f2=f3;for(i=0;i<n;i+)x3i=x2i+h*si;f3=f(x3);/*

4、 已完成 */for(i=0;i<n;i+)/* 输出初始搜索区间*/if(x1i<x3i)ai=x1i;bi=x3i;elseai=x3i;bi=x1i;可编辑./* 多维黄金分割法子程序*/void mhjfgf(int n,float a,float b,float flag,float x)int i;float x1m,x2m,f1,f2,sum;for(i=0;i<n;i+)/* 计算初始两试点*/x1i=bi-(float)0.618*(bi-ai);f1=f(x1);for(i=0;i<n;i+)x2i=ai+(float)0.618*(bi-ai);f

5、2=f(x2);doif(f1<=f2)/* 判断消去区间 */* 消去右 */for(i=0;i<n;i+)bi=x2i;for(i=0;i<n;i+)x2i=x1i;f2=f1;可编辑.for(i=0;i<n;i+)x1i=bi-(float)0.618*(bi-ai);f1=f(x1);else/* 消去左 */for(i=0;i<n;i+)ai=x1i;for(i=0;i<n;i+)x1i=x2i;f1=f2;for(i=0;i<n;i+)x2i=ai+(float)0.618*(bi-ai);f2=f(x2);sum=0;for(i=0;i&

6、lt;n;i+)sum+=(bi-ai)*(bi-ai);while(sqrt(sum)>flag*0.1);for(i=0;i<n;i+)xi=(float)0.5*(bi+ai);可编辑./* 鲍威尔法子程序*/void mbwef(int n,float x0,float h,float flag,float a,float b,float x)int i,j,k,r;float x1m,x2m,f0,f1,f2,fnm,smm,sum;for(i=0;i<n;i+)for(k=0;k<n;k+)if(i=k)sik=1;elsesik=0;k=1;while(1

7、)for(i=0;i<n;i+)x1i=x0i;for(i=0;i<n;i+)mjtf(n,x1,h,si,a,b);mhjfgf(n,a,b,flag,x1);fni=f(x0)-f(x1);可编辑.for(i=0;i<n;i+)x2i=2*x1i-x0i;for(i=1;i<n;i+)if(fn0<fni)fn0=fni;r=i;elser=0;f0=f(x0);f1=f(x1);f2=f(x2);if(f2>=f0|(f0-2*f1+f2)*(f0-f1-fn0)*(f0-f1-fn0)>=0.5*fn0*(f0-f2)*(f0-f2)sum=0;for(i=0;i<n;i+)sum+=(x1i-x0i)*(x1i-x0i);if(f1<=f2)for(i=1;i<n;i+)x0i=x1i;else可编辑.for(i=1;i<n;i+)x0i=x2i;elsefor(i=r;i<n;i+)for(j=0;j<n;j+)si j=si+1j;for(i=0;i<n;i+)sni=x1i-x0i;mjtf(n,x1,h,sn,a,b);mhjfgf(n,a,b,fl