commons-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
Subject svn commit: r608871 - /commons/proper/math/trunk/xdocs/userguide/optimization.xml
Date Fri, 04 Jan 2008 14:47:26 GMT
Author: luc
Date: Fri Jan  4 06:47:25 2008
New Revision: 608871

fixed typos


Modified: commons/proper/math/trunk/xdocs/userguide/optimization.xml
--- commons/proper/math/trunk/xdocs/userguide/optimization.xml (original)
+++ commons/proper/math/trunk/xdocs/userguide/optimization.xml Fri Jan  4 06:47:25 2008
@@ -54,7 +54,7 @@
           (<a href="">Direct
           Search Methods: Once Scorned, Now Respectable</a>), they are used
           when either the computation of the derivative is impossible (noisy
-          functions, unpredictable dicontinuities) or difficult (complexity,
+          functions, unpredictable discontinuities) or difficult (complexity,
           computation cost). In the first cases, rather than an optimum, a
           <em>not too bad</em> point is desired. In the latter cases, an
           optimum is desired but cannot be reasonably found. In all cases
@@ -69,7 +69,7 @@
           The instances can be built either in single-start or in
           multi-start mode. Multi-start is a traditional way to try to avoid
-          beeing trapped in a local minimum and miss the global minimum of a
+          being trapped in a local minimum and miss the global minimum of a
           function. It can also be used to verify the convergence of an
           algorithm. In multi-start mode, the <code>minimizes</code>method
           returns the best minimum found after all starts, and the <code>etMinima</code>

View raw message