Nonlinear
Equality Constraints
To handle nonlinear equality constraints, RFSQP incorporates
a modification of a scheme due to Mayne & Polak. Equality
constraints

are
turned into inequality constraints

The
algorithm generates iterates that are feasible for the new
inequalities Negative values are penalized, i.e. the objective
function is replaced with

where

are
positive penalty parameters (iteratively increased, but bounded).
The
result is a differentiable exact penalty function.
Back
to the top
Send
mail to webmaster@aemdesign.com
with questions or comments about this web site.
Last modified:
February 21, 2005
|