Use trusty

[nlopt.git] / api / nlopt.3

diff --git a/api/nlopt.3 b/api/nlopt.3
index 55529aad41af707cee40635bb72929d2e4611d20..709d48b3ff12dddbd66a0df7afd7281d5e486829 100644 (file)
--- a/api/nlopt.3
+++ b/api/nlopt.3
@@ -316,15 +316,15 @@ DIRECT-L search algorithm by Jones et al. as modified by Gablonsky et
 al. to be more weighted towards local search.  Does not support
 unconstrainted optimization.  There are also several other variants of
 the DIRECT algorithm that are supported:
-.BR NLOPT_GLOBAL_DIRECT ,
+.BR NLOPT_GN_DIRECT ,
 which is the original DIRECT algorithm;
-.BR NLOPT_GLOBAL_DIRECT_L_RAND ,
+.BR NLOPT_GN_DIRECT_L_RAND ,
 a slightly randomized version of DIRECT-L that may be better in
 high-dimensional search spaces;
-.BR NLOPT_GLOBAL_DIRECT_NOSCAL ,
-.BR NLOPT_GLOBAL_DIRECT_L_NOSCAL ,
+.BR NLOPT_GN_DIRECT_NOSCAL ,
+.BR NLOPT_GN_DIRECT_L_NOSCAL ,
 and
-.BR NLOPT_GLOBAL_DIRECT_L_RAND_NOSCAL ,
+.BR NLOPT_GN_DIRECT_L_RAND_NOSCAL ,
 which are versions of DIRECT where the dimensions are not rescaled to
 a unit hypercube (which means that dimensions with larger bounds are
 given more weight).
@@ -731,6 +731,6 @@ is implemented for up to 1111 dimensions.
 .SH AUTHORS
 Written by Steven G. Johnson.
 .PP
-Copyright (c) 2007-2012 Massachusetts Institute of Technology.
+Copyright (c) 2007-2014 Massachusetts Institute of Technology.
 .SH "SEE ALSO"
 nlopt_minimize(3)