Dakota Reference Manual: optpp_pds

| Dakota Reference Manual Version 6.15 Explore and Predict with Confidence

- Main Page
- Related Pages

All Pages
optpp_pds

Simplex-based derivative free optimization method

## Topics

This keyword is related to the topics:

- package_optpp

## Specification

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

## 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_optpp for info related to all `optpp` methods.

## See Also

These keywords may also be of interest:

- optpp_cg
- optpp_g_newton
- optpp_fd_newton
- optpp_newton
- optpp_g_newton