Print Email Facebook Twitter Investigation of Different Solvers for Radiotherapy Treatment Planning Problems Title Investigation of Different Solvers for Radiotherapy Treatment Planning Problems Author Ruckstuhl, Y.M. Contributor Keijzer, M. (mentor) Breedveld, S. (mentor) Faculty Electrical Engineering, Mathematics and Computer Science Department Applied mathematics Date 2014-11-27 Abstract 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. Subject barrier method To reference this document use: http://resolver.tudelft.nl/uuid:13d72d18-cee1-4b32-8a97-36301c6b5bcd Part of collection Student theses Document type master thesis Rights (c) 2014 Ruckstuhl, Y.M. Files PDF mscThesisY.Ruckstuhl.pdf 1.64 MB Close viewer /islandora/object/uuid:13d72d18-cee1-4b32-8a97-36301c6b5bcd/datastream/OBJ/view