e05jb
is the AD Library version of the primal routine
e05jbf.
Based (in the C++ interface) on overload resolution,
e05jb can be used for primal, tangent and adjoint
evaluation. It supports tangents and adjoints of first order.
Note: this function can be used with AD tools other than dco/c++. For details, please contact
NAG.
e05jb
is the AD Library version of the primal routine
e05jbf.
e05jbf is designed to find the global minimum or maximum of an arbitrary function, subject to simple bound-constraints using a multi-level coordinate search method. Derivatives are not required, but convergence is only guaranteed if the objective function is continuous in a neighbourhood of a global optimum. It is not intended for large problems.
The initialization routine
e05jaf must have been called before calling
e05jbf.
For further information see
Section 3 in the documentation for
e05jbf.
Huyer W and Neumaier A (1999) Global optimization by multi-level coordinate search Journal of Global Optimization 14 331–355
A brief summary of the AD specific arguments is given below. For the remainder, links are provided to the corresponding argument from the primal routine.
A tooltip popup for all arguments can be found by hovering over the argument name in
Section 2 and in this section.
e05jb preserves all error codes from
e05jbf and in addition can return:
An unexpected AD error has been triggered by this routine. Please
contact
NAG.
See
Error Handling in the NAG AD Library Introduction for further information.
The routine was called using a strategy that has not yet been implemented.
See
AD Strategies in the NAG AD Library Introduction for further information.
A C++ exception was thrown.
The error message will show the details of the C++ exception text.
Dynamic memory allocation failed for AD.
See
Error Handling in the NAG AD Library Introduction for further information.
Not applicable.
None.
A NAG AD Library example is not yet available, please refer to the
NAG AD Library Introduction for information on calling routines from the AD Library.