| Optimization Toolbox | |
Optimization Overview
Optimization techniques are used to find a set of design parameters, 
, that can in some way be defined as optimal. In a simple case this might be the minimization or maximization of some system characteristic that is dependent on x. In a more advanced formulation the objective function, f(x), to be minimized or maximized, might be subject to constraints in the form of equality constraints,
; inequality constraints,
; and/or parameter bounds, 
.
A General Problem (GP) description is stated as
|
(3-1) |
where x is the vector of design parameters (
), f(x) is the objective function that returns a scalar value (
), and the vector function G(x) returns the values of the equality and inequality constraints evaluated at x (
).
An efficient and accurate solution to this problem depends not only on the size of the problem in terms of the number of constraints and design variables but also on characteristics of the objective function and constraints. When both the objective function and the constraints are linear functions of the design variable, the problem is known as a Linear Programming (LP) problem. Quadratic Programming (QP) concerns the minimization or maximization of a quadratic objective function that is linearly constrained. For both the LP and QP problems, reliable solution procedures are readily available. More difficult to solve is the Nonlinear Programming (NP) problem in which the objective function and constraints can be nonlinear functions of the design variables. A solution of the NP problem generally requires an iterative procedure to establish a direction of search at each major iteration. This is usually achieved by the solution of an LP, a QP, or an unconstrained subproblem.
| | Standard Algorithms | Unconstrained Optimization | |