AbstractsBiology & Animal Science

Radiotherapy treatment planning involves solving inequality constrained minimization problems. The currently used interior point solver performs well, but is considered relatively slow. In this thesis we investigate two different solvers based on the logarithmic barrier method and Sequential Quadratic Programming (SQP) respectively. We argue that the behaviour of the logarithmic barrier solver is uncertain, thereby making it generally unreliable in this context. In addition we substantiate that the performance of the SQP solver is solid, but lacks efficiency in computing the minimizers of its related quadratic subproblems. We conclude that without serious improvements, none of the solvers investigated are faster than the currently used interior point optimizer.