method
Begins Dakota method selection and behavioral settings.
Topics
Specification
Alias: None
Arguments: None
JSON argument key: None
Child Keywords:
Required/Optional |
Description of Group |
JSON Group Key |
Dakota Keyword |
Dakota Keyword Description |
|---|---|---|---|---|
Required |
(Experimental) Adaptively refine a Gaussian process surrogate |
|||
Required |
Approximate control variate (ACV) sampling methods for UQ |
|||
Required |
Pattern search, derivative free optimization method |
|||
Required |
Bayesian calibration |
|||
Required |
(Experimental Capability) Solves a mixed integer nonlinear optimization problem |
|||
Required |
Samples variables along points moving out from a center point |
|||
Required |
(Experimental) Coliny beta solver |
|||
Required |
Constrained Optimization BY Linear Approximations (COBYLA) |
|||
Required |
DIviding RECTangles method |
|||
Required |
Evolutionary Algorithm |
|||
Required |
Pattern search, derivative free optimization method |
|||
Required |
Simple greedy local search method |
|||
Required |
CONMIN conjugate gradient optimization method |
|||
Required |
CONMIN method of feasible directions |
|||
Required |
Design and Analysis of Computer Experiments |
|||
Required |
Third-party optimization library integration demonstration. |
|||
Required |
DOT BFGS optimization method |
|||
Required |
DOT conjugate gradient optimization method |
|||
Required |
DOT modified method of feasible directions |
|||
Required |
DOT Sequential Linear Program |
|||
Required |
DOT Sequential Quadratic Program |
|||
Required |
Global Surrogate Based Optimization, a.k.a. EGO |
|||
Required |
Use the external python methods interface |
|||
Required |
Design of Computer Experiments - Centroidal Voronoi Tessellation |
|||
Required |
Design of Computer Experiments - Quasi-Monte Carlo sampling |
|||
Required |
UQ method leveraging a functional tensor train surrogate model. |
|||
Required |
Classical high-dimensional global Lipschitzian optimization Classical high-dimensional global Lipschitzian optimization |
|||
Required |
Voronoi-based high-dimensional global Lipschitzian optimization |
|||
Required |
Evidence theory with evidence measures computed with global optimization methods |
|||
Required |
Interval analysis using global optimization methods |
|||
Required |
Global reliability methods |
|||
Required |
Gaussian Process Adaptive Importance Sampling |
|||
Required |
Methods are run one at a time, in sequence |
|||
Required |
Imports points from file and computes statistics for them. |
|||
Required |
Importance sampling |
|||
Required |
Samples variables as a specified values |
|||
Required |
Evidence theory with evidence measures computed with local optimization methods |
|||
Required |
Interval analysis using local optimization |
|||
Required |
Local reliability method |
|||
Required |
Finds optimal variable values using adaptive mesh-based search |
|||
Required |
Multi-objective Genetic Algorithm (a.k.a Evolutionary Algorithm) |
|||
Required |
Multi-Start Optimization Method |
|||
Required |
Samples variables on full factorial grid of study points |
|||
Required |
Multifidelity uncertainty quantification using function train expansions |
|||
Required |
Multifidelity uncertainty quantification using polynomial chaos expansions |
|||
Required |
Multifidelity Monte Carlo sampling method for UQ |
|||
Required |
Multifidelity uncertainty quantification using stochastic collocation |
|||
Required |
The multilevel best linear unbiased estimator (ML BLUE) sampling method for UQ |
|||
Required |
Multilevel uncertainty quantification using function train expansions |
|||
Required |
Multilevel-Multifidelity sampling methods for UQ |
|||
Required |
Multilevel uncertainty quantification using polynomial chaos expansions |
|||
Required |
Multilevel Monte Carlo (MLMC) sampling method for UQ |
|||
Required |
DIviding RECTangles method |
|||
Required |
Trust-region method for nonlinear least squares |
|||
Required |
NLPQL Sequential Quadratic Program |
|||
Required |
Sequential Quadratic Program for nonlinear least squares |
|||
Required |
(Experimental) nonlinear conjugate gradient optimization |
|||
Required |
Gradient-free inequality-constrained optimization using Nonlinear Optimization With Path Augmented Constraints (NOWPAC). |
|||
Required |
NPSOL Sequential Quadratic Program |
|||
Required |
A conjugate gradient optimization method |
|||
Required |
Finite Difference Newton optimization method |
|||
Required |
Newton method based least-squares calbration |
|||
Required |
Newton method based optimization |
|||
Required |
Simplex-based derivative free optimization method |
|||
Required |
Quasi-Newton optimization method |
|||
Required |
Pareto set optimization |
|||
Required |
Probability-of-Failure (POF) darts is a novel method for estimating the probability of failure based on random sphere-packing. |
|||
Required |
Uncertainty quantification using polynomial chaos expansions |
|||
Required |
Morris One-at-a-Time |
|||
Required |
Estimate order of convergence of a response as model fidelity increases |
|||
Required |
Recursive k-d (RKD) Darts: Recursive Hyperplane Sampling for Numerical Integration of High-Dimensional Functions. |
|||
Required |
Rapid Optimization Library (ROL) is a large-scale optimization package within Trilinos. |
|||
Required |
Randomly samples variables according to their distributions |
|||
Required |
Stochastic version of NOWPAC that incorporates error estimates and noise mitigation. |
|||
Required |
Single-objective Genetic Algorithm (a.k.a Evolutionary Algorithm) |
|||
Required |
Uncertainty quantification with stochastic collocation |
|||
Required |
Adaptive Global Surrogate-Based Optimization |
|||
Required |
Local Surrogate Based Optimization |
|||
Required |
Generic UQ method for constructing and interrogating a surrogate model. |
|||
Required |
Samples variables along a user-defined vector |
Description
The method keyword signifies the start of a block in the Dakota
input file. A method block contains the various keywords necessary to
select a method and to control its behavior.
Method Block Requirements
At least one method block must appear in the Dakota input
file. Multiple method blocks may be needed to fully define
advanced analysis approaches.
Each method block must specify one method and, optionally, any
associated keywords that govern the behavior of the method.
The Methods
Each method block must select one method.
Starting with Dakota v6.0, the methods are grouped into two types: standard methods and multi-component methods.
The standard methods are
stand-alone and self-contained in the sense that they only require
a model to perform a study. They do not call other methods.
While methods such as
polynomial_chaos and efficient_global internally utilize multiple
iterator and surrogate model components, these components are
generally hidden from user control due to restrictions on modularity;
thus, these methods are stand-alone.
The multi-component group
of methods provides a higher level “meta-algorithm” that points to
other methods and models that support sub-iteration.
For example, in a sequential hybrid method, the hybrid
method specification must identify a list of subordinate methods, and
the “meta-algorithm” executes these methods in sequence and transfers
information between them. Surrogate-based minimizers provide another
example in that they point both to other methods (e.g. what
optimization method is used to solve the approximate subproblem) as
well as to models (e.g. what type of surrogate model is employed).
Multi-component methods generally provide some level of “plug and
play” modularity, through their flexible support of a variety of
method and model selections.
Component-Based Iterator Commands
Component-based iterator specifications include hybrid, multi-start,
pareto set, surrogate-based local, surrogate-based global, and branch
and bound methods. Whereas a standard iterator specification only
needs an optional model pointer string (specified with
model_pointer), component-based iterator specifications can include
method pointer, method name, and model pointer specifications in order
to define the components employed in the “meta-iteration.” In
particular, these specifications identify one or more methods (by
pointer or by name) to specify the subordinate iterators that will be
used in the top-level algorithm. Identifying a sub-iterator by name
instead of by pointer is a lightweight option that relaxes the need
for a separate method specification for the sub-iterator; however, a
model pointer may be required in this case to provide the
specification connectivity normally supported by the method pointer.
Refer to these individual method descriptions for specific
requirements for these advanced methods.
Method Independent Controls
In addition to the method, there are 10 optional keywords, which are referred to as method independent controls. These controls are valid for enough methods that it was reasonable to pull them out of the method dependent blocks and consolidate the specifications, however, they are NOT universally respected by all methods.
Examples
Several examples follow. The first example shows a minimal specification for an optimization method.
method
dot_sqp
{
"method": [{"dot_sqp": {}}]
}
This example uses all of the defaults for this method.
A more sophisticated example would be
method,
id_method = 'NLP1'
dot_sqp
max_iterations = 50
convergence_tolerance = 1e-4
output verbose
model_pointer = 'M1'
{
"method": [
{
"dot_sqp": {
"id_method": "NLP1",
"max_iterations": 50,
"convergence_tolerance": 1e-4,
"output": {"verbose": true},
"model_pointer": "M1"
}
}
]
}
This example demonstrates the use of identifiers and pointers
as well as some method independent and method
dependent controls for the sequential quadratic programming (SQP)
algorithm from the DOT library. The max_iterations,
convergence_tolerance, and output settings are method independent
controls, in that they are defined for a variety of methods.
The next example shows a specification for a least squares method.
method
optpp_g_newton
max_iterations = 10
convergence_tolerance = 1.e-8
search_method trust_region
gradient_tolerance = 1.e-6
{
"method": [
{
"optpp_g_newton": {
"max_iterations": 10,
"convergence_tolerance": 1e-8,
"search_method": {"trust_region": true},
"gradient_tolerance": 1e-6
}
}
]
}
Some of the same method independent controls are present along with
several method dependent controls ( search_method and
gradient_tolerance) which are only meaningful for OPT++ methods (see
Package: OPT++).
The next example shows a specification for a nondeterministic method
with several method dependent controls (refer to sampling).
method
sampling
samples = 100
seed = 12345
sample_type lhs
response_levels = 1000. 500.
{
"method": [
{
"sampling": {
"samples": 100,
"seed": 12345,
"sample_type": {"lhs": {}},
"response_levels": {"values": [1000.0, 500.0]}
}
}
]
}
The last example shows a specification for a parameter study method
where, again, each of the controls are method dependent (refer to
vector_parameter_study).
method
vector_parameter_study
step_vector = 1. 1. 1.
num_steps = 10
{
"method": [
{
"vector_parameter_study": {
"step_control": {
"step_vector": [1.0, 1.0, 1.0]
},
"num_steps": 10
}
}
]
}

