5 /* We want to do multidimensional minimisation.
7 * We don't think there are any local minima. Or at least, if there
8 * are, the local minimum which will be found from the starting
9 * state is the one we want.
11 * We don't want to try to provide a derivative of the cost
12 * function. That's too tedious (and anyway the polynomial
13 * approximation to our our cost function sometimes has high degree
14 * in the inputs which means the quadratic model implied by most of
15 * the gradient descent minimisers is not ideal).
17 * This eliminates most of the algorithms. Nelder and Mead's
18 * simplex algorithm is still available and we will try that.
20 * In our application we are searching for the optimal locations of
21 * N actualvertices in D3 (3) dimensions - ie, we are searching for
22 * the optimal metapoint in an N*D3-dimensional space.
24 * So eg with X=Y=100, the simplex will contain 300 metavertices
25 * each of which is an array of 300 doubles for the actualvertex
26 * coordinates. Hopefully this won't be too slow ...
31 #include <gsl/gsl_errno.h>
32 #include <gsl/gsl_multimin.h>
40 const char *input_file, *best_file;
42 long long evaluations;
43 double stop_epsilon= 1e-20;
45 static void printing_init(void);
47 static gsl_multimin_fminimizer *minimiser;
48 static const char *final_file;
49 static char *final_file_tmp;
51 static double minfunc_f(const gsl_vector *x, void *params) {
54 assert(x->size == DIM);
55 assert(x->stride == 1);
56 map_dimensions(x->data, vs.a);
57 return compute_energy(&vs);
60 static void badusage(void) {
61 fputs("usage: minimise <input> [-i<intermediate>] -o<output\n",stderr);
65 static sig_atomic_t quit_requested;
67 static void sigint_handler(int ignored) {
71 int main(int argc, const char *const *argv) {
72 gsl_multimin_function multimin_function;
74 struct Vertices initial_full;
75 double initial_half[DIM], step_size[DIM];
77 gsl_vector initial_gsl, step_size_gsl;
78 int r, i, size_check_counter= 0;
83 if (strncmp(argv[2],"-o",2)) badusage(); best_file= argv[2]+2;
87 if (strncmp(argv[2],"-i",2)) badusage(); best_file= argv[2]+2;
88 if (strncmp(argv[3],"-o",2)) badusage(); final_file= argv[3]+2;
92 if (argv[1][0]=='-') badusage();
94 if (asprintf(&best_file_tmp,"%s.new",best_file) <= 0) diee("asprintf");
96 if (asprintf(&final_file_tmp,"%s.new",final_file) <= 0) diee("asprintf");
98 memset(&sa,0,sizeof(sa));
99 sa.sa_handler= sigint_handler;
100 sa.sa_flags= SA_RESETHAND;
101 r= sigaction(SIGINT,&sa,0);
102 if (r) diee("sigaction SIGINT");
104 graph_layout_prepare();
108 printf("X=%d=0x%x Y=%d=0x%x DIM=%d\n",X,X,Y,Y,DIM);
110 minimiser= gsl_multimin_fminimizer_alloc
111 (gsl_multimin_fminimizer_nmsimplex, DIM);
112 if (!minimiser) { perror("alloc minimiser"); exit(-1); }
114 multimin_function.f= minfunc_f;
115 multimin_function.n= DIM;
116 multimin_function.params= 0;
118 initial_f= fopen(input_file,"rb"); if (!initial_f) diee("fopen initial");
119 errno= 0; r= fread(&initial_full,sizeof(initial_full),1,initial_f);
120 if (r!=1) diee("fread");
123 pmap_dimensions(&initial_full);
124 unmap_dimensions(initial_half,&initial_full);
125 for (i=0; i<DIM; i++) step_size[i]= 0.03;
127 initial_gsl.size= DIM;
128 initial_gsl.stride= 1;
129 initial_gsl.block= 0;
130 initial_gsl.owner= 0;
131 step_size_gsl= initial_gsl;
133 initial_gsl.data= initial_half;
134 step_size_gsl.data= step_size;
136 GA( gsl_multimin_fminimizer_set(minimiser, &multimin_function,
137 &initial_gsl, &step_size_gsl) );
140 if (quit_requested) {
141 fprintf(stderr,"SIGINT caught.\n");
145 GA( gsl_multimin_fminimizer_iterate(minimiser) );
147 if (!(size_check_counter++ % DIM)) {
148 size= gsl_multimin_fminimizer_size(minimiser);
149 r= gsl_multimin_test_size(size, stop_epsilon);
151 if (printing_check(pr_size,215))
152 printf("r=%2d, size %# e\n", r, size);
155 if (r==GSL_SUCCESS) break;
156 assert(r==GSL_CONTINUE);
161 if (unlink(final_file_tmp) && errno != ENOENT) diee("unlink final .tmp");
162 if (link(best_file,final_file_tmp)) diee("link final .tmp");
163 if (rename(final_file_tmp,final_file)) diee("install final");
165 printf("FINISHED (%lld evaluations)\n",evaluations);
170 /*---------- printing rate limit ----------*/
172 static volatile unsigned print_todo;
173 static sigset_t print_alarmset;
175 int printing_check(enum printing_instance which, int indent) {
176 static int skipped[pr__max];
178 unsigned bits= 1u << which;
181 if (!(print_todo & bits)) {
186 sigprocmask(SIG_BLOCK,&print_alarmset,0);
188 sigprocmask(SIG_UNBLOCK,&print_alarmset,0);
190 printf("%*s",indent,"");
192 if (sk) printf("[%4d] ",sk);
199 static void alarmhandler(int ignored) {
203 static void printing_init(void) {
205 struct itimerval itv;
207 sigemptyset(&print_alarmset);
208 sigaddset(&print_alarmset,SIGALRM);
210 sa.sa_handler= alarmhandler;
211 sa.sa_mask= print_alarmset;
212 sa.sa_flags= SA_RESTART;
213 if (sigaction(SIGALRM,&sa,0)) diee("sigaction ALRM");
215 itv.it_interval.tv_sec= 0;
216 itv.it_interval.tv_usec= 200000;
217 itv.it_value= itv.it_interval;
219 if (setitimer(ITIMER_REAL,&itv,0)) diee("setitimer REAL");