Christian Kirches
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Christian Kirches has a total of 114 co-authors. Here are the top co-authors by number of shared publications:
- Sebastian Sager
Institute of Mathematical Optimization, Otto-von-Guericke Universität Magdeburg, Magdeburg, Germany
13 shared publications Hans Georg Bock
Interdisciplinary Center for Scientific Computing (IWR), Heidelberg University, Heidelberg, Germany
10 shared publicationsJohannes P. Schlöder
Interdisciplinary Center for Scientific Computing, Heidelberg University, Im Neuenheimer Feld 205, 69120, Heidelberg, Germany
9 shared publications- Paul Manns
Faculty of Mathematics, TU Dortmund University, 44227 Dortmund, Germany
9 shared publications - Andreas Potschka
Institute of Mathematics Clausthal University of Technology Clausthal‐Zellerfeld Germany
7 shared publications - Artemi Makarow
Institute for Mathematical Optimization, Technische Universitt Braunschweig, Braunschweig, Germany
4 shared publications
Latest Publications
- Open Access
- 30 July 2026
- Published by Wiley in Proceedings in Applied Mathematics and Mechanics
- Vol. 26 (3) , e70166
Toward Robust Optimal Control of Chromatographic Separation Processes With Controlled Flow Reversal
Column liquid chromatography is an important technique applied in the production of biopharmaceuticals, specifically for the separation of biological macromolecules such as proteins. When setting up process conditions, it is crucial that the purity of the product is sufficiently high, even in the presence of perturbations in the process conditions, e.g., altered buffer salt concentrations. Our goal is to employ a model‐based approach for robust process optimization where we aim to safeguard the purity level of the product against uncertainties in the model parameters. Furthermore, we include the possibility of reversing the flow direction as an additional time‐dependent control degree of freedom, as a flow reversal is often performed in practice to achieve better separation. We present a strategy where a flow reversal is incorporated effectively in a mathematical model for column chromatography, eventually leading to the challenging class of mixed‐integer optimal control problems constrained by advection‐diffusion‐reaction‐type partial differential equations. Furthermore, we examine a sampling‐based strategy toward robustly optimal switching control applied to chromatographic separation processes. By means of a computational study, we discuss the quality of the presented approach and how reversing the flow direction may play a role in terms of the quality of the solutions.
- 30 July 2026
- Published by Wiley in Proceedings in Applied Mathematics and Mechanics
- Vol. 26 (3) , e70166
Open AccessToward Robust Optimal Control of Chromatographic Separation Processes With Controlled Flow Reversal
Column liquid chromatography is an important technique applied in the production of biopharmaceuticals, specifically for the separation of biological macromolecules such as proteins. When setting up process conditions, it is crucial that the purity of the product is sufficiently high, even in the presence of perturbations in the process conditions, e.g., altered buffer salt concentrations. Our goal is to employ a model‐based approach for robust process optimization where we aim to safeguard the purity level of the product against uncertainties in the model parameters. Furthermore, we include the possibility of reversing the flow direction as an additional time‐dependent control degree of freedom, as a flow reversal is often performed in practice to achieve better separation. We present a strategy where a flow reversal is incorporated effectively in a mathematical model for column chromatography, eventually leading to the challenging class of mixed‐integer optimal control problems constrained by advection‐diffusion‐reaction‐type partial differential equations. Furthermore, we examine a sampling‐based strategy toward robustly optimal switching control applied to chromatographic separation processes. By means of a computational study, we discuss the quality of the presented approach and how reversing the flow direction may play a role in terms of the quality of the solutions.
- Open Access
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 595-600
Optimal Control of Semilinear Graphon Dynamical Systems
We investigate optimal control of semilinear dynamical systems on asymptotically infinite networks, using the notion of graphons. A graphon represents a limit object of a converging graph sequence and serves as a generalization of a finite graph, enabling a systematic analysis of large-scale networks. We analyze semilinear graphon dynamical systems and establish state convergence along converging graph sequences by employing semigroup theory. Moreover, we show uniform convergence of the cost function and prove convergence of the corresponding control. In particular, we can approximate the optimal system behavior on the infinite-dimensional limit object up to arbitrary precision by solving an optimal control problem subject to dynamics on a finite graph. Numerical experiments support our theoretical results and verify our derived convergence properties.
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 595-600
Open AccessOptimal Control of Semilinear Graphon Dynamical Systems
We investigate optimal control of semilinear dynamical systems on asymptotically infinite networks, using the notion of graphons. A graphon represents a limit object of a converging graph sequence and serves as a generalization of a finite graph, enabling a systematic analysis of large-scale networks. We analyze semilinear graphon dynamical systems and establish state convergence along converging graph sequences by employing semigroup theory. Moreover, we show uniform convergence of the cost function and prove convergence of the corresponding control. In particular, we can approximate the optimal system behavior on the infinite-dimensional limit object up to arbitrary precision by solving an optimal control problem subject to dynamics on a finite graph. Numerical experiments support our theoretical results and verify our derived convergence properties.
- Open Access
- 30 January 2026
- Published by Elsevier in Energy and Buildings
- Vol. 356
Design and application of mixed-integer nonlinear model predictive control in residential buildings
- 30 January 2026
- Published by Elsevier in Energy and Buildings
- Vol. 356
Open AccessDesign and application of mixed-integer nonlinear model predictive control in residential buildings
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 1513-1518
ADMM for Block-Structured Large-Scale Quadratic Programs
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 1513-1518
Open AccessADMM for Block-Structured Large-Scale Quadratic Programs
- Open Access
- 8 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2747-2752
Exploiting Graph Convergence for Accelerated Optimization in Optimal Control of Large-Scale Networks
We exploit the convergence of graph sequences to some limit object, a graphon, to generate scalable initial estimates for optimal control of large-scale networks. We derive a state error bound under the assumptions of converging graph sequences and initial state functions and, given this bound, we propose an iterative scaleup approach to accelerate the time required for numerical solvers to reach the optimum. The idea is to scale up the optimal control solution for a network dynamical system and use it to initialize the optimal control problem for a larger structurally similar network system. The numerical results demonstrate a significant reduction of the number of optimization iterations and the optimization time for a nonlinear large-scale coupled network.
- 8 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2747-2752
Open AccessExploiting Graph Convergence for Accelerated Optimization in Optimal Control of Large-Scale Networks
We exploit the convergence of graph sequences to some limit object, a graphon, to generate scalable initial estimates for optimal control of large-scale networks. We derive a state error bound under the assumptions of converging graph sequences and initial state functions and, given this bound, we propose an iterative scaleup approach to accelerate the time required for numerical solvers to reach the optimum. The idea is to scale up the optimal control solution for a network dynamical system and use it to initialize the optimal control problem for a larger structurally similar network system. The numerical results demonstrate a significant reduction of the number of optimization iterations and the optimization time for a nonlinear large-scale coupled network.
- Open Access
- 14 August 2025
- Published by Copernicus GmbH in Wind Energy Science
- Vol. 10 (8) , 1637-1660
Integer programming for optimal yaw control of wind farms
It is well-known that wakes caused by wind turbines within a wind farm negatively impact the power generation and mechanical load of downstream turbines. This is already partially considered in the farm layout. Nevertheless, the strong interactions between individual turbines provide further opportunities to mitigate adverse effects during operation, e.g., by repeatedly adjusting axial induction or yaw offsets to wind conditions. We propose a mathematical approach that covers the farm by patterns based on a smaller, precomputable so-called upstream section, in the form of integer programming for faster globally optimal farm-level yaw control (under some mild assumptions, such as discretized yaw offsets, chosen size of the upstream section, and homogeneous layout structure). While we prove the wind farm yaw problem to be strongly 𝒩𝒫 hard in general, we demonstrate through numerical experiments that our method enables optimal farm-level yaw control under real-world control update periods. In particular, the approach remains efficient if turbines are deactivated, and it scales well with farm width.
- 14 August 2025
- Published by Copernicus GmbH in Wind Energy Science
- Vol. 10 (8) , 1637-1660
Open AccessInteger programming for optimal yaw control of wind farms
It is well-known that wakes caused by wind turbines within a wind farm negatively impact the power generation and mechanical load of downstream turbines. This is already partially considered in the farm layout. Nevertheless, the strong interactions between individual turbines provide further opportunities to mitigate adverse effects during operation, e.g., by repeatedly adjusting axial induction or yaw offsets to wind conditions. We propose a mathematical approach that covers the farm by patterns based on a smaller, precomputable so-called upstream section, in the form of integer programming for faster globally optimal farm-level yaw control (under some mild assumptions, such as discretized yaw offsets, chosen size of the upstream section, and homogeneous layout structure). While we prove the wind farm yaw problem to be strongly 𝒩𝒫 hard in general, we demonstrate through numerical experiments that our method enables optimal farm-level yaw control under real-world control update periods. In particular, the approach remains efficient if turbines are deactivated, and it scales well with farm width.
- 12 August 2025
- Published by Springer Nature
- p. 148-154
Potential of Dynamic Wind Farm Control by Axial Induction in the Case of Wind Gusts
- 12 August 2025
- Published by Springer Nature
- p. 148-154
Potential of Dynamic Wind Farm Control by Axial Induction in the Case of Wind Gusts
- Open Access
- 30 July 2025
- Published by Elsevier in Advanced Powder Technology
- Vol. 36 (9)
AI-driven soft-sensor for stirred media mills for real-time process control
- 30 July 2025
- Published by Elsevier in Advanced Powder Technology
- Vol. 36 (9)
Open AccessAI-driven soft-sensor for stirred media mills for real-time process control
- Open Access
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 877-882
Integer Control Approximations for Graphon Dynamical Systems
Graphons generalize graphs and define a limit object of a converging graph sequence. The notion of graphons allows for a generic representation of coupled network dynamical systems. We are interested in approximating integer controls for graphon dynamical systems. To this end, we apply a decomposition approach comprised of a relaxation and a reconstruction step. We extend the sum-up rounding algorithm to operate on a finite partition of the continuous vertex set in a graphon setting and restore integer feasibility for a given relaxed control solution. Finally, we derive an L1 bound for the state variables for structurally similar graphs and approximated integer controls. We verify our claims by simulating the Kuramoto model for large networks.
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 877-882
Open AccessInteger Control Approximations for Graphon Dynamical Systems
Graphons generalize graphs and define a limit object of a converging graph sequence. The notion of graphons allows for a generic representation of coupled network dynamical systems. We are interested in approximating integer controls for graphon dynamical systems. To this end, we apply a decomposition approach comprised of a relaxation and a reconstruction step. We extend the sum-up rounding algorithm to operate on a finite partition of the continuous vertex set in a graphon setting and restore integer feasibility for a given relaxed control solution. Finally, we derive an L1 bound for the state variables for structurally similar graphs and approximated integer controls. We verify our claims by simulating the Kuramoto model for large networks.
- Open Access
- 29 March 2025
- Published by Elsevier in Computers & Chemical Engineering
- Vol. 199
A homotopy for the reliable estimation of model parameters in chromatography processes
- 29 March 2025
- Published by Elsevier in Computers & Chemical Engineering
- Vol. 199
Open AccessA homotopy for the reliable estimation of model parameters in chromatography processes