Suggests: knitr (>= 1.28),rmarkdown (>= 2.2)
the variable shape simplex method of Nelder and Mead (unconstrained optimization
with a variable shape simplex made, 1965) <doi:10.1093/comjnl/7.4.308>, and
Box's complex method (constrained optimization with a variable shape simplex,
Packaged: 2022-01-31 01:54:03 UTC; sebastien

Package: neldermead
Type: Package
Title: R port of the Scilab neldermead module
Version: 1.0-2
Date: 2010-05-11
Author: Sebastien Bihorel, Michael Baudin (author of the original
module)
Maintainer: Sebastien Bihorel <sb.pmlab@gmail.com>
Depends: optimbase, optimsimplex
Description: Provides several direct search optimization algorithms
based on the simplex method. The provided algorithms are direct
search algorithms, i.e. algorithms which do not use the
derivative of the cost function. They are based on the update
of a simplex. The following algorithms are available: the fixed
shape simplex method of Spendley, Hext and Himsworth
(unconstrained optimization with a fixed shape simplex), the
variable shape simplex method of Nelder and Mead (unconstrained
optimization with a variable shape simplex made), and Box's
complex method (constrained optimization with a variable shape
simplex).
License: CeCILL-2
LazyLoad: yes
Packaged: 2010-05-12 01:25:26 UTC; sebastien
Repository: CRAN
Date/Publication: 2010-05-12 07:21:57

Package: neldermead
Type: Package
Title: R port of the Scilab neldermead module
Version: 1.0-3
Date: 2010-05-25
Author: Sebastien Bihorel, Michael Baudin (author of the original
module)
Maintainer: Sebastien Bihorel <sb.pmlab@gmail.com>
Depends: optimbase, optimsimplex
Description: Provides several direct search optimization algorithms
based on the simplex method. The provided algorithms are direct
search algorithms, i.e. algorithms which do not use the
derivative of the cost function. They are based on the update
of a simplex. The following algorithms are available: the fixed
shape simplex method of Spendley, Hext and Himsworth
(unconstrained optimization with a fixed shape simplex), the
variable shape simplex method of Nelder and Mead (unconstrained
optimization with a variable shape simplex made), and Box's
complex method (constrained optimization with a variable shape
simplex).
License: CeCILL-2
LazyLoad: yes
Packaged: 2010-05-26 01:56:01 UTC; sebastien
Repository: CRAN
Date/Publication: 2010-05-26 06:55:20