1 NLopt 2.1 (6 July 2010)
3 * New vector-valued constraint feature; thanks to Dmitrey Kroshko of OpenOpt
6 * COBYLA now accepts equality constraints.
8 * Guard against multiple inclusion in nlopt.hpp; thanks to Saul
9 Thurrowgood for the suggestion.
11 NLopt 2.0.2 (17 June 2010)
13 * Fixed compilation failure in Microsoft Visual Studio, due to
14 incorrect usage of __stdcall keyword; thanks to Dave Katz for the
17 NLopt 2.0.1 (16 June 2010)
19 * Bug fix in Fortran API (for nlo_get_ functions returning arrays).
21 * Fixed buggy compilation with MinGW.
23 NLopt 2.0 (15 June 2010)
25 * New C API, that works by creating an nlopt_opt "object" and then calling
26 functions to set the optimization parameters -- much more extensible
27 than the old API (which is preserved for backwards compatibility).
28 (Updated Fortran, Matlab, and GNU Octave wrappers as well.)
30 * C++ nlopt.hpp wrapper around C API, allowing namespaces, object
31 constructors/destructors, std::vector<double>, and exceptions
34 * New nlopt wrappers callable from Python and GNU Guile, generated
35 with the help of SWIG.
37 * New 'man nlopt' manual page documenting new API.
39 * New AUGLAG algorithm(s) implementing an augmented-Lagrangian method
40 proposed by Birgin and Martinez (2008), which supports nonlinear
41 equality and inequality constraints "wrapped around" other
42 local/global optimization methods.
44 * Added API for nonlinear equality constraints (currently only
45 supported by AUGLAG and ISRES algorithms).
47 * Support inequality constraints directly in ORIG_DIRECT algorithms
48 (no need to return NaN when constraint is violated).
50 * Inequality/equality constraints now have optional tolerances that
51 are used as conditions in stopping criteria.
53 * Pseudo-randomize simplex steps in COBYLA algorithm, improving robustness
54 by avoiding accidentally taking steps that don't improve conditioning
55 (which seems to happen sometimes with active bound constraints). The
56 algorithm remains deterministic (a deterministic seed is used), however.
58 * Allow COBYLA to increase the trust-region radius if the predicted improvement
59 was approximately right and the simplex is OK, following a suggestion
60 in the SAS manual for PROC NLP that seems to improve convergence speed.
62 * Added nlopt_force_stop function to force a (graceful) halt to
63 the optimization, and corresponding NLOPT_FORCED_STOP return code.
65 * Improved thread-safety in random-number generation: thread-local
66 storage is used for random-number state, on compilers that support
67 it (e.g. gcc, Intel, Microsoft), to make the generation thread-safe.
68 In this case, the random-number seed must be set per-thread.
70 * Return an error in global-search algorithms if the domain is not finite.
72 * Use stdcall convention on Windows; thanks to Alan Young for the suggestion.
74 * Added missing absolute-tolerance criteria in Luksan algorithms; thanks
75 to Greg Nicholas for the bug report.
77 * Fixed compilation under C++, and use C++ compiler for everything in
78 --with-cxx mode; thanks to Greg Nicholas for the bug report.
80 * In MMA, only stop at minf_max/stopval if the point is feasible.
82 * Fix Matlab mex file to not include unnecessary nlopt-util.h file,
83 simplifying Windows compilation.
85 NLopt 1.2 (18 November 2009)
87 * Added Powell's BOBYQA algorithm for box-constrained optimization
88 without derivatives, an improvement on NEWUOA.
90 * Added ISRES genetic algorithm, supporting nonlinearly constrained
93 * New functions nlopt_{set/get}_stochastic_population to provide
94 optional greater control over the random "population" sizes in
95 stochastic algorithms (although it still has a sensible default).
97 * Bug fix: remove extraneous text accidentally included in nlopt.f Fortran
100 * Bug fix: configure script now correctly handles Matlab installation
101 when MEX_INSTALL_DIR is specified manually by the user.
103 NLopt 1.1 (12 November 2009)
105 * configure script detects whether --enable-shared is required
106 in order to compile Matlab and Octave plugins (as is the case
107 on x86_64), and disables compilation of those plugins if
108 --enable-shared is not used.
110 * Added --without-octave and --without-matlab configure options to
111 disable Octave and Matlab plugins, respectively.
113 * Modified COBYLA algorithm to have better support for bound
116 * Added new NLOPT_ROUNDOFF_LIMITED failure code to indicate
117 cases in which optimization breaks down due to roundoff errors,
118 in which case it is possible that useful results were obtained.
120 * Experimental support for nonlinear equality constraints via
121 augmented-Lagrangian method.
123 * Support for compiling under Windows (ideally with MinGW) as a
124 DLL, although you have to manually add #define NLOPT_DLL
125 to nlopt.h *after* installing (after compiling NLopt).
127 * Added several checks for roundoff-related breakdown to NEWUOA code.
129 * When only a relative error tolerance is specified, no longer
130 fails to halt when exact convergence to zero is obtained.
132 * Workaround for incompatible qsort_r functions in BSD and GNU libc
133 by always using my own version; thanks to Wendy Vandoolaeghe
134 and Philippe Preux for the bug report and explanation.
136 * Workaround for gcc 3.4.x conflict with HUGE_VAL definition in Solaris
139 * Better identification of Matlab-plugin installation directory.
141 * Fixed identification of Octave-plugin installation directory for
142 recent Octave versions.
144 NLopt 1.0.1 (13 Nov. 2008)
146 * Allow user to override Matlab-plugin installation directory with
149 * Bug fix in my DIRECT code that prevented convergence (DIRECT-L unaffected).
151 * MLSL needs a nonzero default ftol_rel and/or xtol_rel to ensure that
152 its local searches terminate; use roughly machine precision as defaults.
154 NLopt 1.0 (11 Nov. 2008)
156 * Initial public release.