![]() |
Dakota Reference Manual
Version 6.15
Explore and Predict with Confidence
|
Simplex-based derivative free optimization method
This keyword is related to the topics:
Alias: none
Argument(s): none
Child Keywords:
Required/Optional | Description of Group | Dakota Keyword | Dakota Keyword Description | |
---|---|---|---|---|
Optional | search_scheme_size | Number of points to be used in the direct search template | ||
Optional | max_iterations | Number of iterations allowed for optimizers and adaptive UQ methods | ||
Optional | convergence_tolerance | Stopping criterion based on objective function or statistics convergence | ||
Optional | max_function_evaluations | Number of function evaluations allowed for optimizers | ||
Optional | scaling | Turn on scaling for variables, responses, and constraints | ||
Optional | model_pointer | Identifier for model block to be used by a method |
The direct search algorithm, PDS (parallel direct search method), supports bound constraints.
The PDS method can directly exploit asynchronous evaluations; however, this capability has not yet been implemented in Dakota.
See package_optpp for info related to all optpp
methods.
These keywords may also be of interest: