Dakota Reference Manual  Version 6.4
Large-Scale Engineering Optimization and Uncertainty Analysis
 All Pages

Uses a sequential quadratic programming method for underlying optimization


Alias: none

Argument(s): none


Many uncertainty quantification methods solve a constrained optimization problem under the hood. The sqp keyword directs Dakota to use a sequential quadratic programming method to solve that problem. A sequential quadratic programming solves a sequence of linearly constrained quadratic optimization problems to arrive at the solution to the optimization problem.