1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
#include "wnlib.h"
#include "wnvect.h"
#include "wnconj.h"
local double s;
local int count;
local double function(double v[])
{
double ret;
ret = 1.5*v[0]-2.5*v[1];
ret += wn_penalty(s*v[0]);
ret += wn_penalty(s*v[1]);
ret += wn_penalty(s*(1.0-v[0]));
ret += wn_penalty(s*(1.0-v[1]));
printf(" ");
wn_print_vect(v,2);
printf(" ob = %lf\n",ret);
return(ret);
}
local void gradient(double grad[],double v[])
{
printf("gradient. count=%d\n",count);
++count;
grad[0] = 1.5;
grad[1] = -2.5;
grad[0] += s*wn_dpenalty(s*v[0]);
grad[1] += s*wn_dpenalty(s*v[1]);
grad[0] += -s*wn_dpenalty(s*(1.0-v[0]));
grad[1] += -s*wn_dpenalty(s*(1.0-v[1]));
}
void main(void)
{
double *vect;
int code;
double val_min;
wn_gpmake("no_free");
wn_make_vect(&vect,2);
count = 0;
vect[0] = 0.3;
vect[1] = 0.25;
s = 100.0;
/*
for(s=1.0;;s *= 2)
{
*/
printf("s = %lf\n",s);
/*
wn_conj_direction_method(&code,&val_min,
vect,2,(function),WN_IHUGE);
*/
wn_conj_gradient_method(&code,&val_min,
vect,2,(function),(gradient),WN_IHUGE);
wn_print_vect(vect,2);
printf("final result: code = %d ",code);
printf("count = %d\n",count);
printf(" ob = %lf\n",val_min);
/*
}
*/
wn_gpfree();
}
|
