optpp_pds
Simplex-based derivative free optimization method
Topics
package_optpp
Specification
Alias: None
Arguments: None
Child Keywords:
Required/Optional |
Description of Group |
Dakota Keyword |
Dakota Keyword Description |
---|---|---|---|
Optional |
Number of points to be used in the direct search template |
||
Optional |
Number of iterations allowed for optimizers and adaptive UQ methods |
||
Optional |
Stopping criterion based on objective function or statistics convergence |
||
Optional |
Number of function evaluations allowed for optimizers |
||
Optional |
Turn on scaling for variables, responses, and constraints |
||
Optional |
Identifier for model block to be used by a method |
Description
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: OPT++ for info related to all optpp
methods.