logical; shall the original NLopt info been shown.
control
list of options, see nl.opts for help.
...
additional arguments passed to the function.
Details
SUBPLEX is claimed to be much more efficient and robust than the original
Nelder-Mead, while retaining the latter's facility with discontinuous
objectives.
This implementation has explicit support for bound constraints (via the
method in the Box paper as described on the neldermead help page).
Value
List with components:
par
the optimal solution found so far.
value
the function value corresponding to par.
iter
number of (outer) iterations, see maxeval.
convergence
integer code indicating successful completion (> 0)
or a possible error number (< 0).
message
character string produced by NLopt and giving additional
information.
Note
It is the request of Tom Rowan that reimplementations of his algorithm shall
not use the name ‘subplex’.
References
T. Rowan, “Functional Stability Analysis of Numerical Algorithms”, Ph.D.
thesis, Department of Computer Sciences, University of Texas at Austin, 1990.