//无约束最优化坐标轮换法
//C语言
#include
#include
#define m 10
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 zblhf(int n,float x0[],float h,float flag1,float flag2,float a[],float b[],float x[]);
float f(float x[])
{
float result;
result=60-10*(x[0])-4*(x[1])+(x[0]*x[0])+(x[1]*x[1])-(x[0]*x[1]);
return result;
}
/*多维进退法子程序*/
void mjtf(int n,float x0[],float h,float s[],float a[],float b[])
{
int i;
float x1[m],x2[m],x3[m],f1,f2,f3;
for(i=0;i
{
x1[i]=x0[i];
x2[i]=x0[i]+h*s[i];
}
f1=f(x1);
f2=f(x2);
if(f2>=f1)
{
h=(-1)*h;
for(i=0;i
x3[i]=x1[i];
for(i=0;i
x1[i]=x2[i];
for(i=0;i
x2[i]=x3[i];
for(i=0;i
x3[i]=x1[i]+h*s[i];
f3=f1;
f1=f2;
f2=f3;
f3=f(x3);
}
h=2*h;
for(i=0;i
x3[i]=x2[i]+h*s[i];
f3=f(x3);
while(f3
{
for(i=0;i
x1[i]=x2[i];
f1=f2;
for(i=0;i
x2[i]=x3[i];
f2=f3;
for(i=0;i
x3[i]=x2[i]+h*s[i];
f3=f(x3);
}
for(i=0;i
{
if(h>0)
{
a[i]=x1[i];
b[i]=x3[i];
}
else
{
a[i]=x3[i];
b[i]=x1[i];
}
}
}
/*多维黄金分割法子程序*/
void mhjfgf(int n,float a[],float b[],float flag,float x[])
{
int i;
float x1[m],x2[m],f1,f2,sum,f0;
for(i=0;i
x1[i]=a[i]+(float)0.382*(b[i]-a[i]);
f1=f(x1);
for(i=0;i
x2[i]=a[i]+(float)0.618*(b[i]-a[i]);
f2=f(x2);
do
{
if(f1
{
for(i=0;i
b[i]=x2[i];
for(i=0;i
x2[i]=x1[i];
f2=f1;
for(i=0;i
x1[i]=a[i]+(float)0.382*(b[i]-a[i]);
f1=f(x1);
}
else
{
for(i=0;i
a[i]=x1[i];
for(i=0;i
x1[i]=x2[i];
f1=f2;
for(i=0;i
x2[i]=a[i]+(float)0.618*(b[i]-a[i]);
f2=f(x2);
}
sum=0;
for(i=0;i