

   OOnnee DDiimmeennssiioonnaall OOppttiimmiizzaattiioonn

        optimize(f=, interval=, lower=min(interval),
                upper=max(interval), maximum=FALSE,
                tol=.Machine$double.eps^0.25, ...)

   AArrgguummeennttss::

          f: the function to be optimized. The function is
             either minimized or maximized over its first argu-
             ment depending on the value of `maximum'.

   interval: a vector containing the end-points of the interval
             to be searched for the minimum.

      lower: the lower end point of the interval to be
             searched.

      upper: the upper end point of the interval to be
             searched.

        tol: the desired accuracy.

        ...: additional arguments to `f'.

   DDeessccrriippttiioonn::

        The function `optimize' searches the interval from
        `lower' to `upper' for a minimum or maximum of the
        function `f' with respect to its first argument.

        The function uses Fortran code (from Netlib) based on
        algorithms given in the reference.

   VVaalluuee::

        A list with components `minimum' (or `maximum') and
        `objective' which give the location of the minimum (or
        maximum) and the value of the function at that point.

   RReeffeerreenncceess::

        Brent, R. (1973).  Algorithms for Minimization without
        Derivatives.  Englewood Cliffs N.J.: Prentice-Hall.

   SSeeee AAllssoo::

        `nlm', `uniroot'.

   EExxaammpplleess::

        f <- function (x,a) (x-a)^2
        xmin <- optimize(f, c(0, 1), tol=0.0001, a=1/3)
        xmin

