1 /* Copyright (c) 2007-2014 Massachusetts Institute of Technology
3 * Permission is hereby granted, free of charge, to any person obtaining
4 * a copy of this software and associated documentation files (the
5 * "Software"), to deal in the Software without restriction, including
6 * without limitation the rights to use, copy, modify, merge, publish,
7 * distribute, sublicense, and/or sell copies of the Software, and to
8 * permit persons to whom the Software is furnished to do so, subject to
9 * the following conditions:
11 * The above copyright notice and this permission notice shall be
12 * included in all copies or substantial portions of the Software.
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
15 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
16 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
17 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
18 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
19 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
20 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
27 #include "nlopt-internal.h"
29 /*********************************************************************/
32 static int my_isnan(double x) { return x != x; }
33 # define isnan my_isnan
36 /*********************************************************************/
55 #include "neldermead.h"
62 /*********************************************************************/
64 static double f_bound(int n, const double *x, void *data_)
67 nlopt_opt data = (nlopt_opt) data_;
70 /* some methods do not support bound constraints, but support
71 discontinuous objectives so we can just return Inf for invalid x */
72 for (i = 0; i < n; ++i)
73 if (x[i] < data->lb[i] || x[i] > data->ub[i])
76 f = data->f((unsigned) n, x, NULL, data->f_data);
77 return (isnan(f) || nlopt_isinf(f) ? HUGE_VAL : f);
80 static double f_noderiv(int n, const double *x, void *data_)
82 nlopt_opt data = (nlopt_opt) data_;
83 return data->f((unsigned) n, x, NULL, data->f_data);
86 static double f_direct(int n, const double *x, int *undefined, void *data_)
88 nlopt_opt data = (nlopt_opt) data_;
89 double *work = (double*) data->work;
92 f = data->f((unsigned) n, x, NULL, data->f_data);
93 *undefined = isnan(f) || nlopt_isinf(f);
94 if (nlopt_get_force_stop(data)) return f;
95 for (i = 0; i < data->m && !*undefined; ++i) {
96 nlopt_eval_constraint(work, NULL, data->fc+i, (unsigned) n, x);
97 if (nlopt_get_force_stop(data)) return f;
98 for (j = 0; j < data->fc[i].m; ++j)
105 /*********************************************************************/
107 /* get min(dx) for algorithms requiring a scalar initial step size */
108 static nlopt_result initial_step(nlopt_opt opt, const double *x, double *step)
110 unsigned freedx = 0, i;
114 if (nlopt_set_default_initial_step(opt, x) != NLOPT_SUCCESS)
115 return NLOPT_OUT_OF_MEMORY;
119 for (i = 0; i < opt->n; ++i)
120 if (*step > fabs(opt->dx[i]))
121 *step = fabs(opt->dx[i]);
123 if (freedx) { free(opt->dx); opt->dx = NULL; }
124 return NLOPT_SUCCESS;
127 /*********************************************************************/
129 /* return true if [lb,ub] is finite in every dimension (n dimensions) */
130 static int finite_domain(unsigned n, const double *lb, const double *ub)
133 for (i = 0; i < n; ++i)
134 if (nlopt_isinf(ub[i] - lb[i])) return 0;
138 /*********************************************************************/
139 /* wrapper functions, only for derivative-free methods, that
140 eliminate dimensions with lb == ub. (The gradient-based methods
141 should handle this case directly, since they operate on much
142 larger vectors where I am loathe to make copies unnecessarily.) */
148 unsigned n; /* true dimension */
149 double *x; /* scratch vector of length n */
150 double *grad; /* optional scratch vector of length n */
151 const double *lb, *ub; /* bounds, of length n */
154 static void *elimdim_makedata(nlopt_func f, nlopt_mfunc mf, void *f_data,
155 unsigned n, double *x, const double *lb,
156 const double *ub, double *grad)
158 elimdim_data *d = (elimdim_data *) malloc(sizeof(elimdim_data));
160 d->f = f; d->mf = mf; d->f_data = f_data; d->n = n; d->x = x;
161 d->lb = lb; d->ub = ub;
166 static double elimdim_func(unsigned n0, const double *x0, double *grad, void *d_)
168 elimdim_data *d = (elimdim_data *) d_;
170 const double *lb = d->lb, *ub = d->ub;
172 unsigned n = d->n, i, j;
174 (void) n0; /* unused */
175 for (i = j = 0; i < n; ++i) {
178 else /* assert: j < n0 */
181 val = d->f(n, x, grad ? d->grad : NULL, d->f_data);
183 /* assert: d->grad != NULL */
184 for (i = j = 0; i < n; ++i)
186 grad[j++] = d->grad[i];
192 static void elimdim_mfunc(unsigned m, double *result,
193 unsigned n0, const double *x0, double *grad, void *d_)
195 elimdim_data *d = (elimdim_data *) d_;
197 const double *lb = d->lb, *ub = d->ub;
198 unsigned n = d->n, i, j;
200 (void) n0; /* unused */
201 (void) grad; /* assert: grad == NULL */
202 for (i = j = 0; i < n; ++i) {
205 else /* assert: j < n0 */
208 d->mf(m, result, n, x, NULL, d->f_data);
211 /* compute the eliminated dimension: number of dims with lb[i] != ub[i] */
212 static unsigned elimdim_dimension(unsigned n, const double *lb, const double *ub)
215 for (i = 0; i < n; ++i) n0 += lb[i] != ub[i] ? 1U : 0;
219 /* modify v to "shrunk" version, with dimensions for lb[i] == ub[i] elim'ed */
220 static void elimdim_shrink(unsigned n, double *v,
221 const double *lb, const double *ub)
225 for (i = j = 0; i < n; ++i)
230 /* inverse of elimdim_shrink */
231 static void elimdim_expand(unsigned n, double *v,
232 const double *lb, const double *ub)
236 j = elimdim_dimension(n, lb, ub) - 1;
237 for (i = n - 1; i > 0; --i) {
248 /* given opt, create a new opt with equal-constraint dimensions eliminated */
249 static nlopt_opt elimdim_create(nlopt_opt opt)
251 nlopt_opt opt0 = nlopt_copy(opt);
252 double *x, *grad = NULL;
255 if (!opt0) return NULL;
256 x = (double *) malloc(sizeof(double) * opt->n);
257 if (opt->n && !x) { nlopt_destroy(opt0); return NULL; }
259 if (opt->algorithm == NLOPT_GD_STOGO
260 || opt->algorithm == NLOPT_GD_STOGO_RAND) {
261 grad = (double *) malloc(sizeof(double) * opt->n);
262 if (opt->n && !grad) goto bad;
265 opt0->n = elimdim_dimension(opt->n, opt->lb, opt->ub);
266 elimdim_shrink(opt->n, opt0->lb, opt->lb, opt->ub);
267 elimdim_shrink(opt->n, opt0->ub, opt->lb, opt->ub);
268 elimdim_shrink(opt->n, opt0->xtol_abs, opt->lb, opt->ub);
269 elimdim_shrink(opt->n, opt0->dx, opt->lb, opt->ub);
271 opt0->munge_on_destroy = opt0->munge_on_copy = NULL;
273 opt0->f = elimdim_func;
274 opt0->f_data = elimdim_makedata(opt->f, NULL, opt->f_data,
275 opt->n, x, opt->lb, opt->ub, grad);
276 if (!opt0->f_data) goto bad;
278 for (i = 0; i < opt->m; ++i) {
279 opt0->fc[i].f = elimdim_func;
280 opt0->fc[i].mf = elimdim_mfunc;
281 opt0->fc[i].f_data = elimdim_makedata(opt->fc[i].f, opt->fc[i].mf,
283 opt->n, x, opt->lb, opt->ub,
285 if (!opt0->fc[i].f_data) goto bad;
288 for (i = 0; i < opt->p; ++i) {
289 opt0->h[i].f = elimdim_func;
290 opt0->h[i].mf = elimdim_mfunc;
291 opt0->h[i].f_data = elimdim_makedata(opt->h[i].f, opt->h[i].mf,
293 opt->n, x, opt->lb, opt->ub,
295 if (!opt0->h[i].f_data) goto bad;
306 /* like nlopt_destroy, but also frees elimdim_data */
307 static void elimdim_destroy(nlopt_opt opt)
312 free(((elimdim_data*) opt->f_data)->x);
313 free(((elimdim_data*) opt->f_data)->grad);
314 free(opt->f_data); opt->f_data = NULL;
316 for (i = 0; i < opt->m; ++i) {
317 free(opt->fc[i].f_data);
318 opt->fc[i].f_data = NULL;
320 for (i = 0; i < opt->p; ++i) {
321 free(opt->h[i].f_data);
322 opt->h[i].f_data = NULL;
328 /* return whether to use elimdim wrapping. */
329 static int elimdim_wrapcheck(nlopt_opt opt)
332 if (elimdim_dimension(opt->n, opt->lb, opt->ub) == opt->n) return 0;
333 switch (opt->algorithm) {
334 case NLOPT_GN_DIRECT:
335 case NLOPT_GN_DIRECT_L:
336 case NLOPT_GN_DIRECT_L_RAND:
337 case NLOPT_GN_DIRECT_NOSCAL:
338 case NLOPT_GN_DIRECT_L_NOSCAL:
339 case NLOPT_GN_DIRECT_L_RAND_NOSCAL:
340 case NLOPT_GN_ORIG_DIRECT:
341 case NLOPT_GN_ORIG_DIRECT_L:
342 case NLOPT_GN_CRS2_LM:
343 case NLOPT_LN_PRAXIS:
344 case NLOPT_LN_COBYLA:
345 case NLOPT_LN_NEWUOA:
346 case NLOPT_LN_NEWUOA_BOUND:
347 case NLOPT_LN_BOBYQA:
348 case NLOPT_LN_NELDERMEAD:
353 case NLOPT_GD_STOGO_RAND:
360 /*********************************************************************/
362 #define POP(defaultpop) (opt->stochastic_population > 0 ? \
363 opt->stochastic_population : \
364 (nlopt_stochastic_population > 0 ? \
365 nlopt_stochastic_population : (defaultpop)))
367 /* unlike nlopt_optimize() below, only handles minimization case */
368 static nlopt_result nlopt_optimize_(nlopt_opt opt, double *x, double *minf)
370 const double *lb, *ub;
371 nlopt_algorithm algorithm;
372 nlopt_func f; void *f_data;
377 if (!opt || !x || !minf || !opt->f
378 || opt->maximize) RETURN_ERR(NLOPT_INVALID_ARGS, opt,
379 "NULL args to nlopt_optimize_");
381 /* reset stopping flag */
382 nlopt_set_force_stop(opt, 0);
383 opt->force_stop_child = NULL;
385 /* copy a few params to local vars for convenience */
387 ni = (int) n; /* most of the subroutines take "int" arg */
388 lb = opt->lb; ub = opt->ub;
389 algorithm = opt->algorithm;
390 f = opt->f; f_data = opt->f_data;
392 if (n == 0) { /* trivial case: no degrees of freedom */
393 *minf = opt->f(n, x, NULL, opt->f_data);
394 return NLOPT_SUCCESS;
399 /* make sure rand generator is inited */
400 nlopt_srand_time_default(); /* default is non-deterministic */
402 /* check bound constraints */
403 for (i = 0; i < n; ++i)
404 if (lb[i] > ub[i] || x[i] < lb[i] || x[i] > ub[i]) {
405 nlopt_set_errmsg(opt, "bounds %d fail %g <= %g <= %g",
406 i, lb[i], x[i], ub[i]);
407 return NLOPT_INVALID_ARGS;
411 stop.minf_max = opt->stopval;
412 stop.ftol_rel = opt->ftol_rel;
413 stop.ftol_abs = opt->ftol_abs;
414 stop.xtol_rel = opt->xtol_rel;
415 stop.xtol_abs = opt->xtol_abs;
417 stop.maxeval = opt->maxeval;
418 stop.maxtime = opt->maxtime;
419 stop.start = nlopt_seconds();
420 stop.force_stop = &(opt->force_stop);
421 stop.stop_msg = &(opt->errmsg);
424 case NLOPT_GN_DIRECT:
425 case NLOPT_GN_DIRECT_L:
426 case NLOPT_GN_DIRECT_L_RAND:
427 if (!finite_domain(n, lb, ub))
428 RETURN_ERR(NLOPT_INVALID_ARGS, opt,
429 "finite domain required for global algorithm");
430 return cdirect(ni, f, f_data,
431 lb, ub, x, minf, &stop, 0.0,
432 (algorithm != NLOPT_GN_DIRECT)
433 + 3 * (algorithm == NLOPT_GN_DIRECT_L_RAND
434 ? 2 : (algorithm != NLOPT_GN_DIRECT))
435 + 9 * (algorithm == NLOPT_GN_DIRECT_L_RAND
436 ? 1 : (algorithm != NLOPT_GN_DIRECT)));
438 case NLOPT_GN_DIRECT_NOSCAL:
439 case NLOPT_GN_DIRECT_L_NOSCAL:
440 case NLOPT_GN_DIRECT_L_RAND_NOSCAL:
441 if (!finite_domain(n, lb, ub))
442 RETURN_ERR(NLOPT_INVALID_ARGS, opt,
443 "finite domain required for global algorithm");
444 return cdirect_unscaled(ni, f, f_data, lb, ub, x, minf,
446 (algorithm != NLOPT_GN_DIRECT)
447 + 3 * (algorithm == NLOPT_GN_DIRECT_L_RAND ? 2 : (algorithm != NLOPT_GN_DIRECT))
448 + 9 * (algorithm == NLOPT_GN_DIRECT_L_RAND ? 1 : (algorithm != NLOPT_GN_DIRECT)));
450 case NLOPT_GN_ORIG_DIRECT:
451 case NLOPT_GN_ORIG_DIRECT_L: {
452 direct_return_code dret;
453 if (!finite_domain(n, lb, ub))
454 RETURN_ERR(NLOPT_INVALID_ARGS, opt,
455 "finite domain required for global algorithm");
456 opt->work = malloc(sizeof(double) *
457 nlopt_max_constraint_dim(opt->m,
459 if (!opt->work) return NLOPT_OUT_OF_MEMORY;
460 dret = direct_optimize(f_direct, opt, ni, lb, ub, x, minf,
462 stop.start, stop.maxtime,
464 pow(stop.xtol_rel, (double) n), -1.0,
468 algorithm == NLOPT_GN_ORIG_DIRECT
471 free(opt->work); opt->work = NULL;
473 case DIRECT_INVALID_BOUNDS:
474 RETURN_ERR(NLOPT_INVALID_ARGS, opt,
475 "invalid bounds for DIRECT");
476 case DIRECT_MAXFEVAL_TOOBIG:
477 RETURN_ERR(NLOPT_INVALID_ARGS, opt,
478 "maxeval too big for DIRECT");
479 case DIRECT_INVALID_ARGS:
480 return NLOPT_INVALID_ARGS;
481 case DIRECT_INIT_FAILED:
482 RETURN_ERR(NLOPT_FAILURE, opt,
483 "init failed for DIRECT");
484 case DIRECT_SAMPLEPOINTS_FAILED:
485 RETURN_ERR(NLOPT_FAILURE, opt,
486 "sample-points failed for DIRECT");
487 case DIRECT_SAMPLE_FAILED:
488 RETURN_ERR(NLOPT_FAILURE, opt,
489 "sample failed for DIRECT");
490 case DIRECT_MAXFEVAL_EXCEEDED:
491 case DIRECT_MAXITER_EXCEEDED:
492 return NLOPT_MAXEVAL_REACHED;
493 case DIRECT_MAXTIME_EXCEEDED:
494 return NLOPT_MAXTIME_REACHED;
495 case DIRECT_GLOBAL_FOUND:
496 return NLOPT_MINF_MAX_REACHED;
498 case DIRECT_SIGMATOL:
499 return NLOPT_XTOL_REACHED;
500 case DIRECT_OUT_OF_MEMORY:
501 return NLOPT_OUT_OF_MEMORY;
502 case DIRECT_FORCED_STOP:
503 return NLOPT_FORCED_STOP;
509 case NLOPT_GD_STOGO_RAND:
511 if (!finite_domain(n, lb, ub))
512 RETURN_ERR(NLOPT_INVALID_ARGS, opt,
513 "finite domain required for global algorithm");
514 if (!stogo_minimize(ni, f, f_data, x, minf, lb, ub, &stop,
515 algorithm == NLOPT_GD_STOGO
516 ? 0 : (int) POP(2*n)))
517 return NLOPT_FAILURE;
520 return NLOPT_INVALID_ARGS;
524 /* lacking a free/open-source license, we no longer use
525 Rowan's code, and instead use by "sbplx" re-implementation */
526 case NLOPT_LN_SUBPLEX: {
527 int iret, freedx = 0;
530 if (nlopt_set_default_initial_step(opt, x) != NLOPT_SUCCESS)
531 return NLOPT_OUT_OF_MEMORY;
533 iret = nlopt_subplex(f_bound, minf, x, n, opt, &stop, opt->dx);
534 if (freedx) { free(opt->dx); opt->dx = NULL; }
536 case -2: return NLOPT_INVALID_ARGS;
537 case -20: return NLOPT_FORCED_STOP;
538 case -10: return NLOPT_MAXTIME_REACHED;
539 case -1: return NLOPT_MAXEVAL_REACHED;
540 case 0: return NLOPT_XTOL_REACHED;
541 case 1: return NLOPT_SUCCESS;
542 case 2: return NLOPT_MINF_MAX_REACHED;
543 case 20: return NLOPT_FTOL_REACHED;
544 case -200: return NLOPT_OUT_OF_MEMORY;
545 default: return NLOPT_FAILURE; /* unknown return code */
551 case NLOPT_LN_PRAXIS: {
553 if (initial_step(opt, x, &step) != NLOPT_SUCCESS)
554 return NLOPT_OUT_OF_MEMORY;
555 return praxis_(0.0, DBL_EPSILON,
556 step, ni, x, f_bound, opt, &stop, minf);
560 return luksan_plis(ni, f, f_data, lb, ub, x, minf,
561 &stop, opt->vector_storage);
565 return luksan_plip(ni, f, f_data, lb, ub, x, minf,
566 &stop, opt->vector_storage,
567 algorithm == NLOPT_LD_VAR1 ? 1 : 2);
569 case NLOPT_LD_TNEWTON:
570 case NLOPT_LD_TNEWTON_RESTART:
571 case NLOPT_LD_TNEWTON_PRECOND:
572 case NLOPT_LD_TNEWTON_PRECOND_RESTART:
573 return luksan_pnet(ni, f, f_data, lb, ub, x, minf,
574 &stop, opt->vector_storage,
575 1 + (algorithm - NLOPT_LD_TNEWTON) % 2,
576 1 + (algorithm - NLOPT_LD_TNEWTON) / 2);
578 case NLOPT_GN_CRS2_LM:
579 if (!finite_domain(n, lb, ub))
580 RETURN_ERR(NLOPT_INVALID_ARGS, opt,
581 "finite domain required for global algorithm");
582 return crs_minimize(ni, f, f_data, lb, ub, x, minf, &stop,
586 case NLOPT_G_MLSL_LDS:
589 case NLOPT_GN_MLSL_LDS:
590 case NLOPT_GD_MLSL_LDS: {
591 nlopt_opt local_opt = opt->local_opt;
593 if (!finite_domain(n, lb, ub))
594 RETURN_ERR(NLOPT_INVALID_ARGS, opt,
595 "finite domain required for global algorithm");
596 if (!local_opt && (algorithm == NLOPT_G_MLSL
597 || algorithm == NLOPT_G_MLSL_LDS))
598 RETURN_ERR(NLOPT_INVALID_ARGS, opt,
599 "local optimizer must be specified for G_MLSL");
600 if (!local_opt) { /* default */
601 nlopt_algorithm local_alg = (algorithm == NLOPT_GN_MLSL ||
602 algorithm == NLOPT_GN_MLSL_LDS)
603 ? nlopt_local_search_alg_nonderiv
604 : nlopt_local_search_alg_deriv;
605 /* don't call MLSL recursively! */
606 if (local_alg >= NLOPT_GN_MLSL
607 && local_alg <= NLOPT_GD_MLSL_LDS)
608 local_alg = (algorithm == NLOPT_GN_MLSL ||
609 algorithm == NLOPT_GN_MLSL_LDS)
610 ? NLOPT_LN_COBYLA : NLOPT_LD_MMA;
611 local_opt = nlopt_create(local_alg, n);
612 if (!local_opt) RETURN_ERR(NLOPT_FAILURE, opt,
613 "failed to create local_opt");
614 nlopt_set_ftol_rel(local_opt, opt->ftol_rel);
615 nlopt_set_ftol_abs(local_opt, opt->ftol_abs);
616 nlopt_set_xtol_rel(local_opt, opt->xtol_rel);
617 nlopt_set_xtol_abs(local_opt, opt->xtol_abs);
618 nlopt_set_maxeval(local_opt, nlopt_local_search_maxeval);
620 if (opt->dx) nlopt_set_initial_step(local_opt, opt->dx);
621 for (i = 0; i < n && stop.xtol_abs[i] > 0; ++i) ;
622 if (local_opt->ftol_rel <= 0 && local_opt->ftol_abs <= 0 &&
623 local_opt->xtol_rel <= 0 && i < n) {
624 /* it is not sensible to call MLSL without *some*
625 nonzero tolerance for the local search */
626 nlopt_set_ftol_rel(local_opt, 1e-15);
627 nlopt_set_xtol_rel(local_opt, 1e-7);
629 opt->force_stop_child = local_opt;
630 ret = mlsl_minimize(ni, f, f_data, lb, ub, x, minf, &stop,
631 local_opt, (int) POP(0),
632 algorithm >= NLOPT_GN_MLSL_LDS &&
633 algorithm != NLOPT_G_MLSL);
634 opt->force_stop_child = NULL;
635 if (!opt->local_opt) nlopt_destroy(local_opt);
639 case NLOPT_LD_MMA: case NLOPT_LD_CCSAQ: {
642 #define LO(param, def) (opt->local_opt ? opt->local_opt->param : (def))
643 dual_opt = nlopt_create(LO(algorithm,
644 nlopt_local_search_alg_deriv),
645 nlopt_count_constraints(opt->m,
647 if (!dual_opt) RETURN_ERR(NLOPT_FAILURE, opt,
648 "failed creating dual optimizer");
649 nlopt_set_ftol_rel(dual_opt, LO(ftol_rel, 1e-14));
650 nlopt_set_ftol_abs(dual_opt, LO(ftol_abs, 0.0));
651 nlopt_set_maxeval(dual_opt, LO(maxeval, 100000));
654 if (algorithm == NLOPT_LD_MMA)
655 ret = mma_minimize(n, f, f_data, opt->m, opt->fc,
656 lb, ub, x, minf, &stop, dual_opt);
658 ret = ccsa_quadratic_minimize(
659 n, f, f_data, opt->m, opt->fc, opt->pre,
660 lb, ub, x, minf, &stop, dual_opt);
661 nlopt_destroy(dual_opt);
665 case NLOPT_LN_COBYLA: {
670 if (nlopt_set_default_initial_step(opt, x) != NLOPT_SUCCESS)
671 RETURN_ERR(NLOPT_OUT_OF_MEMORY, opt,
672 "failed to allocate initial step");
674 ret = cobyla_minimize(n, f, f_data,
677 lb, ub, x, minf, &stop,
679 if (freedx) { free(opt->dx); opt->dx = NULL; }
683 case NLOPT_LN_NEWUOA: {
685 if (initial_step(opt, x, &step) != NLOPT_SUCCESS)
686 RETURN_ERR(NLOPT_OUT_OF_MEMORY, opt,
687 "failed to allocate initial step");
688 return newuoa(ni, 2*n+1, x, 0, 0, step,
689 &stop, minf, f_noderiv, opt);
692 case NLOPT_LN_NEWUOA_BOUND: {
694 if (initial_step(opt, x, &step) != NLOPT_SUCCESS)
695 RETURN_ERR(NLOPT_OUT_OF_MEMORY, opt,
696 "failed to allocate initial step");
697 return newuoa(ni, 2*n+1, x, lb, ub, step,
698 &stop, minf, f_noderiv, opt);
701 case NLOPT_LN_BOBYQA: {
706 if (nlopt_set_default_initial_step(opt, x) != NLOPT_SUCCESS)
707 RETURN_ERR(NLOPT_OUT_OF_MEMORY, opt,
708 "failed to allocate initial step");
710 ret = bobyqa(ni, 2*n+1, x, lb, ub, opt->dx,
711 &stop, minf, opt->f, opt->f_data);
712 if (freedx) { free(opt->dx); opt->dx = NULL; }
716 case NLOPT_LN_NELDERMEAD:
723 if (nlopt_set_default_initial_step(opt, x) != NLOPT_SUCCESS)
724 RETURN_ERR(NLOPT_OUT_OF_MEMORY, opt,
725 "failed to allocate initial step");
727 if (algorithm == NLOPT_LN_NELDERMEAD)
728 ret=nldrmd_minimize(ni,f,f_data,lb,ub,x,minf,opt->dx,&stop);
730 ret=sbplx_minimize(ni,f,f_data,lb,ub,x,minf,opt->dx,&stop);
731 if (freedx) { free(opt->dx); opt->dx = NULL; }
736 case NLOPT_AUGLAG_EQ:
737 case NLOPT_LN_AUGLAG:
738 case NLOPT_LN_AUGLAG_EQ:
739 case NLOPT_LD_AUGLAG:
740 case NLOPT_LD_AUGLAG_EQ: {
741 nlopt_opt local_opt = opt->local_opt;
743 if ((algorithm == NLOPT_AUGLAG || algorithm == NLOPT_AUGLAG_EQ)
745 RETURN_ERR(NLOPT_INVALID_ARGS, opt,
746 "local optimizer must be specified for AUGLAG");
747 if (!local_opt) { /* default */
748 local_opt = nlopt_create(
749 algorithm == NLOPT_LN_AUGLAG ||
750 algorithm == NLOPT_LN_AUGLAG_EQ
751 ? nlopt_local_search_alg_nonderiv
752 : nlopt_local_search_alg_deriv, n);
753 if (!local_opt) RETURN_ERR(NLOPT_FAILURE, opt,
754 "failed to create local_opt");
755 nlopt_set_ftol_rel(local_opt, opt->ftol_rel);
756 nlopt_set_ftol_abs(local_opt, opt->ftol_abs);
757 nlopt_set_xtol_rel(local_opt, opt->xtol_rel);
758 nlopt_set_xtol_abs(local_opt, opt->xtol_abs);
759 nlopt_set_maxeval(local_opt, nlopt_local_search_maxeval);
761 if (opt->dx) nlopt_set_initial_step(local_opt, opt->dx);
762 opt->force_stop_child = local_opt;
763 ret = auglag_minimize(ni, f, f_data,
766 lb, ub, x, minf, &stop,
768 algorithm == NLOPT_AUGLAG_EQ
769 || algorithm == NLOPT_LN_AUGLAG_EQ
770 || algorithm == NLOPT_LD_AUGLAG_EQ);
771 opt->force_stop_child = NULL;
772 if (!opt->local_opt) nlopt_destroy(local_opt);
777 if (!finite_domain(n, lb, ub))
778 RETURN_ERR(NLOPT_INVALID_ARGS, opt,
779 "finite domain required for global algorithm");
780 return isres_minimize(ni, f, f_data,
781 (int) (opt->m), opt->fc,
782 (int) (opt->p), opt->h,
783 lb, ub, x, minf, &stop,
787 if (!finite_domain(n, lb, ub))
788 RETURN_ERR(NLOPT_INVALID_ARGS, opt,
789 "finite domain required for global algorithm");
790 return chevolutionarystrategy(n, f, f_data,
791 lb, ub, x, minf, &stop,
793 (unsigned) (POP(0)*1.5));
796 return nlopt_slsqp(n, f, f_data,
799 lb, ub, x, minf, &stop);
802 return NLOPT_INVALID_ARGS;
805 return NLOPT_SUCCESS; /* never reached */
808 /*********************************************************************/
816 /* wrapper for maximizing: just flip the sign of f and grad */
817 static double f_max(unsigned n, const double *x, double *grad, void *data)
819 f_max_data *d = (f_max_data *) data;
820 double val = d->f(n, x, grad, d->f_data);
823 for (i = 0; i < n; ++i)
829 static void pre_max(unsigned n, const double *x, const double *v,
830 double *vpre, void *data)
832 f_max_data *d = (f_max_data *) data;
834 d->pre(n, x, v, vpre, d->f_data);
835 for (i = 0; i < n; ++i) vpre[i] = -vpre[i];
839 NLOPT_STDCALL nlopt_optimize(nlopt_opt opt, double *x, double *opt_f)
841 nlopt_func f; void *f_data; nlopt_precond pre;
846 nlopt_unset_errmsg(opt);
847 if (!opt || !opt_f || !opt->f) RETURN_ERR(NLOPT_INVALID_ARGS, opt,
848 "NULL args to nlopt_optimize");
849 f = opt->f; f_data = opt->f_data; pre = opt->pre;
851 /* for maximizing, just minimize the f_max wrapper, which
852 flips the sign of everything */
853 if ((maximize = opt->maximize)) {
854 fmd.f = f; fmd.f_data = f_data; fmd.pre = pre;
855 opt->f = f_max; opt->f_data = &fmd;
856 if (opt->pre) opt->pre = pre_max;
857 opt->stopval = -opt->stopval;
861 { /* possibly eliminate lb == ub dimensions for some algorithms */
862 nlopt_opt elim_opt = opt;
863 if (elimdim_wrapcheck(opt)) {
864 elim_opt = elimdim_create(opt);
866 nlopt_set_errmsg(opt, "failure allocating elim_opt");
867 ret = NLOPT_OUT_OF_MEMORY;
870 elimdim_shrink(opt->n, x, opt->lb, opt->ub);
873 ret = nlopt_optimize_(elim_opt, x, opt_f);
875 if (elim_opt != opt) {
876 elimdim_destroy(elim_opt);
877 elimdim_expand(opt->n, x, opt->lb, opt->ub);
882 if (maximize) { /* restore original signs */
883 opt->maximize = maximize;
884 opt->stopval = -opt->stopval;
885 opt->f = f; opt->f_data = f_data; opt->pre = pre;
892 /*********************************************************************/
894 nlopt_result nlopt_optimize_limited(nlopt_opt opt, double *x, double *minf,
895 int maxeval, double maxtime)
901 nlopt_unset_errmsg(opt);
903 if (!opt) RETURN_ERR(NLOPT_INVALID_ARGS, opt, "NULL opt arg");
905 save_maxeval = nlopt_get_maxeval(opt);
906 save_maxtime = nlopt_get_maxtime(opt);
908 /* override opt limits if maxeval and/or maxtime are more stringent */
909 if (save_maxeval <= 0 || (maxeval > 0 && maxeval < save_maxeval))
910 nlopt_set_maxeval(opt, maxeval);
911 if (save_maxtime <= 0 || (maxtime > 0 && maxtime < save_maxtime))
912 nlopt_set_maxtime(opt, maxtime);
914 ret = nlopt_optimize(opt, x, minf);
916 nlopt_set_maxeval(opt, save_maxeval);
917 nlopt_set_maxtime(opt, save_maxtime);
922 /*********************************************************************/