arXiv subjects

Katrin Teichert

Publications and source records attributed to Katrin Teichert.

6 recordsLinked to original sources

arXiv2026

Bi-level Multi-criteria Optimization for Risk-informed Radiotherapy

In radiation therapy (RT) treatment planning, multi-criteria optimization (MCO) supports efficient plan selection but is usually solved for population-based dosimetric criteria and ignores patient-specific biological risk, potentially compromising outcomes in high-risk patients. We propose risk-guided MCO, a one-shot method that embeds a clinical risk model into conventional MCO, enabling interactive navigation between dosimetric and biological endpoints. The proposed algorithm uses a special order relation to fuse the classical MCO sandwiching algorithm with bi-level optimization, restricting the Pareto set to plans that achieve improvement in the secondary risk objective for user-defined, acceptable loss in primary clinical objectives. Thus, risk-guided MCO generates risk-optimized counterparts of clinical plans in a single run rather than by sequential or lexicographic planning. To assess the performance, we retrospectively analyzed 19 lung cancer patients treated with RT. The endpoint was the risk of grade 2+ radiation pneumonitis (RP), modeled using bootstrapped stepwise logistics regression with interaction terms, including baseline lung function, smoking history, and dosimetric factors. The risk-guided plans yielded a mean reduction of 8.0% in total lung V20 and 9.5% in right lung V5, translating into an average RP risk reduction of 7.7% (range=0.3%-20.1%), with small changes in target coverage (mean -1.2 D98[%] for CTV) and modest increase in heart dose (mean +1.74 Gy). This study presents the first proof-of-concept for integrating biological risk models directly within multi-criteria RT planning, enabling an interactive balance between established population-wide dose protocols and individualized outcome prediction. Our results demonstrate that the risk-informed MCO can reduce the risk of RP while maintaining target coverage.

physics.med-ph↗

arXiv2025

On Computing and Pricing of Adjustable Robust Chemical Process Designs

Model-based process simulation can be used to derive designs and operating conditions of chemical processes that optimally balance multiple objectives, such as quality, costs, or environmental impacts. This work focuses on identifying designs that hedge against uncertainties in model parameters to ensure feasibility, taking the possibility to adjust operating conditions into account. An adaptive scheme is proposed to pinpoint the relevant scenarios in a discretized uncertainty space; these scenarios are then fed into a multi-objective adjustable robust optimization framework reducing the computational burden compared to the consideration of all potential scenarios. Furthermore, we propose a method to quantify the cost or price of robustness, i.e., the compromise which has to be made in comparison to the nominal design case in order to hedge against uncertainty. The conceptual findings are illustrated with an industrially relevant case study.

math.OC↗

arXiv2025

Pareto-optimal treatment of uncertainties in model-based process design and operation

Model-based process design and operation involves here-and-now and wait-and-see decisions. Here-and-now decisions include design variables like the size of heat exchangers or the height of distillation columns, whereas wait-and-see decisions are directed towards operational variables like reflux and split ratios. In this contribution, we describe how to deal with these different types of decisions in a multicriteria framework, offering an adjustability for the wait-and-see variables while at the same time respecting optimality guarantees on process KPIs.

math.OC↗

arXiv2024

Multicriteria Adjustable Robustness

Multicriteria adjustable robust optimization (MARO) problems arise in a wide variety of practical settings, for example, in the design of a building's energy supply. However, no general approaches, neither for the characterization of solutions to this problem class, nor potential solution methods, are available in the literature so far. We give different definitions for efficient solutions to MARO problems and look at three computational concepts to deal with the problems. These computational concepts can also be understood as additional solution definitions. We assess the advantages and disadvantages of the different computational approaches and analyze their connections to our initial definitions of MARO-efficiency. We observe that an $\varepsilon$-constraint inspired first-scalarize-then-robustify computational approach is beneficial because it provides an efficient set that is easy to understand for decision makers and provides tight bounds on the worst-case evaluation for a particular efficient solution. In contrast, a weighted sum first-scalarize-then-robustify approach keeps the problem structure more simple but is only beneficial if the desired trade-off between objectives is already known because the efficient set might look ambiguous. Further, we demonstrate that a first-robustify procedure only gives bad bounds and can be too optimistic as well as too pessimistic.

math.OC↗

arXiv2020

Simulation and optimal control of the Williams-Otto process using Pyomo

We illustrate the advantages the high-level open-source software package Pyomo has in rapidly setting up and solving dynamic simulation and optimization problems. In order to do so, we use the example of the Williams-Otto process. We show how to simulate the process dynamics using the collocation method and the IPOPT solver provided by Pyomo. We also discuss waste minimization and yield maximization as two examplary process optimization problems. And finally, we present and compare two approaches to setpoint tracking: one based on proportional-integral feedback control and one based on optimal open-loop control.

math.OC↗

arXiv2020

An improved hyperboxing algorithm for calculating a Pareto front representation

When solving optimization problems with multiple objective functions we are often faced with the situation that one or several objective functions are non-convex or that we can not easily show the convexity of all functions involved. In this case a general algorithm for computing a representation of the nondominated set is required. A suitable approach consists in a so-called hyperboxing algorithm that is characterized by splitting the objective space into axis-parallel hyperrectangles. Thereby, only the property of nondominance is exploited for reducing the so-called search region. In the literature such an algorithm has already shown to provide a very good coverage of the Pareto front relative to the number of representation points calculated. However, the computational cost for the algorithm was prohibitive for problems with more than five objectives. In this paper, we present algorithmic advances that improve the performance of the algorithm and make it applicable to problems with up to nine objectives. We illustrate the performance gain and the quality of the representation for a set of test problems. We also apply the improved algorithm to a real world problem in the field of radiotherapy planning.

math.OC↗