The E05 type exposes the following members.
Methods
| Name | Description | |
|---|---|---|
  | e05jb | e05jb 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 method (E05JAF not in this release) must have been called before calling e05jb.
|
| e05jbk | Auxiliary for use as a delegate parameter
|
| e05uc | e05uc is designed to find the global minimum of an arbitrary smooth function subject to constraints (which may include simple bounds on the variables, linear constraints and smooth nonlinear constraints) by generating a number of different starting points and performing a local search from each using sequential quadratic programming.
|
| e05ucz | Auxiliary for use as a delegate parameter
|
| e05us | e05us is designed to find the global minimum of an arbitrary smooth sum of squares function subject to constraints (which may include simple bounds on the variables, linear constraints and smooth nonlinear constraints) by generating a number of different starting points and performing a local search from each using sequential quadratic programming.
|
