.. _method: """""" method """""" Begins Dakota method selection and behavioral settings. **Topics** :ref:`block ` .. toctree:: :hidden: :maxdepth: 1 method-adaptive_sampling method-approximate_control_variate method-asynch_pattern_search method-bayes_calibration method-branch_and_bound method-centered_parameter_study method-coliny_beta method-coliny_cobyla method-coliny_direct method-coliny_ea method-coliny_pattern_search method-coliny_solis_wets method-conmin_frcg method-conmin_mfd method-dace method-demo_tpl method-dot_bfgs method-dot_frcg method-dot_mmfd method-dot_slp method-dot_sqp method-efficient_global method-external_python method-fsu_cvt method-fsu_quasi_mc method-function_train method-genie_direct method-genie_opt_darts method-global_evidence method-global_interval_est method-global_reliability method-gpais method-hybrid_sequential method-import_points method-importance_sampling method-list_parameter_study method-local_evidence method-local_interval_est method-local_reliability method-mesh_adaptive_search method-moga method-multi_start method-multidim_parameter_study method-multifidelity_function_train method-multifidelity_polynomial_chaos method-multifidelity_sampling method-multifidelity_stoch_collocation method-multilevel_blue method-multilevel_function_train method-multilevel_multifidelity_sampling method-multilevel_polynomial_chaos method-multilevel_sampling method-ncsu_direct method-nl2sol method-nlpql_sqp method-nlssol_sqp method-nonlinear_cg method-nowpac method-npsol_sqp method-optpp_cg method-optpp_fd_newton method-optpp_g_newton method-optpp_newton method-optpp_pds method-optpp_q_newton method-pareto_set method-pof_darts method-polynomial_chaos method-psuade_moat method-richardson_extrap method-rkd_darts method-rol method-sampling method-snowpac method-soga method-stoch_collocation method-surrogate_based_global method-surrogate_based_local method-surrogate_based_uq method-vector_parameter_study **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 | | | `adaptive_sampling`__ | (Experimental) Adaptively refine a Gaussian process | | | | | | surrogate | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `approximate_control_variate`__ | Approximate control variate (ACV) sampling methods for UQ | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `asynch_pattern_search`__ | Pattern search, derivative free optimization method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `bayes_calibration`__ | Bayesian calibration | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `branch_and_bound`__ | (Experimental Capability) Solves a mixed integer nonlinear | | | | | | optimization problem | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `centered_parameter_study`__ | Samples variables along points moving out from a center | | | | | | point | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `coliny_beta`__ | (Experimental) Coliny beta solver | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `coliny_cobyla`__ | Constrained Optimization BY Linear Approximations (COBYLA) | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `coliny_direct`__ | DIviding RECTangles method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `coliny_ea`__ | Evolutionary Algorithm | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `coliny_pattern_search`__ | Pattern search, derivative free optimization method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `coliny_solis_wets`__ | Simple greedy local search method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `conmin_frcg`__ | CONMIN conjugate gradient optimization method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `conmin_mfd`__ | CONMIN method of feasible directions | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `dace`__ | Design and Analysis of Computer Experiments | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `demo_tpl`__ | Third-party optimization library integration | | | | | | demonstration. | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `dot_bfgs`__ | DOT BFGS optimization method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `dot_frcg`__ | DOT conjugate gradient optimization method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `dot_mmfd`__ | DOT modified method of feasible directions | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `dot_slp`__ | DOT Sequential Linear Program | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `dot_sqp`__ | DOT Sequential Quadratic Program | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `efficient_global`__ | Global Surrogate Based Optimization, a.k.a. EGO | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `external_python`__ | Use the external python methods interface | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `fsu_cvt`__ | Design of Computer Experiments - Centroidal Voronoi | | | | | | Tessellation | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `fsu_quasi_mc`__ | Design of Computer Experiments - Quasi-Monte Carlo | | | | | | sampling | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `function_train`__ | UQ method leveraging a functional tensor train surrogate | | | | | | model. | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `genie_direct`__ | Classical high-dimensional global Lipschitzian | | | | | | optimization Classical high-dimensional global | | | | | | Lipschitzian optimization | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `genie_opt_darts`__ | Voronoi-based high-dimensional global Lipschitzian | | | | | | optimization | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `global_evidence`__ | Evidence theory with evidence measures computed with | | | | | | global optimization methods | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `global_interval_est`__ | Interval analysis using global optimization methods | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `global_reliability`__ | Global reliability methods | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `gpais`__ | Gaussian Process Adaptive Importance Sampling | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `hybrid_sequential`__ | Methods are run one at a time, in sequence | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `import_points`__ | Imports points from file and computes statistics for them. | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `importance_sampling`__ | Importance sampling | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `list_parameter_study`__ | Samples variables as a specified values | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `local_evidence`__ | Evidence theory with evidence measures computed with local | | | | | | optimization methods | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `local_interval_est`__ | Interval analysis using local optimization | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `local_reliability`__ | Local reliability method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `mesh_adaptive_search`__ | Finds optimal variable values using adaptive mesh-based | | | | | | search | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `moga`__ | Multi-objective Genetic Algorithm (a.k.a Evolutionary | | | | | | Algorithm) | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `multi_start`__ | Multi-Start Optimization Method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `multidim_parameter_study`__ | Samples variables on full factorial grid of study points | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `multifidelity_function_train`__ | Multifidelity uncertainty quantification using function | | | | | | train expansions | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `multifidelity_polynomial_chaos`__ | Multifidelity uncertainty quantification using polynomial | | | | | | chaos expansions | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `multifidelity_sampling`__ | Multifidelity Monte Carlo sampling method for UQ | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `multifidelity_stoch_collocation`__ | Multifidelity uncertainty quantification using stochastic | | | | | | collocation | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `multilevel_blue`__ | The multilevel best linear unbiased estimator (ML BLUE) | | | | | | sampling method for UQ | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `multilevel_function_train`__ | Multilevel uncertainty quantification using function train | | | | | | expansions | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `multilevel_multifidelity_sampling`__ | Multilevel-Multifidelity sampling methods for UQ | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `multilevel_polynomial_chaos`__ | Multilevel uncertainty quantification using polynomial | | | | | | chaos expansions | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `multilevel_sampling`__ | Multilevel Monte Carlo (MLMC) sampling method for UQ | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `ncsu_direct`__ | DIviding RECTangles method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `nl2sol`__ | Trust-region method for nonlinear least squares | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `nlpql_sqp`__ | NLPQL Sequential Quadratic Program | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `nlssol_sqp`__ | Sequential Quadratic Program for nonlinear least squares | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `nonlinear_cg`__ | (Experimental) nonlinear conjugate gradient optimization | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `nowpac`__ | Gradient-free inequality-constrained optimization using | | | | | | Nonlinear Optimization With Path Augmented Constraints | | | | | | (NOWPAC). | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `npsol_sqp`__ | NPSOL Sequential Quadratic Program | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `optpp_cg`__ | A conjugate gradient optimization method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `optpp_fd_newton`__ | Finite Difference Newton optimization method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `optpp_g_newton`__ | Newton method based least-squares calbration | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `optpp_newton`__ | Newton method based optimization | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `optpp_pds`__ | Simplex-based derivative free optimization method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `optpp_q_newton`__ | Quasi-Newton optimization method | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `pareto_set`__ | Pareto set optimization | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `pof_darts`__ | Probability-of-Failure (POF) darts is a novel method for | | | | | | estimating the probability of failure based on random | | | | | | sphere-packing. | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `polynomial_chaos`__ | Uncertainty quantification using polynomial chaos | | | | | | expansions | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `psuade_moat`__ | Morris One-at-a-Time | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `richardson_extrap`__ | Estimate order of convergence of a response as model | | | | | | fidelity increases | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `rkd_darts`__ | Recursive k-d (RKD) Darts: Recursive Hyperplane Sampling | | | | | | for Numerical Integration of High-Dimensional Functions. | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `rol`__ | Rapid Optimization Library (ROL) is a large-scale | | | | | | optimization package within Trilinos. | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `sampling`__ | Randomly samples variables according to their | | | | | | distributions | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `snowpac`__ | Stochastic version of NOWPAC that incorporates error | | | | | | estimates and noise mitigation. | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `soga`__ | Single-objective Genetic Algorithm (a.k.a Evolutionary | | | | | | Algorithm) | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `stoch_collocation`__ | Uncertainty quantification with stochastic collocation | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `surrogate_based_global`__ | Adaptive Global Surrogate-Based Optimization | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `surrogate_based_local`__ | Local Surrogate Based Optimization | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `surrogate_based_uq`__ | Generic UQ method for constructing and interrogating a | | | | | | surrogate model. | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ | Required | | | `vector_parameter_study`__ | Samples variables along a user-defined vector | +-------------------------+------------------------+--------------------+---------------------------------------+------------------------------------------------------------+ .. __: method-adaptive_sampling.html __ method-approximate_control_variate.html __ method-asynch_pattern_search.html __ method-bayes_calibration.html __ method-branch_and_bound.html __ method-centered_parameter_study.html __ method-coliny_beta.html __ method-coliny_cobyla.html __ method-coliny_direct.html __ method-coliny_ea.html __ method-coliny_pattern_search.html __ method-coliny_solis_wets.html __ method-conmin_frcg.html __ method-conmin_mfd.html __ method-dace.html __ method-demo_tpl.html __ method-dot_bfgs.html __ method-dot_frcg.html __ method-dot_mmfd.html __ method-dot_slp.html __ method-dot_sqp.html __ method-efficient_global.html __ method-external_python.html __ method-fsu_cvt.html __ method-fsu_quasi_mc.html __ method-function_train.html __ method-genie_direct.html __ method-genie_opt_darts.html __ method-global_evidence.html __ method-global_interval_est.html __ method-global_reliability.html __ method-gpais.html __ method-hybrid_sequential.html __ method-import_points.html __ method-importance_sampling.html __ method-list_parameter_study.html __ method-local_evidence.html __ method-local_interval_est.html __ method-local_reliability.html __ method-mesh_adaptive_search.html __ method-moga.html __ method-multi_start.html __ method-multidim_parameter_study.html __ method-multifidelity_function_train.html __ method-multifidelity_polynomial_chaos.html __ method-multifidelity_sampling.html __ method-multifidelity_stoch_collocation.html __ method-multilevel_blue.html __ method-multilevel_function_train.html __ method-multilevel_multifidelity_sampling.html __ method-multilevel_polynomial_chaos.html __ method-multilevel_sampling.html __ method-ncsu_direct.html __ method-nl2sol.html __ method-nlpql_sqp.html __ method-nlssol_sqp.html __ method-nonlinear_cg.html __ method-nowpac.html __ method-npsol_sqp.html __ method-optpp_cg.html __ method-optpp_fd_newton.html __ method-optpp_g_newton.html __ method-optpp_newton.html __ method-optpp_pds.html __ method-optpp_q_newton.html __ method-pareto_set.html __ method-pof_darts.html __ method-polynomial_chaos.html __ method-psuade_moat.html __ method-richardson_extrap.html __ method-rkd_darts.html __ method-rol.html __ method-sampling.html __ method-snowpac.html __ method-soga.html __ method-stoch_collocation.html __ method-surrogate_based_global.html __ method-surrogate_based_local.html __ method-surrogate_based_uq.html __ method-vector_parameter_study.html **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. .. tab:: Freeform .. code-block:: dakota method dot_sqp .. tab:: JSON .. code-block:: json { "method": [{"dot_sqp": {}}] } This example uses all of the defaults for this method. A more sophisticated example would be .. tab:: Freeform .. code-block:: dakota method, id_method = 'NLP1' dot_sqp max_iterations = 50 convergence_tolerance = 1e-4 output verbose model_pointer = 'M1' .. tab:: JSON .. code-block:: json { "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. .. tab:: Freeform .. code-block:: dakota method optpp_g_newton max_iterations = 10 convergence_tolerance = 1.e-8 search_method trust_region gradient_tolerance = 1.e-6 .. tab:: JSON .. code-block:: json { "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 :ref:`topic-package_optpp`). The next example shows a specification for a nondeterministic method with several method dependent controls (refer to :dakkw:`method-sampling`). .. tab:: Freeform .. code-block:: dakota method sampling samples = 100 seed = 12345 sample_type lhs response_levels = 1000. 500. .. tab:: JSON .. code-block:: json { "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 :dakkw:`method-vector_parameter_study`). .. tab:: Freeform .. code-block:: dakota method vector_parameter_study step_vector = 1. 1. 1. num_steps = 10 .. tab:: JSON .. code-block:: json { "method": [ { "vector_parameter_study": { "step_control": { "step_vector": [1.0, 1.0, 1.0] }, "num_steps": 10 } } ] }