support equality constraints in COBYLA (internally, just a pair of inequality constra...

[nlopt.git] / api / nlopt.3

diff --git a/api/nlopt.3 b/api/nlopt.3
index c3c943ed2273cacff69f19f47b4791b3e888760b..8e13e692d61fe5a07053d4e0753ccd663550dedf 100644 (file)
--- a/api/nlopt.3
+++ b/api/nlopt.3
@@ -200,9 +200,9 @@ constant (so that you don't have to fill an array with a constant value):
 .BI "                                       double " "ub" ); 
 .sp
 .SH NONLINEAR CONSTRAINTS
-Several of the algorithms in NLopt (MMA, COBYLA, and ORIG_DIRECT) also
-support arbitrary nonlinear inequality constraints, and some also
-allow nonlinear equality constraints (ISRES and AUGLAG).  For these
+Several of the algorithms in NLopt (MMA and ORIG_DIRECT) also support
+arbitrary nonlinear inequality constraints, and some also allow
+nonlinear equality constraints (COBYLA, ISRES, and AUGLAG).  For these
 algorithms, you can specify as many nonlinear constraints as you wish
 by calling the following functions multiple times.
 .sp
@@ -450,9 +450,9 @@ Local (L) derivative-free (N) optimization using the COBYLA algorithm
 of Powell (Constrained Optimization BY Linear Approximations).
 The
 .B NLOPT_LN_COBYLA
-algorithm supports both bound-constrained and unconstrained optimization,
-and also supports an arbitrary number (\fIm\fR) of nonlinear constraints
-as described above.
+algorithm supports both bound-constrained and unconstrained
+optimization, and also supports an arbitrary number (\fIm\fR) of
+nonlinear inequality/equality constraints as described above.
 .TP
 .B NLOPT_LN_NEWUOA
 Local (L) derivative-free (N) optimization using a variant of the