next up previous contents
Next: Detailed description of the Up: A short review of Previous: Primal-dual interior point   Contents

The final choice of a constrained algorithm

We will choose ``approach 1". To cope with box and linear constraints, we will use an active set/null-space strategy. Non-linear constraints are handled using an SQP method in the reduced-space of the active constraints. The SQP method require a QP (quadratical program) in order to work.
In the next chapter, we will see a detailed description of this algorithm.

Frank Vanden Berghen 2004-04-19