Philipp Süss
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Philipp Süss has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Karl-Heinz Küfer
Optimization Department, Fraunhofer ITWM, Fraunhofer-Platz 1, Kaiserslautern, 67663, Germany
4 shared publications- Karl-Heinz Küfer
Department of Optimization, Fraunhofer Institute for Industrial Mathematics (ITWM), Kaiserslautern, Germany
4 shared publications - Ina Lammel
Department of Optimization, Fraunhofer Institute for Industrial Mathematics (ITWM), Kaiserslautern, Germany
2 shared publications - Michael Bortz
Fraunhofer Institute for Industrial Mathematics ITWM, Fraunhofer-Platz 1, 67663 Kaiserslautern, Germany
2 shared publications - Aviv Gibali
Department of Mathematics ORT Braude College 2161002 Karmiel Israel
1 shared publication Christian Thieke
1 shared publication
Latest Publications
- Open Access
- 25 January 2026
Multi-Criteria Inverse Robustness in Radiotherapy Planning Using Semidefinite Programming
Radiotherapy planning naturally leads to a multi-criteria optimization problem which is subject to different sources of uncertainty. In order to find the desired treatment plan, a decision maker must balance these objectives as well as the level of robustness towards uncertainty against each other. This paper showcases a quantitative approach to do so, which combines the theoretical model with the ability to deal with practical challenges. To this end, the uncertainty, which can be expressed via the so-called dose-influence matrix, is modelled using interval matrices. We use inverse robustness to introduce an additional objective, which aims to maximize the volume of the uncertainty set. A multi-criteria approach allows to handle the uncertainty while keeping appropriate values of the other objective functions. We solve the resulting quadratically constrained quadratic optimization problem (QCQP) by first relaxing it to a convex semidefinite problem (SDP) and then reconstructing optimal solutions of the QCQP from solutions of the SDP.
- 25 January 2026
Open AccessMulti-Criteria Inverse Robustness in Radiotherapy Planning Using Semidefinite Programming
Radiotherapy planning naturally leads to a multi-criteria optimization problem which is subject to different sources of uncertainty. In order to find the desired treatment plan, a decision maker must balance these objectives as well as the level of robustness towards uncertainty against each other. This paper showcases a quantitative approach to do so, which combines the theoretical model with the ability to deal with practical challenges. To this end, the uncertainty, which can be expressed via the so-called dose-influence matrix, is modelled using interval matrices. We use inverse robustness to introduce an additional objective, which aims to maximize the volume of the uncertainty set. A multi-criteria approach allows to handle the uncertainty while keeping appropriate values of the other objective functions. We solve the resulting quadratically constrained quadratic optimization problem (QCQP) by first relaxing it to a convex semidefinite problem (SDP) and then reconstructing optimal solutions of the QCQP from solutions of the SDP.
- Open Access
Multi-Criteria Inverse Robustness in Radiotherapy Planning Using Semidefinite Programming
Radiotherapy planning naturally leads to a multi-criteria optimization problem which is subject to different sources of uncertainty. In order to find the desired treatment plan, a decision maker must balance these objectives as well as the level of robustness towards uncertainty against each other. This paper showcases a quantitative approach to do so, which combines the theoretical model with the ability to deal with practical challenges. To this end, the uncertainty, which can be expressed via the so-called dose-influence matrix, is modelled using interval matrices. We use inverse robustness to introduce an additional objective, which aims to maximize the volume of the uncertainty set. A multi-criteria approach allows to handle the uncertainty while keeping appropriate values of the other objective functions. We solve the resulting quadratically constrained quadratic optimization problem (QCQP) by first relaxing it to a convex semidefinite problem (SDP) and then reconstructing optimal solutions of the QCQP from solutions of the SDP.
Open AccessMulti-Criteria Inverse Robustness in Radiotherapy Planning Using Semidefinite Programming
Radiotherapy planning naturally leads to a multi-criteria optimization problem which is subject to different sources of uncertainty. In order to find the desired treatment plan, a decision maker must balance these objectives as well as the level of robustness towards uncertainty against each other. This paper showcases a quantitative approach to do so, which combines the theoretical model with the ability to deal with practical challenges. To this end, the uncertainty, which can be expressed via the so-called dose-influence matrix, is modelled using interval matrices. We use inverse robustness to introduce an additional objective, which aims to maximize the volume of the uncertainty set. A multi-criteria approach allows to handle the uncertainty while keeping appropriate values of the other objective functions. We solve the resulting quadratically constrained quadratic optimization problem (QCQP) by first relaxing it to a convex semidefinite problem (SDP) and then reconstructing optimal solutions of the QCQP from solutions of the SDP.
- 23 January 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 204 (3) , 1-21
Efficient Approximation Quality Computation for Sandwiching Algorithms for Convex Multicriteria Optimization
- 23 January 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 204 (3) , 1-21
Efficient Approximation Quality Computation for Sandwiching Algorithms for Convex Multicriteria Optimization
- Open Access
- 29 July 2024
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 100 (1) , 321-350
An approximation algorithm for multiobjective mixed-integer convex optimization
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.
- 29 July 2024
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 100 (1) , 321-350
Open AccessAn approximation algorithm for multiobjective mixed-integer convex optimization
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.
- Open Access
- 24 June 2024
- Published by Elsevier in Applied Energy
- Vol. 371
Pareto navigation for multicriteria building energy supply design
- 24 June 2024
- Published by Elsevier in Applied Energy
- Vol. 371
Open AccessPareto navigation for multicriteria building energy supply design
- Open Access
- 31 March 2023
- Published by Wiley in Chemie Ingenieur Technik
- Vol. 95 (7) , 1028-1040
Real‐Time Interactive Navigation on Input‐Output Data Sets in Chemical Processes
- 31 March 2023
- Published by Wiley in Chemie Ingenieur Technik
- Vol. 95 (7) , 1028-1040
Open AccessReal‐Time Interactive Navigation on Input‐Output Data Sets in Chemical Processes
- 2 March 2018
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 70 (3) , 737-762
A generalized projection-based scheme for solving convex constrained optimization problems
- 2 March 2018
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 70 (3) , 737-762
A generalized projection-based scheme for solving convex constrained optimization problems
- 27 February 2013
- Published by IOP Publishing in Physics in Medicine & Biology
- Vol. 58 (6) , 1855-1867
The critical spot eraser—a method to interactively control the correction of local hot and cold spots in IMRT planning
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.
- 27 February 2013
- Published by IOP Publishing in Physics in Medicine & Biology
- Vol. 58 (6) , 1855-1867
The critical spot eraser—a method to interactively control the correction of local hot and cold spots in IMRT planning
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.
- 1 March 2008
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 428 (5-6) , 1388-1405
Balancing control and simplicity: A variable aggregation method in intensity modulated radiation therapy planning
- 1 March 2008
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 428 (5-6) , 1388-1405
Balancing control and simplicity: A variable aggregation method in intensity modulated radiation therapy planning