From 05bb73146dc6009c0f81a45135e574b1969d4e04 Mon Sep 17 00:00:00 2001 From: Luc Maisonobe Date: Fri, 4 Jan 2008 14:47:25 +0000 Subject: [PATCH] fixed typos git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/trunk@608871 13f79535-47bb-0310-9956-ffa450edef68 --- xdocs/userguide/optimization.xml | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/xdocs/userguide/optimization.xml b/xdocs/userguide/optimization.xml index bbf21ec9e..6379de7d3 100644 --- a/xdocs/userguide/optimization.xml +++ b/xdocs/userguide/optimization.xml @@ -54,7 +54,7 @@ (Direct Search Methods: Once Scorned, Now Respectable), 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 not too bad 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 minimizesmethod returns the best minimum found after all starts, and the etMinima