The R Project SVN R

Rev

Rev 61282 | Rev 69942 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 61282 Rev 61433
Line 37... Line 37...
37
 
37
 
38
  \code{optimise} is an alias for \code{optimize}.
38
  \code{optimise} is an alias for \code{optimize}.
39
}
39
}
40
\details{
40
\details{
41
  Note that arguments after \code{\dots} must be matched exactly.
41
  Note that arguments after \code{\dots} must be matched exactly.
42
  
42
 
43
  The method used is a combination of golden section search and
43
  The method used is a combination of golden section search and
44
  successive parabolic interpolation, and was designed for use with
44
  successive parabolic interpolation, and was designed for use with
45
  continuous functions.  Convergence is never much slower
45
  continuous functions.  Convergence is never much slower
46
  than that for a Fibonacci search.  If \code{f} has a continuous second
46
  than that for a Fibonacci search.  If \code{f} has a continuous second
47
  derivative which is positive at the minimum (which is not at \code{lower} or
47
  derivative which is positive at the minimum (which is not at \code{lower} or
Line 70... Line 70...
70
  solution, even when \code{f} is constant in there, see the last
70
  solution, even when \code{f} is constant in there, see the last
71
  example.
71
  example.
72
 
72
 
73
  \code{f} will be called as \code{f(\var{x}, ...)} for a numeric value
73
  \code{f} will be called as \code{f(\var{x}, ...)} for a numeric value
74
  of \var{x}.
74
  of \var{x}.
75
  
75
 
76
  The argument passed to \code{f} has special semantics and used to be
76
  The argument passed to \code{f} has special semantics and used to be
77
  shared between calls.  The function should not copy it.
77
  shared between calls.  The function should not copy it.
78
}
78
}
79
\value{
79
\value{
80
  A list with components \code{minimum} (or \code{maximum})
80
  A list with components \code{minimum} (or \code{maximum})