1 /* Copyright (c) 2007-2010 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 /*********************************************************************/
48 # include "l-bfgs-b.h"
59 #include "neldermead.h"
65 /*********************************************************************/
67 static double f_bound(int n, const double *x, void *data_)
70 nlopt_opt data = (nlopt_opt) data_;
73 /* some methods do not support bound constraints, but support
74 discontinuous objectives so we can just return Inf for invalid x */
75 for (i = 0; i < n; ++i)
76 if (x[i] < data->lb[i] || x[i] > data->ub[i])
79 f = data->f((unsigned) n, x, NULL, data->f_data);
80 return (isnan(f) || nlopt_isinf(f) ? HUGE_VAL : f);
83 static double f_noderiv(int n, const double *x, void *data_)
85 nlopt_opt data = (nlopt_opt) data_;
86 return data->f((unsigned) n, x, NULL, data->f_data);
89 static double f_direct(int n, const double *x, int *undefined, void *data_)
91 nlopt_opt data = (nlopt_opt) data_;
94 f = data->f((unsigned) n, x, NULL, data->f_data);
95 *undefined = isnan(f) || nlopt_isinf(f);
96 if (nlopt_get_force_stop(data)) return f;
97 for (i = 0; i < data->m && !*undefined; ++i) {
98 nlopt_eval_constraint(data->work, NULL, data->fc+i, (unsigned) n, x);
99 if (nlopt_get_force_stop(data)) return f;
100 for (j = 0; j < data->fc[i].m; ++j)
101 if (data->work[j] > 0)
107 /*********************************************************************/
109 /* get min(dx) for algorithms requiring a scalar initial step size */
110 static nlopt_result initial_step(nlopt_opt opt, const double *x, double *step)
112 unsigned freedx = 0, i;
116 if (nlopt_set_default_initial_step(opt, x) != NLOPT_SUCCESS)
117 return NLOPT_OUT_OF_MEMORY;
121 for (i = 0; i < opt->n; ++i)
122 if (*step > fabs(opt->dx[i]))
123 *step = fabs(opt->dx[i]);
125 if (freedx) { free(opt->dx); opt->dx = NULL; }
126 return NLOPT_SUCCESS;
129 /*********************************************************************/
131 /* return true if [lb,ub] is finite in every dimension (n dimensions) */
132 static int finite_domain(unsigned n, const double *lb, const double *ub)
135 for (i = 0; i < n; ++i)
136 if (nlopt_isinf(ub[i] - lb[i])) return 0;
140 /*********************************************************************/
141 /* wrapper functions, only for derivative-free methods, that
142 eliminate dimensions with lb == ub. (The gradient-based methods
143 should handle this case directly, since they operate on much
144 larger vectors where I am loathe to make copies unnecessarily.) */
150 unsigned n; /* true dimension */
151 double *x; /* scratch vector of length n */
152 const double *lb, *ub; /* bounds, of length n */
155 static void *elimdim_makedata(nlopt_func f, nlopt_mfunc mf, void *f_data,
156 unsigned n, double *x, const double *lb,
159 elimdim_data *d = (elimdim_data *) malloc(sizeof(elimdim_data));
161 d->f = f; d->mf = mf; d->f_data = f_data; d->n = n; d->x = x;
162 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;
171 unsigned n = d->n, i, j;
173 (void) n0; /* unused */
174 (void) grad; /* assert: grad == NULL */
175 for (i = j = 0; i < n; ++i) {
178 else /* assert: j < n0 */
181 return d->f(n, x, NULL, d->f_data);
185 static void elimdim_mfunc(unsigned m, double *result,
186 unsigned n0, const double *x0, double *grad, void *d_)
188 elimdim_data *d = (elimdim_data *) d_;
190 const double *lb = d->lb, *ub = d->ub;
191 unsigned n = d->n, i, j;
193 (void) n0; /* unused */
194 (void) grad; /* assert: grad == NULL */
195 for (i = j = 0; i < n; ++i) {
198 else /* assert: j < n0 */
201 d->mf(m, result, n, x, NULL, d->f_data);
204 /* compute the eliminated dimension: number of dims with lb[i] != ub[i] */
205 static unsigned elimdim_dimension(unsigned n, const double *lb, const double *ub)
208 for (i = 0; i < n; ++i) n0 += lb[i] != ub[i] ? 1U : 0;
212 /* modify v to "shrunk" version, with dimensions for lb[i] == ub[i] elim'ed */
213 static void elimdim_shrink(unsigned n, double *v,
214 const double *lb, const double *ub)
218 for (i = j = 0; i < n; ++i)
223 /* inverse of elimdim_shrink */
224 static void elimdim_expand(unsigned n, double *v,
225 const double *lb, const double *ub)
229 j = elimdim_dimension(n, lb, ub) - 1;
230 for (i = n - 1; i > 0; --i) {
241 /* given opt, create a new opt with equal-constraint dimensions eliminated */
242 static nlopt_opt elimdim_create(nlopt_opt opt)
244 nlopt_opt opt0 = nlopt_copy(opt);
248 if (!opt0) return NULL;
249 x = (double *) malloc(sizeof(double) * opt->n);
250 if (opt->n && !x) { nlopt_destroy(opt0); return NULL; }
252 opt0->n = elimdim_dimension(opt->n, opt->lb, opt->ub);
253 elimdim_shrink(opt->n, opt0->lb, opt->lb, opt->ub);
254 elimdim_shrink(opt->n, opt0->ub, opt->lb, opt->ub);
255 elimdim_shrink(opt->n, opt0->xtol_abs, opt->lb, opt->ub);
256 elimdim_shrink(opt->n, opt0->dx, opt->lb, opt->ub);
258 opt0->munge_on_destroy = opt0->munge_on_copy = NULL;
260 opt0->f = elimdim_func;
261 opt0->f_data = elimdim_makedata(opt->f, NULL, opt->f_data,
262 opt->n, x, opt->lb, opt->ub);
263 if (!opt0->f_data) goto bad;
265 for (i = 0; i < opt->m; ++i) {
266 opt0->fc[i].f = elimdim_func;
267 opt0->fc[i].mf = elimdim_mfunc;
268 opt0->fc[i].f_data = elimdim_makedata(opt->fc[i].f, opt->fc[i].mf,
270 opt->n, x, opt->lb, opt->ub);
271 if (!opt0->fc[i].f_data) goto bad;
274 for (i = 0; i < opt->p; ++i) {
275 opt0->h[i].f = elimdim_func;
276 opt0->h[i].mf = elimdim_mfunc;
277 opt0->h[i].f_data = elimdim_makedata(opt->h[i].f, opt->h[i].mf,
279 opt->n, x, opt->lb, opt->ub);
280 if (!opt0->h[i].f_data) goto bad;
290 /* like nlopt_destroy, but also frees elimdim_data */
291 static void elimdim_destroy(nlopt_opt opt)
296 free(((elimdim_data*) opt->f_data)->x);
297 free(opt->f_data); opt->f_data = NULL;
299 for (i = 0; i < opt->m; ++i) {
300 free(opt->fc[i].f_data);
301 opt->fc[i].f_data = NULL;
303 for (i = 0; i < opt->p; ++i) {
304 free(opt->h[i].f_data);
305 opt->h[i].f_data = NULL;
311 /* return whether to use elimdim wrapping. */
312 static int elimdim_wrapcheck(nlopt_opt opt)
315 if (elimdim_dimension(opt->n, opt->lb, opt->ub) == opt->n) return 0;
316 switch (opt->algorithm) {
317 case NLOPT_GN_DIRECT:
318 case NLOPT_GN_DIRECT_L:
319 case NLOPT_GN_DIRECT_L_RAND:
320 case NLOPT_GN_DIRECT_NOSCAL:
321 case NLOPT_GN_DIRECT_L_NOSCAL:
322 case NLOPT_GN_DIRECT_L_RAND_NOSCAL:
323 case NLOPT_GN_ORIG_DIRECT:
324 case NLOPT_GN_ORIG_DIRECT_L:
325 case NLOPT_LN_PRAXIS:
326 case NLOPT_LN_COBYLA:
327 case NLOPT_LN_NEWUOA:
328 case NLOPT_LN_NEWUOA_BOUND:
329 case NLOPT_LN_BOBYQA:
330 case NLOPT_LN_NELDERMEAD:
339 /*********************************************************************/
341 #define POP(defaultpop) (opt->stochastic_population > 0 ? \
342 opt->stochastic_population : \
343 (nlopt_stochastic_population > 0 ? \
344 nlopt_stochastic_population : (defaultpop)))
346 /* unlike nlopt_optimize() below, only handles minimization case */
347 static nlopt_result nlopt_optimize_(nlopt_opt opt, double *x, double *minf)
349 const double *lb, *ub;
350 nlopt_algorithm algorithm;
351 nlopt_func f; void *f_data;
356 if (!opt || !x || !minf || !opt->f
357 || opt->maximize) return NLOPT_INVALID_ARGS;
359 /* reset stopping flag */
360 nlopt_set_force_stop(opt, 0);
361 opt->force_stop_child = NULL;
363 /* copy a few params to local vars for convenience */
365 ni = (int) n; /* most of the subroutines take "int" arg */
366 lb = opt->lb; ub = opt->ub;
367 algorithm = opt->algorithm;
368 f = opt->f; f_data = opt->f_data;
370 if (n == 0) { /* trivial case: no degrees of freedom */
371 *minf = opt->f(n, x, NULL, opt->f_data);
372 return NLOPT_SUCCESS;
377 /* make sure rand generator is inited */
378 nlopt_srand_time_default(); /* default is non-deterministic */
380 /* check bound constraints */
381 for (i = 0; i < n; ++i)
382 if (lb[i] > ub[i] || x[i] < lb[i] || x[i] > ub[i])
383 return NLOPT_INVALID_ARGS;
386 stop.minf_max = opt->stopval;
387 stop.ftol_rel = opt->ftol_rel;
388 stop.ftol_abs = opt->ftol_abs;
389 stop.xtol_rel = opt->xtol_rel;
390 stop.xtol_abs = opt->xtol_abs;
392 stop.maxeval = opt->maxeval;
393 stop.maxtime = opt->maxtime;
394 stop.start = nlopt_seconds();
395 stop.force_stop = &(opt->force_stop);
398 case NLOPT_GN_DIRECT:
399 case NLOPT_GN_DIRECT_L:
400 case NLOPT_GN_DIRECT_L_RAND:
401 if (!finite_domain(n, lb, ub)) return NLOPT_INVALID_ARGS;
402 return cdirect(ni, f, f_data,
403 lb, ub, x, minf, &stop, 0.0,
404 (algorithm != NLOPT_GN_DIRECT)
405 + 3 * (algorithm == NLOPT_GN_DIRECT_L_RAND
406 ? 2 : (algorithm != NLOPT_GN_DIRECT))
407 + 9 * (algorithm == NLOPT_GN_DIRECT_L_RAND
408 ? 1 : (algorithm != NLOPT_GN_DIRECT)));
410 case NLOPT_GN_DIRECT_NOSCAL:
411 case NLOPT_GN_DIRECT_L_NOSCAL:
412 case NLOPT_GN_DIRECT_L_RAND_NOSCAL:
413 if (!finite_domain(n, lb, ub)) return NLOPT_INVALID_ARGS;
414 return cdirect_unscaled(ni, f, f_data, lb, ub, x, minf,
416 (algorithm != NLOPT_GN_DIRECT)
417 + 3 * (algorithm == NLOPT_GN_DIRECT_L_RAND ? 2 : (algorithm != NLOPT_GN_DIRECT))
418 + 9 * (algorithm == NLOPT_GN_DIRECT_L_RAND ? 1 : (algorithm != NLOPT_GN_DIRECT)));
420 case NLOPT_GN_ORIG_DIRECT:
421 case NLOPT_GN_ORIG_DIRECT_L: {
422 direct_return_code dret;
423 if (!finite_domain(n, lb, ub)) return NLOPT_INVALID_ARGS;
424 opt->work = (double*) malloc(sizeof(double) *
425 nlopt_max_constraint_dim(opt->m,
427 if (!opt->work) return NLOPT_OUT_OF_MEMORY;
428 dret = direct_optimize(f_direct, opt, ni, lb, ub, x, minf,
430 stop.start, stop.maxtime,
432 pow(stop.xtol_rel, (double) n), -1.0,
436 algorithm == NLOPT_GN_ORIG_DIRECT
439 free(opt->work); opt->work = NULL;
441 case DIRECT_INVALID_BOUNDS:
442 case DIRECT_MAXFEVAL_TOOBIG:
443 case DIRECT_INVALID_ARGS:
444 return NLOPT_INVALID_ARGS;
445 case DIRECT_INIT_FAILED:
446 case DIRECT_SAMPLEPOINTS_FAILED:
447 case DIRECT_SAMPLE_FAILED:
448 return NLOPT_FAILURE;
449 case DIRECT_MAXFEVAL_EXCEEDED:
450 case DIRECT_MAXITER_EXCEEDED:
451 return NLOPT_MAXEVAL_REACHED;
452 case DIRECT_MAXTIME_EXCEEDED:
453 return NLOPT_MAXTIME_REACHED;
454 case DIRECT_GLOBAL_FOUND:
455 return NLOPT_MINF_MAX_REACHED;
457 case DIRECT_SIGMATOL:
458 return NLOPT_XTOL_REACHED;
459 case DIRECT_OUT_OF_MEMORY:
460 return NLOPT_OUT_OF_MEMORY;
461 case DIRECT_FORCED_STOP:
462 return NLOPT_FORCED_STOP;
468 case NLOPT_GD_STOGO_RAND:
470 if (!finite_domain(n, lb, ub)) return NLOPT_INVALID_ARGS;
471 if (!stogo_minimize(ni, f, f_data, x, minf, lb, ub, &stop,
472 algorithm == NLOPT_GD_STOGO
473 ? 0 : (int) POP(2*n)))
474 return NLOPT_FAILURE;
477 return NLOPT_INVALID_ARGS;
481 /* lacking a free/open-source license, we no longer use
482 Rowan's code, and instead use by "sbplx" re-implementation */
483 case NLOPT_LN_SUBPLEX: {
484 int iret, freedx = 0;
487 if (nlopt_set_default_initial_step(opt, x) != NLOPT_SUCCESS)
488 return NLOPT_OUT_OF_MEMORY;
490 iret = nlopt_subplex(f_bound, minf, x, n, opt, &stop, opt->dx);
491 if (freedx) { free(opt->dx); opt->dx = NULL; }
493 case -2: return NLOPT_INVALID_ARGS;
494 case -20: return NLOPT_FORCED_STOP;
495 case -10: return NLOPT_MAXTIME_REACHED;
496 case -1: return NLOPT_MAXEVAL_REACHED;
497 case 0: return NLOPT_XTOL_REACHED;
498 case 1: return NLOPT_SUCCESS;
499 case 2: return NLOPT_MINF_MAX_REACHED;
500 case 20: return NLOPT_FTOL_REACHED;
501 case -200: return NLOPT_OUT_OF_MEMORY;
502 default: return NLOPT_FAILURE; /* unknown return code */
508 case NLOPT_LN_PRAXIS: {
510 if (initial_step(opt, x, &step) != NLOPT_SUCCESS)
511 return NLOPT_OUT_OF_MEMORY;
512 return praxis_(0.0, DBL_EPSILON,
513 step, ni, x, f_bound, opt, &stop, minf);
517 case NLOPT_LD_LBFGS_NOCEDAL: {
518 int iret, *nbd = (int *) malloc(sizeof(int) * n);
519 if (!nbd) return NLOPT_OUT_OF_MEMORY;
520 for (i = 0; i < n; ++i) {
521 int linf = nlopt_isinf(lb[i]) && lb[i] < 0;
522 int uinf = nlopt_isinf(ub[i]) && ub[i] > 0;
523 nbd[i] = linf && uinf ? 0 : (uinf ? 1 : (linf ? 3 : 2));
525 iret = lbfgsb_minimize(ni, f, f_data, x, nbd, lb, ub,
526 ni < 5 ? ni : 5, 0.0, stop.ftol_rel,
527 stop.xtol_abs[0] > 0 ? stop.xtol_abs[0]
533 case -1: return NLOPT_INVALID_ARGS;
534 case -2: default: return NLOPT_FAILURE;
538 *minf = f(n, x, NULL, f_data);
540 case 5: return NLOPT_MAXEVAL_REACHED;
541 case 2: return NLOPT_XTOL_REACHED;
542 case 1: return NLOPT_FTOL_REACHED;
543 default: return NLOPT_SUCCESS;
551 return luksan_plis(ni, f, f_data, lb, ub, x, minf,
552 &stop, opt->vector_storage);
556 return luksan_plip(ni, f, f_data, lb, ub, x, minf,
557 &stop, opt->vector_storage,
558 algorithm == NLOPT_LD_VAR1 ? 1 : 2);
560 case NLOPT_LD_TNEWTON:
561 case NLOPT_LD_TNEWTON_RESTART:
562 case NLOPT_LD_TNEWTON_PRECOND:
563 case NLOPT_LD_TNEWTON_PRECOND_RESTART:
564 return luksan_pnet(ni, f, f_data, lb, ub, x, minf,
565 &stop, opt->vector_storage,
566 1 + (algorithm - NLOPT_LD_TNEWTON) % 2,
567 1 + (algorithm - NLOPT_LD_TNEWTON) / 2);
569 case NLOPT_GN_CRS2_LM:
570 if (!finite_domain(n, lb, ub)) return NLOPT_INVALID_ARGS;
571 return crs_minimize(ni, f, f_data, lb, ub, x, minf, &stop,
575 case NLOPT_G_MLSL_LDS:
578 case NLOPT_GN_MLSL_LDS:
579 case NLOPT_GD_MLSL_LDS: {
580 nlopt_opt local_opt = opt->local_opt;
582 if (!finite_domain(n, lb, ub)) return NLOPT_INVALID_ARGS;
583 if (!local_opt && (algorithm == NLOPT_G_MLSL
584 || algorithm == NLOPT_G_MLSL_LDS))
585 return NLOPT_INVALID_ARGS;
586 if (!local_opt) { /* default */
587 nlopt_algorithm local_alg = (algorithm == NLOPT_GN_MLSL ||
588 algorithm == NLOPT_GN_MLSL_LDS)
589 ? nlopt_local_search_alg_nonderiv
590 : nlopt_local_search_alg_deriv;
591 /* don't call MLSL recursively! */
592 if (local_alg >= NLOPT_GN_MLSL
593 && local_alg <= NLOPT_GD_MLSL_LDS)
594 local_alg = (algorithm == NLOPT_GN_MLSL ||
595 algorithm == NLOPT_GN_MLSL_LDS)
596 ? NLOPT_LN_COBYLA : NLOPT_LD_MMA;
597 local_opt = nlopt_create(local_alg, n);
598 if (!local_opt) return NLOPT_FAILURE;
599 nlopt_set_ftol_rel(local_opt, opt->ftol_rel);
600 nlopt_set_ftol_abs(local_opt, opt->ftol_abs);
601 nlopt_set_xtol_rel(local_opt, opt->xtol_rel);
602 nlopt_set_xtol_abs(local_opt, opt->xtol_abs);
603 nlopt_set_maxeval(local_opt, nlopt_local_search_maxeval);
605 if (opt->dx) nlopt_set_initial_step(local_opt, opt->dx);
606 for (i = 0; i < n && stop.xtol_abs[i] > 0; ++i) ;
607 if (local_opt->ftol_rel <= 0 && local_opt->ftol_abs <= 0 &&
608 local_opt->xtol_rel <= 0 && i < n) {
609 /* it is not sensible to call MLSL without *some*
610 nonzero tolerance for the local search */
611 nlopt_set_ftol_rel(local_opt, 1e-15);
612 nlopt_set_xtol_rel(local_opt, 1e-7);
614 opt->force_stop_child = local_opt;
615 ret = mlsl_minimize(ni, f, f_data, lb, ub, x, minf, &stop,
616 local_opt, (int) POP(0),
617 algorithm >= NLOPT_GN_MLSL_LDS &&
618 algorithm != NLOPT_G_MLSL);
619 opt->force_stop_child = NULL;
620 if (!opt->local_opt) nlopt_destroy(local_opt);
627 #define LO(param, def) (opt->local_opt ? opt->local_opt->param : (def))
628 dual_opt = nlopt_create(LO(algorithm,
629 nlopt_local_search_alg_deriv),
630 nlopt_count_constraints(opt->m,
632 if (!dual_opt) return NLOPT_FAILURE;
633 nlopt_set_ftol_rel(dual_opt, LO(ftol_rel, 1e-12));
634 nlopt_set_ftol_abs(dual_opt, LO(ftol_abs, 0.0));
635 nlopt_set_maxeval(dual_opt, LO(maxeval, 100000));
638 ret = mma_minimize(n, f, f_data, opt->m, opt->fc,
639 lb, ub, x, minf, &stop, dual_opt);
640 nlopt_destroy(dual_opt);
644 case NLOPT_LN_COBYLA: {
649 if (nlopt_set_default_initial_step(opt, x) != NLOPT_SUCCESS)
650 return NLOPT_OUT_OF_MEMORY;
652 return cobyla_minimize(n, f, f_data,
655 lb, ub, x, minf, &stop,
657 if (freedx) { free(opt->dx); opt->dx = NULL; }
661 case NLOPT_LN_NEWUOA: {
663 if (initial_step(opt, x, &step) != NLOPT_SUCCESS)
664 return NLOPT_OUT_OF_MEMORY;
665 return newuoa(ni, 2*n+1, x, 0, 0, step,
666 &stop, minf, f_noderiv, opt);
669 case NLOPT_LN_NEWUOA_BOUND: {
671 if (initial_step(opt, x, &step) != NLOPT_SUCCESS)
672 return NLOPT_OUT_OF_MEMORY;
673 return newuoa(ni, 2*n+1, x, lb, ub, step,
674 &stop, minf, f_noderiv, opt);
677 case NLOPT_LN_BOBYQA: {
682 if (nlopt_set_default_initial_step(opt, x) != NLOPT_SUCCESS)
683 return NLOPT_OUT_OF_MEMORY;
685 ret = bobyqa(ni, 2*n+1, x, lb, ub, opt->dx,
686 &stop, minf, opt->f, opt->f_data);
687 if (freedx) { free(opt->dx); opt->dx = NULL; }
691 case NLOPT_LN_NELDERMEAD:
698 if (nlopt_set_default_initial_step(opt, x) != NLOPT_SUCCESS)
699 return NLOPT_OUT_OF_MEMORY;
701 if (algorithm == NLOPT_LN_NELDERMEAD)
702 ret= nldrmd_minimize(ni,f,f_data,lb,ub,x,minf,opt->dx,&stop);
704 ret= sbplx_minimize(ni,f,f_data,lb,ub,x,minf,opt->dx,&stop);
705 if (freedx) { free(opt->dx); opt->dx = NULL; }
710 case NLOPT_AUGLAG_EQ:
711 case NLOPT_LN_AUGLAG:
712 case NLOPT_LN_AUGLAG_EQ:
713 case NLOPT_LD_AUGLAG:
714 case NLOPT_LD_AUGLAG_EQ: {
715 nlopt_opt local_opt = opt->local_opt;
717 if ((algorithm == NLOPT_AUGLAG || algorithm == NLOPT_AUGLAG_EQ)
719 return NLOPT_INVALID_ARGS;
720 if (!local_opt) { /* default */
721 local_opt = nlopt_create(
722 algorithm == NLOPT_LN_AUGLAG ||
723 algorithm == NLOPT_LN_AUGLAG_EQ
724 ? nlopt_local_search_alg_nonderiv
725 : nlopt_local_search_alg_deriv, n);
726 if (!local_opt) return NLOPT_FAILURE;
727 nlopt_set_ftol_rel(local_opt, opt->ftol_rel);
728 nlopt_set_ftol_abs(local_opt, opt->ftol_abs);
729 nlopt_set_xtol_rel(local_opt, opt->xtol_rel);
730 nlopt_set_xtol_abs(local_opt, opt->xtol_abs);
731 nlopt_set_maxeval(local_opt, nlopt_local_search_maxeval);
733 if (opt->dx) nlopt_set_initial_step(local_opt, opt->dx);
734 opt->force_stop_child = local_opt;
735 ret = auglag_minimize(ni, f, f_data,
738 lb, ub, x, minf, &stop,
740 algorithm == NLOPT_AUGLAG_EQ
741 || algorithm == NLOPT_LN_AUGLAG_EQ
742 || algorithm == NLOPT_LD_AUGLAG_EQ);
743 opt->force_stop_child = NULL;
744 if (!opt->local_opt) nlopt_destroy(local_opt);
749 if (!finite_domain(n, lb, ub)) return NLOPT_INVALID_ARGS;
750 return isres_minimize(ni, f, f_data,
751 (int) (opt->m), opt->fc,
752 (int) (opt->p), opt->h,
753 lb, ub, x, minf, &stop,
757 return nlopt_slsqp(n, f, f_data,
760 lb, ub, x, minf, &stop);
763 return NLOPT_INVALID_ARGS;
766 return NLOPT_SUCCESS; /* never reached */
769 /*********************************************************************/
776 /* wrapper for maximizing: just flip the sign of f and grad */
777 static double f_max(unsigned n, const double *x, double *grad, void *data)
779 f_max_data *d = (f_max_data *) data;
780 double val = d->f(n, x, grad, d->f_data);
783 for (i = 0; i < n; ++i)
790 NLOPT_STDCALL nlopt_optimize(nlopt_opt opt, double *x, double *opt_f)
792 nlopt_func f; void *f_data;
797 if (!opt || !opt_f || !opt->f) return NLOPT_INVALID_ARGS;
798 f = opt->f; f_data = opt->f_data;
800 /* for maximizing, just minimize the f_max wrapper, which
801 flips the sign of everything */
802 if ((maximize = opt->maximize)) {
803 fmd.f = f; fmd.f_data = f_data;
804 opt->f = f_max; opt->f_data = &fmd;
805 opt->stopval = -opt->stopval;
809 { /* possibly eliminate lb == ub dimensions for some algorithms */
810 nlopt_opt elim_opt = opt;
811 if (elimdim_wrapcheck(opt)) {
812 elim_opt = elimdim_create(opt);
813 if (!elim_opt) { ret = NLOPT_OUT_OF_MEMORY; goto done; }
814 elimdim_shrink(opt->n, x, opt->lb, opt->ub);
817 ret = nlopt_optimize_(elim_opt, x, opt_f);
819 if (elim_opt != opt) {
820 elimdim_destroy(elim_opt);
821 elimdim_expand(opt->n, x, opt->lb, opt->ub);
826 if (maximize) { /* restore original signs */
827 opt->maximize = maximize;
828 opt->stopval = -opt->stopval;
829 opt->f = f; opt->f_data = f_data;
836 /*********************************************************************/
838 nlopt_result nlopt_optimize_limited(nlopt_opt opt, double *x, double *minf,
839 int maxeval, double maxtime)
845 if (!opt) return NLOPT_INVALID_ARGS;
847 save_maxeval = nlopt_get_maxeval(opt);
848 save_maxtime = nlopt_get_maxtime(opt);
850 /* override opt limits if maxeval and/or maxtime are more stringent */
851 if (save_maxeval <= 0 || (maxeval > 0 && maxeval < save_maxeval))
852 nlopt_set_maxeval(opt, maxeval);
853 if (save_maxtime <= 0 || (maxtime > 0 && maxtime < save_maxtime))
854 nlopt_set_maxtime(opt, maxtime);
856 ret = nlopt_optimize(opt, x, minf);
858 nlopt_set_maxeval(opt, save_maxeval);
859 nlopt_set_maxtime(opt, save_maxtime);
864 /*********************************************************************/