neldermead.restart

Update the simplex with <code>neldermead.updatesimp</code> and restart the search
 with <code>neldermead.search</code>.

 method 

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, 1962) <doi:10.1080/00401706.1962.10490033>,
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,
1965) <doi: 10.1093/comjnl/8.1.42>.

Sebastien Bihorel

neldermead

R Port of the 'Scilab' Neldermead Module

Michael Baudin

neldermead.restart function

<dl> <dt>this</dt>
<dd>A neldermead object.</dd></dl>

Arguments

Author of Scilab neldermead module: Michael Baudin (INRIA - Digiteo)
Author of R adaptation: Sebastien Bihorel (<a href="/link/sb.pmlab%40gmail.com?package=neldermead&version=1.0-13" data-mini-rdoc="neldermead::sb.pmlab@gmail.com">sb.pmlab@gmail.com</a>)

Author

Restart neldermead search. — neldermead.restart

<dl>

 <dt>this</dt>
<dd>A neldermead object.</dd>

</dl>

Author of Scilab neldermead module: Michael Baudin (INRIA - Digiteo)
Author of R adaptation: Sebastien Bihorel (<a href='mailto:sb.pmlab@gmail.com'>sb.pmlab@gmail.com</a>)

neldermead.restart: Restart neldermead search.

Description

Usage

Value

Arguments

Author

See Also