无约束坐标轮换法编程

1、/无约束最优化坐标轮换法/C语言#include<stdio.h>#inelude<math.h>#definem10floatf(floatx);voidmjtf(intn,floatxO,floath,floats,floata,floatb);a,floata,floatvoidmhjfgf(intn,floata,floatb,floatflag,floatx);voidzblhf(intn,floatx0,floath,floatflag1,floatflag2,floatb,floatx);floatf(floatx)floatresult;result=6

2、0-10*(x0)-4*(x1)+(x0*x0)+(x1*x1)-(x0*x1);returnresult;/*多维进退法子程序*/voidmjtf(intn,floatx0,floath,floats,floata,floatb)inti;floatx1m,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+)x3i=x1i;for(i=0;i<n;i+)x1i=x2i;for(i=0;i<n;i+)x2i=

3、x3i;for(i=0;i<n;i+)x3i=x1i+h*si;f3=f1;f1=f2;f2=f3;f3=f(x3);h=2*h;for(i=0;i<n;i+)x3i=x2i+h*si;f3=f(x3);while(f3<f2)for(i=0;i<n;i+)x1i=x2i;f仁f2;for(i=0;i<n;i+)x2i=x3i;f2=f3;for(i=0;i<n;i+)x3i=x2i+h*si;f3=f(x3);for(i=0;i<n;i+)if(h>0)ai=x1i;bi=x3i;elseai=x3i;bi=x1i;/*多维黄金分割法子程序*/

4、voidmhjfgf(intn,floata,floatb,floatflag,floatx)inti;floatx1m,x2m,f1,f2,sum,f0;for(i=0;i<n;i+)x1i=ai+(float)0.382*(bi-ai);f1=f(x1);for(i=0;i<n;i+)x2i=ai+(float)0.618*(bi-ai);f2=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=ai+(float)0.382*(bi

5、-ai);f1=f(x1);elsefor(i=0;i<n;i+)ai=x1i;for(i=0;i<n;i+)x1i=x2i;f仁f2;for(i=0;i<n;i+)x2i=ai+(float)0.618*(bi-ai);f2=f(x2);sum=0;for(i=0;i<n;i+)sum+=(bi-ai)*(bi-ai);while(sqrt(sum)>flag);for(i=0;i<n;i+)xi=(float)0.5*(bi+ai);f0=f(x);/*坐标轮换法子程序*/a,floata,floatvoidzblhf(intn,floatx0,floa

6、th,floatflag1,floatflag2,floatb,floatx)inti,k;floatx1m,smm,sum,c,d;printf("输入搜索方向：n");scanf("%f%f",&c,&d);for(i=0;i<n;i+)for(k=0;k<n;k+)if(k=0)sik=c;elsesik=d;k=1;dofor(i=0;i<n;i+)x1i=x0i;for(i=0;i<n;i+)mjtf(n,x1,h,si,a,b);mhjfgf(n,a,b,flag1,x1);sum=0;for(i=0;

7、i<n;i+)sum=sum+(x1i-x0i)*(x1i-x0i);if(sqrt(sum)<=flag2)break;elsek=k+1;for(i=0;i<n;i+)x0i=x1i;while(1);for(i=0;i<n;i+)xi=x1i;/*坐标轮换法主程序*/voidmain()inti,n;floath,flag1,flag2,x0m,am,bm,xm;printf("n<坐标轮换法>n");printf("请输入维数:n");scanf("%d",&n);printf(&q

8、uot;请输入初始点:");for(i=0;i<n;i+)printf("nxO%d=",i);scanf("%f",&xOi);printf("n请输入初始步长:n");:n");:n");scanf("%f",&h);printf("n请输入黄金分割法迭代精度scanf("%f",&flag1);printf("n请输入坐标轮换法迭代精度scanf("%f",&flag2);zblhf(n,x0,h,flag1,flag2,a,b,x);printf("n极小点坐标为:n");for(i=0;