Javadoc.

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/trunk@1579346 13f79535-47bb-0310-9956-ffa450edef68

src/main/java/org/apache/commons/math3/analysis/solvers/UnivariateSolverUtils.java

@@ -179,8 +179,8 @@ public class UnivariateSolverUtils {
      * <code>ConvergenceException.</code>  Unless you are confident that there
      * is a root between <code>lowerBound</code> and <code>upperBound</code>
      * near <code>initial,</code> it is better to use
-     * {@link #bracket(UnivariateFunction, double, double, double,
-     * double, int) bracket(function, initial, lowerBound, upperBound, delta, maximumIterations)},
+     * {@link #bracket(UnivariateFunction, double, double, double, double,
+     * double, int) bracket(function, initial, lowerBound, upperBound, q, r, maximumIterations)},
      * explicitly specifying the maximum number of iterations.</p>
      *
      * @param function Function.

src/main/java/org/apache/commons/math3/optim/nonlinear/scalar/noderiv/PowellOptimizer.java

@@ -40,8 +40,7 @@ import org.apache.commons.math3.optim.univariate.UnivariatePointValuePair;
  * to define a custom convergence checker that might terminate the algorithm
  * earlier.
  * <br/>
- * The internal line search optimizer is a {@link BrentOptimizer} with a
- * convergence checker set to {@link SimpleUnivariateValueChecker}.
+ * Line search is performed by the {@link LineSearch} class.
  * <br/>
  * Constraints are not supported: the call to
  * {@link #optimize(OptimizationData[]) optimize} will throw