neldermead: R port of the Scilab neldermead module
Version 1.0-10

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).

Package details

AuthorSebastien Bihorel, Michael Baudin (author of the original module)
Date of publication2015-01-11 23:16:07
MaintainerSebastien Bihorel <>
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the neldermead package in your browser

Any scripts or data that you put into this service are public.

neldermead documentation built on May 29, 2017, 3:54 p.m.