gsl_multimin__vector_bfgs.c 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351
  1. /* multimin/vector_bfgs.c
  2. *
  3. * Copyright (C) 1996, 1997, 1998, 1999, 2000 Fabrice Rossi
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation; either version 3 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
  18. */
  19. /* vector_bfgs.c -- Limited memory Broyden-Fletcher-Goldfarb-Shanno method */
  20. /* Modified by Brian Gough to use single iteration structure */
  21. #include "gsl__config.h"
  22. #include "gsl_multimin.h"
  23. #include "gsl_blas.h"
  24. #include "gsl_multimin__directional_minimize.c"
  25. typedef struct
  26. {
  27. int iter;
  28. double step;
  29. double max_step;
  30. double tol;
  31. gsl_vector *x1;
  32. gsl_vector *dx1;
  33. gsl_vector *x2;
  34. double g0norm;
  35. double pnorm;
  36. gsl_vector *p;
  37. gsl_vector *x0;
  38. gsl_vector *g0;
  39. gsl_vector *dx0;
  40. gsl_vector *dg0;
  41. }
  42. vector_bfgs_state_t;
  43. static int
  44. vector_bfgs_alloc (void *vstate, size_t n)
  45. {
  46. vector_bfgs_state_t *state = (vector_bfgs_state_t *) vstate;
  47. state->x1 = gsl_vector_calloc (n);
  48. if (state->x1 == 0)
  49. {
  50. GSL_ERROR ("failed to allocate space for x1", GSL_ENOMEM);
  51. }
  52. state->dx1 = gsl_vector_calloc (n);
  53. if (state->dx1 == 0)
  54. {
  55. gsl_vector_free (state->x1);
  56. GSL_ERROR ("failed to allocate space for dx1", GSL_ENOMEM);
  57. }
  58. state->x2 = gsl_vector_calloc (n);
  59. if (state->x2 == 0)
  60. {
  61. gsl_vector_free (state->dx1);
  62. gsl_vector_free (state->x1);
  63. GSL_ERROR ("failed to allocate space for x2", GSL_ENOMEM);
  64. }
  65. state->p = gsl_vector_calloc (n);
  66. if (state->p == 0)
  67. {
  68. gsl_vector_free (state->x2);
  69. gsl_vector_free (state->dx1);
  70. gsl_vector_free (state->x1);
  71. GSL_ERROR ("failed to allocate space for p", GSL_ENOMEM);
  72. }
  73. state->x0 = gsl_vector_calloc (n);
  74. if (state->x0 == 0)
  75. {
  76. gsl_vector_free (state->p);
  77. gsl_vector_free (state->x2);
  78. gsl_vector_free (state->dx1);
  79. gsl_vector_free (state->x1);
  80. GSL_ERROR ("failed to allocate space for g0", GSL_ENOMEM);
  81. }
  82. state->g0 = gsl_vector_calloc (n);
  83. if (state->g0 == 0)
  84. {
  85. gsl_vector_free (state->x0);
  86. gsl_vector_free (state->p);
  87. gsl_vector_free (state->x2);
  88. gsl_vector_free (state->dx1);
  89. gsl_vector_free (state->x1);
  90. GSL_ERROR ("failed to allocate space for g0", GSL_ENOMEM);
  91. }
  92. state->dx0 = gsl_vector_calloc (n);
  93. if (state->dx0 == 0)
  94. {
  95. gsl_vector_free (state->g0);
  96. gsl_vector_free (state->x0);
  97. gsl_vector_free (state->p);
  98. gsl_vector_free (state->x2);
  99. gsl_vector_free (state->dx1);
  100. gsl_vector_free (state->x1);
  101. GSL_ERROR ("failed to allocate space for g0", GSL_ENOMEM);
  102. }
  103. state->dg0 = gsl_vector_calloc (n);
  104. if (state->dg0 == 0)
  105. {
  106. gsl_vector_free (state->dx0);
  107. gsl_vector_free (state->g0);
  108. gsl_vector_free (state->x0);
  109. gsl_vector_free (state->p);
  110. gsl_vector_free (state->x2);
  111. gsl_vector_free (state->dx1);
  112. gsl_vector_free (state->x1);
  113. GSL_ERROR ("failed to allocate space for g0", GSL_ENOMEM);
  114. }
  115. return GSL_SUCCESS;
  116. }
  117. static int
  118. vector_bfgs_set (void *vstate, gsl_multimin_function_fdf * fdf,
  119. const gsl_vector * x, double *f, gsl_vector * gradient,
  120. double step_size, double tol)
  121. {
  122. vector_bfgs_state_t *state = (vector_bfgs_state_t *) vstate;
  123. state->iter = 0;
  124. state->step = step_size;
  125. state->max_step = step_size;
  126. state->tol = tol;
  127. GSL_MULTIMIN_FN_EVAL_F_DF (fdf, x, f, gradient);
  128. /* Use the gradient as the initial direction */
  129. gsl_vector_memcpy (state->x0, x);
  130. gsl_vector_memcpy (state->p, gradient);
  131. gsl_vector_memcpy (state->g0, gradient);
  132. {
  133. double gnorm = gsl_blas_dnrm2 (gradient);
  134. state->pnorm = gnorm;
  135. state->g0norm = gnorm;
  136. }
  137. return GSL_SUCCESS;
  138. }
  139. static void
  140. vector_bfgs_free (void *vstate)
  141. {
  142. vector_bfgs_state_t *state = (vector_bfgs_state_t *) vstate;
  143. gsl_vector_free (state->dg0);
  144. gsl_vector_free (state->dx0);
  145. gsl_vector_free (state->g0);
  146. gsl_vector_free (state->x0);
  147. gsl_vector_free (state->p);
  148. gsl_vector_free (state->x2);
  149. gsl_vector_free (state->dx1);
  150. gsl_vector_free (state->x1);
  151. }
  152. static int
  153. vector_bfgs_restart (void *vstate)
  154. {
  155. vector_bfgs_state_t *state = (vector_bfgs_state_t *) vstate;
  156. state->iter = 0;
  157. return GSL_SUCCESS;
  158. }
  159. static int
  160. vector_bfgs_iterate (void *vstate, gsl_multimin_function_fdf * fdf,
  161. gsl_vector * x, double *f,
  162. gsl_vector * gradient, gsl_vector * dx)
  163. {
  164. vector_bfgs_state_t *state = (vector_bfgs_state_t *) vstate;
  165. gsl_vector *x1 = state->x1;
  166. gsl_vector *dx1 = state->dx1;
  167. gsl_vector *x2 = state->x2;
  168. gsl_vector *p = state->p;
  169. gsl_vector *g0 = state->g0;
  170. gsl_vector *x0 = state->x0;
  171. double pnorm = state->pnorm;
  172. double g0norm = state->g0norm;
  173. double fa = *f, fb, fc;
  174. double dir;
  175. double stepa = 0.0, stepb, stepc = state->step, tol = state->tol;
  176. double g1norm;
  177. double pg;
  178. if (pnorm == 0.0 || g0norm == 0.0)
  179. {
  180. gsl_vector_set_zero (dx);
  181. return GSL_ENOPROG;
  182. }
  183. /* Determine which direction is downhill, +p or -p */
  184. gsl_blas_ddot (p, gradient, &pg);
  185. dir = (pg >= 0.0) ? +1.0 : -1.0;
  186. /* Compute new trial point at x_c= x - step * p, where p is the
  187. current direction */
  188. take_step (x, p, stepc, dir / pnorm, x1, dx);
  189. /* Evaluate function and gradient at new point xc */
  190. fc = GSL_MULTIMIN_FN_EVAL_F (fdf, x1);
  191. if (fc < fa)
  192. {
  193. /* Success, reduced the function value */
  194. state->step = stepc * 2.0;
  195. *f = fc;
  196. gsl_vector_memcpy (x, x1);
  197. GSL_MULTIMIN_FN_EVAL_DF (fdf, x1, gradient);
  198. return GSL_SUCCESS;
  199. }
  200. #ifdef DEBUG
  201. printf ("got stepc = %g fc = %g\n", stepc, fc);
  202. #endif
  203. /* Do a line minimisation in the region (xa,fa) (xc,fc) to find an
  204. intermediate (xb,fb) satisifying fa > fb < fc. Choose an initial
  205. xb based on parabolic interpolation */
  206. intermediate_point (fdf, x, p, dir / pnorm, pg,
  207. stepa, stepc, fa, fc, x1, dx1, gradient, &stepb, &fb);
  208. if (stepb == 0.0)
  209. {
  210. return GSL_ENOPROG;
  211. }
  212. minimize (fdf, x, p, dir / pnorm,
  213. stepa, stepb, stepc, fa, fb, fc, tol,
  214. x1, dx1, x2, dx, gradient, &(state->step), f, &g1norm);
  215. gsl_vector_memcpy (x, x2);
  216. /* Choose a new direction for the next step */
  217. state->iter = (state->iter + 1) % x->size;
  218. if (state->iter == 0)
  219. {
  220. gsl_vector_memcpy (p, gradient);
  221. state->pnorm = g1norm;
  222. }
  223. else
  224. {
  225. /* This is the BFGS update: */
  226. /* p' = g1 - A dx - B dg */
  227. /* A = - (1+ dg.dg/dx.dg) B + dg.g/dx.dg */
  228. /* B = dx.g/dx.dg */
  229. gsl_vector *dx0 = state->dx0;
  230. gsl_vector *dg0 = state->dg0;
  231. double dxg, dgg, dxdg, dgnorm, A, B;
  232. /* dx0 = x - x0 */
  233. gsl_vector_memcpy (dx0, x);
  234. gsl_blas_daxpy (-1.0, x0, dx0);
  235. /* dg0 = g - g0 */
  236. gsl_vector_memcpy (dg0, gradient);
  237. gsl_blas_daxpy (-1.0, g0, dg0);
  238. gsl_blas_ddot (dx0, gradient, &dxg);
  239. gsl_blas_ddot (dg0, gradient, &dgg);
  240. gsl_blas_ddot (dx0, dg0, &dxdg);
  241. dgnorm = gsl_blas_dnrm2 (dg0);
  242. if (dxdg != 0)
  243. {
  244. B = dxg / dxdg;
  245. A = -(1.0 + dgnorm * dgnorm / dxdg) * B + dgg / dxdg;
  246. }
  247. else
  248. {
  249. B = 0;
  250. A = 0;
  251. }
  252. gsl_vector_memcpy (p, gradient);
  253. gsl_blas_daxpy (-A, dx0, p);
  254. gsl_blas_daxpy (-B, dg0, p);
  255. state->pnorm = gsl_blas_dnrm2 (p);
  256. }
  257. gsl_vector_memcpy (g0, gradient);
  258. gsl_vector_memcpy (x0, x);
  259. state->g0norm = gsl_blas_dnrm2 (g0);
  260. #ifdef DEBUG
  261. printf ("updated directions\n");
  262. printf ("p: ");
  263. gsl_vector_fprintf (stdout, p, "%g");
  264. printf ("g: ");
  265. gsl_vector_fprintf (stdout, gradient, "%g");
  266. #endif
  267. return GSL_SUCCESS;
  268. }
  269. static const gsl_multimin_fdfminimizer_type vector_bfgs_type = {
  270. "vector_bfgs", /* name */
  271. sizeof (vector_bfgs_state_t),
  272. &vector_bfgs_alloc,
  273. &vector_bfgs_set,
  274. &vector_bfgs_iterate,
  275. &vector_bfgs_restart,
  276. &vector_bfgs_free
  277. };
  278. const gsl_multimin_fdfminimizer_type
  279. * gsl_multimin_fdfminimizer_vector_bfgs = &vector_bfgs_type;