2 March 2018 in Computational Optimization and Applications
27 February 2013 in Physics in Medicine & Biology
Common problems in inverse radiotherapy planning are localized dose insufficiencies like hot spots in organs at risk or cold spots inside targets. These are hard to correct since the optimization is based on global evaluations like maximum/minimum doses, equivalent uniform doses or dose-volume constraints for whole structures. In this work, we present a new approach to locally correct the dose of any given treatment plan. Once a treatment plan has been found that is acceptable in general but requires local corrections, these areas are marked by the planner. Then the system generates new plans that fulfil the local dose goals. Consequently, it is possible to interactively explore all plans between the locally corrected plans and the original treatment plan, allowing one to exactly adjust the degree of local correction and how the plan changes overall. Both the amount (in Gy) and the size of the local dose change can be navigated. The method is introduced formally as a new mathematical optimization setting, and is evaluated using a clinical example of a meningioma at the base of the skull. It was possible to eliminate a hot spot outside the target volume while controlling the dose changes to all other parts of the treatment plan. The proposed method has the potential to become the final standard step of inverse treatment planning.
23 January 2025 in Journal of Optimization Theory and Applications
29 July 2024 in Mathematical Methods of Operations Research
In this article we introduce an algorithm that approximates the nondominated sets of multiobjective mixed-integer convex optimization problems. The algorithm constructs an inner and outer approximation of the front exploiting the convexity of the patches for problems with an arbitrary number of criteria. In the algorithm, the problem is decomposed into patches, which are multiobjective convex problems, by fixing the integer assignments. The patch problems are solved using (simplicial) Sandwiching. We identify parts of patches that are dominated by other patches and ensure that these patch parts are not refined further. We prove that the algorithm converges and show a bound on the reduction of the approximation error in the course of the algorithm. We illustrate the behaviour of our algorithm using some numerical examples and compare its performance to an algorithm from literature.
1 March 2008 in Linear Algebra and its Applications
24 June 2024 in Applied Energy