Apache
/
commons-math
mirror of https://github.com/apache/commons-math.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fixed typos 

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/trunk@608871 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Luc Maisonobe 2008-01-04 14:47:25 +00:00
parent 4b4243fc46
commit 05bb73146d
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
xdocs/userguide/optimization.xml
View File

@ -54,7 +54,7 @@
(<a href="http://cm.bell-labs.com/cm/cs/doc/96/4-02.ps.gz">Direct (<a href="http://cm.bell-labs.com/cm/cs/doc/96/4-02.ps.gz">Direct
Search Methods: Once Scorned, Now Respectable</a>), they are used Search Methods: Once Scorned, Now Respectable</a>), they are used
when either the computation of the derivative is impossible (noisy 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 computation cost). In the first cases, rather than an optimum, a
<em>not too bad</em> point is desired. In the latter cases, an <em>not too bad</em> point is desired. In the latter cases, an
optimum is desired but cannot be reasonably found. In all cases optimum is desired but cannot be reasonably found. In all cases
@ -69,7 +69,7 @@
<p> <p>
The instances can be built either in single-start or in The instances can be built either in single-start or in
multi-start mode. Multi-start is a traditional way to try to avoid 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 function. It can also be used to verify the convergence of an
algorithm. In multi-start mode, the <code>minimizes</code>method algorithm. In multi-start mode, the <code>minimizes</code>method
returns the best minimum found after all starts, and the <code>etMinima</code> returns the best minimum found after all starts, and the <code>etMinima</code>