Dakota Reference Manual: sqp

| Dakota Reference Manual Version 6.15 Explore and Predict with Confidence

- Main Page
- Related Pages

All Pages
sqp

Uses a sequential quadratic programming method for underlying optimization

## Specification

Alias: none

Argument(s): none

## Description

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.