diff --git a/api/nlopt_minimize.3 b/api/nlopt_minimize.3
index 6cbefecc76447e01a8935388145c47f132a25cf4..1d30d0f2b08749033d44b9304376301c2b2f1459 100644
--- a/api/nlopt_minimize.3
+++ b/api/nlopt_minimize.3
@@ -486,10 +486,6 @@ calling:
 Some of the algorithms also support using low-discrepancy sequences (LDS),
 sometimes known as quasi-random numbers.  NLopt uses the Sobol LDS, which
 is implemented for up to 1111 dimensions.
-.SH BUGS
-Currently the NLopt library is in pre-alpha stage.  Most algorithms
-currently do not support all termination conditions: the only
-termination condition that is consistently supported right now is
 .BR maxeval .
 .SH AUTHORS
 Written by Steven G. Johnson.
diff --git a/api/nlopt_minimize_constrained.3 b/api/nlopt_minimize_constrained.3
index ad49ac457bc098095fb5510f794854deb6a5db01..13e393a9f783e55323a554ea587dc2abf98847c2 100644
--- a/api/nlopt_minimize_constrained.3
+++ b/api/nlopt_minimize_constrained.3
@@ -588,11 +588,6 @@ calling:
 Some of the algorithms also support using low-discrepancy sequences (LDS),
 sometimes known as quasi-random numbers.  NLopt uses the Sobol LDS, which
 is implemented for up to 1111 dimensions.
-.SH BUGS
-Currently the NLopt library is in pre-alpha stage.  Most algorithms
-currently do not support all termination conditions: the only
-termination condition that is consistently supported right now is
-.BR maxeval .
 .SH AUTHORS
 Written by Steven G. Johnson.
 .PP