TY - INPR A1 - Gugat, Martin A1 - Habermann, Jens A1 - Hintermüller, Michael A1 - Huber, Olivier T1 - Constrained exact boundary controllability of a semilinear model for pipeline gas flow N2 - While the quasilinear isothermal Euler equations are an excellent model for gas pipeline flow, the operation of the pipeline flow with high pressure and small Mach numbers allows us to obtain approximate solutions by a simpler semilinear model. We provide a derivation of the semilinear model that shows that the semilinear model is valid for sufficiently low Mach numbers and sufficiently high pressures. We prove an existence result for continuous solutions of the semilinear model that takes into account lower and upper bounds for the pressure and an upper bound for the magnitude of the Mach number of the gas flow. These state constraints are important both in the operation of gas pipelines and to guarantee that the solution remains in the set where the model is physically valid. We show the constrained exact boundary controllability of the system with the same pressure and Mach number constraints. Y1 - 2021 ER - TY - INPR A1 - Domschke, Pia A1 - Hiller, Benjamin A1 - Lang, Jens A1 - Mehrmann, Volker A1 - Morandin, Riccardo A1 - Tischendorf, Caren T1 - Gas Network Modeling: An Overview N2 - With this overview we want to provide a compilation of different models for the description of gas flow in networks in order to facilitate the introduction to the topic. Special attention is paid to the hierarchical structure inherent to the modeling, and the detailed description of individual components such as valves and compressors. Also included are network model classes based on purely algebraic relations, and energy-based port-Hamiltonian models. A short overview of basic numerical methods and concepts for the treatment of hyperbolic balance equations is also given. We do not claim completeness and refer in many places to the existing literature. The idea of a model catalog came to us in the context of the application for the CRC/Transregio 154 ``Mathematical modeling, simulation and optimization using the example of gas networks''. The present English translation is an extension from [P. Domschke, B. Hiller, J. Lang, and C. Tischendorf. Modellierung von Gasnetzwerken: Eine Übersicht. Preprint, TRR 154, 2017]. At this point we would like to thank the DFG for its support. Y1 - 2021 ER - TY - JOUR A1 - Gugat, Martin A1 - Hante, Falk A1 - Jin, Li T1 - Closed loop control of gas flow in a pipe: Stability for a transient model JF - at - Automatisierungstechnik N2 - This contribution focuses on the analysis and control of friction-dominated flow of gas in pipes. The pressure in the gas flow is governed by a partial differential equation that is a doubly nonlinear parabolic equation of p-Laplace type, where p=2/3. Such equations exhibit positive solutions, finite speed of propagation and satisfy a maximum principle. The pressure is fixed on one end (upstream), and the flow is specified on the other end (downstream). These boundary conditions determine a unique steady equilibrium flow. We present a boundary feedback flow control scheme, that ensures local exponential stability of the equilibrium in an L2-sense. The analysis is done both for the pde system and an ode system that is obtained by a suitable spatial semi-discretization. The proofs are based upon suitably chosen Lyapunov functions. Y1 - 2020 ER - TY - JOUR A1 - Hajian, Soheil A1 - Hintermüller, Michael A1 - Ulbrich, Stefan T1 - Total variation diminishing schemes in optimal control of scalar conservation laws JF - IMA Journal of Numerical Analysis N2 - In this paper, optimal control problems subject to a nonlinear scalar conservation law are studied. Such optimal control problems are challenging both at the continuous and at the discrete level since the control-to-state operator poses difficulties as it is, e.g., not differentiable. Therefore discretization of the underlying optimal control problem should be designed with care. Here the discretize-then-optimize approach is employed where first the full discretization of the objective function as well as the underlying PDE is considered. Then, the derivative of the reduced objective is obtained by using an adjoint calculus. In this paper total variation diminishing Runge-Kutta (TVD-RK) methods for the time discretization of such problems are studied. TVD-RK methods, also called strong stability preserving (SSP), are originally designed to preserve total variation of the discrete solution. It is proven in this paper that providing an SSP state scheme, is enough to ensure stability of the discrete adjoint. However requiring SSP for both discrete state and adjoint is too strong. Also approximation properties that the discrete adjoint inherits from the discretization of the state equation are studied. Moreover order conditions are derived. In addition, optimal choices with respect to CFL constant are discussed and numerical experiments are presented. Y1 - 2017 U6 - https://doi.org/10.20347/WIAS.PREPRINT.2383 VL - 39 SP - 105 EP - 140 ER - TY - JOUR A1 - Papafitsoros, Konstantinos A1 - Hintermüller, Michael A1 - Rautenberg, Carlos T1 - Analytical aspects of spatially adapted total variation regularisation JF - Journal of Mathematical Analysis and Applications N2 - In this paper we study the structure of solutions of the one dimensional weighted total variation regularisation problem, motivated by its application in signal recovery tasks. We study in depth the relationship between the weight function and the creation of new discontinuities in the solution. A partial semigroup property relating the weight function and the solution is shown and analytic solutions for simply data functions are computed. We prove that the weighted total variation minimisation problem is well-posed even in the case of vanishing weight function, despite the lack of coercivity. This is based on the fact that the total variation of the solution is bounded by the total variation of the data, a result that it also shown here. Finally the relationship to the corresponding weighted fidelity problem is explored, showing that the two problems can produce completely different solutions even for very simple data functions. Y1 - 2017 VL - 454 SP - 891 EP - 935 ER - TY - JOUR A1 - Keil, Tobias A1 - Hintermüller, Michael A1 - Wegner, Donat T1 - Optimal control of a semidiscrete Cahn-Hilliard-Navier-Stokes system with non-matched fluid densities JF - SIAM Journal on Control and Optimization N2 - This paper is concerned with the distributed optimal control of a time-discrete Cahn– Hilliard/Navier–Stokes system with variable densities. It focuses on the double-obstacle potential which yields an optimal control problem for a family of coupled systems in each time instant of a variational inequality of fourth order and the Navier–Stokes equation. By proposing a suitable time- discretization, energy estimates are proved and the existence of solutions to the primal system and of optimal controls is established for the original problem as well as for a family of regularized problems. The latter correspond to Moreau–Yosida type approximations of the double-obstacle potential. The consistency of these approximations is shown and first order optimality conditions for the regularized problems are derived. Through a limit process with respect to the regularization parameter, a stationarity system for the original problem is established. The resulting system corresponds to a function space version of C-stationarity which is a special notion of stationarity for MPECs. Y1 - 2017 VL - 55 SP - 1954 EP - 1989 ER - TY - JOUR A1 - Hintermüller, Michael A1 - Rautenberg, Carlos A1 - Mohammadi, Masoumeh A1 - Kanitsar, Martin T1 - Optimal sensor placement: A robust approach JF - SIAM Journal on Control and Optimization N2 - We address the problem of optimally placing sensor networks for convection-diffusion processes where the convective part is perturbed. The problem is formulated as an optimal control problem where the integral Riccati equation is a constraint and the design variables are sensor locations. The objective functional involves a term associated to the trace of the solution to the Riccati equation and a term given by a constrained optimization problem for the directional derivative of the previous quantity over a set of admissible perturbations. The paper addresses the existence of the derivative with respect to the convective part of the solution to the Riccati equation, the well-posedness of the optimization problem and finalizes with a range of numerical tests. Y1 - 2017 VL - 55 SP - 3609 EP - 3639 ER - TY - JOUR A1 - Gonzalez Grandon, Tatiana A1 - Heitsch, Holger A1 - Henrion, Rene T1 - A joint model of probabilistic/robust constraints for gas transport management in stationary networks JF - Computational Management Science N2 - We present a novel mathematical algorithm to assist gas network operators in managing uncertainty, while increasing reliability of transmission and supply. As a result, we solve an optimization problem with a joint probabilistic constraint over an infinite system of random inequalities. Such models arise in the presence of uncertain parameters having partially stochastic and partially non-stochastic character. The application that drives this new approach is a stationary network with uncertain demand (which are stochastic due to the possibility of fitting statistical distributions based on historical measurements) and with uncertain roughness coefficients in the pipes (which are uncertain but non-stochastic due to a lack of attainable measurements). We study the sensitivity of local uncertainties in the roughness coefficients and their impact on a highly reliable network operation. In particular, we are going to answer the question, what is the maximum uncertainty that is allowed (shaping a 'maximal' uncertainty set) around nominal roughness coefficients, such that random demands in a stationary gas network can be satisfied at given high probability level for no matter which realization of true roughness coefficients within the uncertainty set. One ends up with a constraint, which is probabilistic with respect to the load of gas and robust with respect to the roughness coefficients. We demonstrate how such constraints can be dealt with in the framework of the so-called spheric-radial decomposition of multivariate Gaussian distributions. The numerical solution of a corresponding optimization problem is illustrated. The results might assist the network operator with the implementation of cost-intensive roughness measurements. KW - chance constraint KW - robust constraint KW - uncertainty set KW - spheric-radial decomposition Y1 - 2017 U6 - https://doi.org/10.1007/s10287-017-0284-7 VL - 14 SP - 443 EP - 460 ER - TY - INPR A1 - Huck, Christoph A1 - Tischendorf, Caren T1 - Perturbation analysis of hyperbolic PDAEs describing flow networks Y1 - 2017 ER - TY - CHAP A1 - Benner, Peter A1 - Grundel, Sarah A1 - Himpe, Christian A1 - Huck, Christoph A1 - Streubel, Tom A1 - Tischendorf, Caren T1 - Gas Network Benchmark Models T2 - Applications of Differential-Algebraic Equations: Examples and Benchmarks N2 - The simulation of gas transportation networks becomes increasingly more important as its use-cases broaden to more complex applications. Classically, the purpose of the gas network was the transportation of predominantly natural gas from a supplier to the consumer for long-term scheduled volumes. With the rise of renewable energy sources, gas-fired power plants are often chosen to compensate for the fluctuating nature of the renewables, due to their on-demand power generation capability. Such an only short-term plannable supply and demand setting requires sophisticated simulations of the gas network prior to the dispatch to ensure the supply of all customers for a range of possible scenarios and to prevent damages to the gas network. In this work we describe the modeling of gas networks and present benchmark systems to test implementations and compare new or extended models. Y1 - 2017 U6 - https://doi.org/10.1007/11221_2018_5 VL - DAE-FORUM SP - 171 EP - 197 PB - Springer CY - Cham ER - TY - CHAP A1 - Huck, Christoph A1 - Tischendorf, Caren T1 - Transient Modeling and Simulation of Gas Pipe Networks with Characteristic Diagram Models for Compressors T2 - Proceedings in Applied Mathematics and Mechanics N2 - One challenge for the simulation and optimization of real gas pipe networks is the treatment of compressors. Their behavior is usually described by characteristic diagrams reflecting the connection of the volumetric flow and the enthalpy change or shaft torque. Such models are commonly used for an optimal control of compressors and compressor stations [4, 7] using stationary models for the gas flow through the pipes. For transient simulations of gas networks, simplified compressor models have been studied in [1–3]. Here, we present a transient simulation of gas pipe networks with characteristic diagram models of compressors using a stable network formulation as (partial) differential-algebraic system. Y1 - 2017 U6 - https://doi.org/10.1002/pamm.201710322 VL - 17 IS - 1 SP - 707 EP - 708 ER - TY - JOUR A1 - Hintermüller, Michael A1 - Strogies, Nikolai T1 - On the consistency of Runge--Kutta methods up to order three applied to the optimal control of scalar conservation laws JF - Numerical Analysis and Optimization N2 - Higher-order Runge-Kutta (RK) time discretization methods for the optimal control of scalar conservation laws are analyzed and numerically tested. The hyperbolic nature of the state system introduces specific requirements on discretization schemes such that the discrete adjoint states associated with the control problem converge as well. Moreover, conditions on the RK-coefficients are derived that coincide with those characterizing strong stability preserving Runge-Kutta methods. As a consequence, the optimal order for the adjoint state is limited, e.g., to two even in the case where the conservation law is discretized by a third-order method. Finally, numerical tests for controlling Burgers equation validate the theoretical results. Y1 - 2017 U6 - https://doi.org/10.20347/WIAS.PREPRINT.2442 SP - 119 EP - 154 ER - TY - JOUR A1 - Hintermüller, Michael A1 - Rautenberg, Carlos A1 - Strogies, Nikolai T1 - Dissipative and Non-dissipative Evolutionary Quasi-variational Inequalities with Gradient Constraints JF - Set-Valued and Variational Analysis N2 - Evolutionary quasi-variational inequality (QVI) problems of dissipative and non-dissipative nature with pointwise constraints on the gradient are studied. A semi-discretization in time is employed for the study of the problems and the derivation of a numerical solution scheme, respectively. Convergence of the discretization procedure is proven and properties of the original infinite dimensional problem, such as existence, extra regularity and non-decrease in time, are derived. The proposed numerical solver reduces to a finite number of gradient-constrained convex optimization problems which can be solved rather efficiently. The paper ends with a report on numerical tests obtained by a variable splitting algorithm involving different nonlinearities and types of constraints. Y1 - 2017 VL - 27 SP - 433 EP - 468 ER - TY - INPR A1 - Domschke, Pia A1 - Hiller, Benjamin A1 - Lang, Jens A1 - Tischendorf, Caren T1 - Modellierung von Gasnetzwerken: Eine Übersicht N2 - Mit dieser Übersicht wollen wir eine Zusammenstellung von unterschiedlichen Modellen zur Beschreibung des Gasflusses in Netzwerken bereitstellen, um den Einstieg in das Thema zu erleichtern. Besonderes Augenmerk wird dabei auf die der Modellierung inneliegende hierarchische Struktur und die detaillierte Beschreibung einzelner Bauteile wie Ventile und Kompressoren gelegt. Daneben finden sich ebenfalls Netzmodellklassen, die auf rein algebraische Relationen aufbauen. Am Ende geben wir einen kurzen Überblick über grundlegende numerische Verfahren und Konzepte zur Behandlung von hyperbolischen Bilanzgleichungen. Wir erheben keinen Anspruch auf Vollständigkeit und verweisen an vielen Stellen auf die bestehende Literatur. Die Idee eines Modellkataloges ist uns im Rahmen der Antragstellung zum SFB/Transregio 154 „Mathematische Modellierung, Simulation und Optimierung am Beispiel von Gasnetzwerken“ gekommen. Wir möchten an dieser Stelle die Förderung durch die DFG dankend erwähnen. KW - Euler-Gleichungen, isotherme Euler-Gleichungen, Modellhierarchie, Netzelemente Y1 - 2017 VL - 2717 ER - TY - JOUR A1 - Leövey, Hernan A1 - Heitsch, Holger A1 - Römisch, Werner T1 - Are Quasi-Monte Carlo algorithms efficient for two-stage stochastic programs? JF - Computational Optimization and Applications N2 - Quasi-Monte Carlo algorithms are studied for designing discrete approximations of two-stage linear stochastic programs with random right-hand side and continuous probability distribution. The latter should allow for a transformation to a distribution with independent marginals. The two-stage integrands are piecewise linear, but neither smooth nor lie in the function spaces considered for QMC error analysis. We show that under some weak geometric condition on the two-stage model all terms of their ANOVA decomposition, except the one of highest order, are continuously differentiable and that first and second order ANOVA terms have mixed first order partial derivatives and belong to L2 . Hence, randomly shifted lattice rules (SLR) may achieve the optimal rate of convergence O(n−1+δ ) with δ ∈ (0, 12 ] and a constant not depending on the dimension if the effective superposition dimension is at most two. We discuss effective dimensions and dimension reduction for two-stage integrands. The geometric condition is shown to be satisfied almost everywhere if the underlying probability distribution is normal and principal component analysis (PCA) is used for transforming the covariance matrix. Numerical experiments for a large scale two-stage stochastic production planning model with normal demand show that indeed convergence rates close to the optimal are achieved when using SLR and randomly scrambled Sobol’ point sets accompanied with PCA for dimension reduction. Y1 - 2016 U6 - https://doi.org/10.1007/s10589-016-9843-z VL - 65 IS - 3 SP - 567 EP - 603 ER - TY - JOUR A1 - Hintermüller, Michael A1 - Surowiec, Thomas T1 - A Bundle-Free Implicit Programming Approach for a Class of MPECs in Function Space JF - Mathematical Programming N2 - Using a standard first-order optimality condition for nonsmooth optimization prob- lems, a general framework for a descent method is developed. This setting is applied to a class of mathematical programs with equilibrium constraints in function space from which a new algorithm is derived. Global convergence of the algorithm is demonstrated in function space and the results are then illustrated by numerical experiments. Y1 - 2017 U6 - https://doi.org/10.1007/s10107-016-0983-9 VL - 160 IS - 1-2 SP - 271 EP - 305 ER - TY - JOUR A1 - Hintermüller, Michael A1 - Surowiec, Thomas T1 - On the Directional Differentiability of the Solution Mapping for a Class of Variational Inequalities of the Second Kind JF - Set-Valued and Variational Analysis N2 - The directional differentiability of the solution mapping for a class of variational inequali- ties of the second kind inspired by applications in fluid mechanics and moving free boundary problems is investigated. The result is particularly relevant for the model predictive control or optimal control of such variational inequalities in that it can be used to derive stationarity conditions and efficient numerical methods. Y1 - 2017 U6 - https://doi.org/10.1007/s11228-017-0408-9 VL - 26 SP - 631 EP - 642 ER - TY - THES A1 - Huck, Christoph T1 - Perturbation analysis and numerical discretisation of hyperbolic partial differential algebraic equations describing flow networks N2 - This thesis addresses several aspects regarding modelling, analysis and numerical simulation of gas networks. Hereby, our focus lies on (partial) differential-algebraic equations, thus systems of partial and ordinary differential equations which are coupled by algebraic equations. These coupled systems allow an easy approach towards the modelling of dynamic structures on networks. Therefore, they are well suited for gas networks, which have gained a rise of attention in society, politics and science due to the focus towards renewable energies. We give an introduction towards gas network modelling that includes the most common elements that also appear in real gas networks and present two PDAE systems: One for pipe networks and one that includes additional elements like resistors and compressors. Furthermore, we investigate the impact of perturbations onto the pipe network PDAE, where we explicitly allow perturbations to affect the system in the differential as well as in the algebraic components. We conclude that the solution of the PDAE possesses stability properties. In addition, this thesis introduces a new spatial discretisation that is adapted to the net- work topology. This topology-adapted semi-discretisation results in a DAE which possesses the same perturbation behaviour as the space continuous PDAE. Furthermore, we present a topology based decoupling procedure that allows to reformulate the DAE as an ordinary differential equation (ODE), which represents the inherent dynamics of the DAE system. This ODE, together with a decoupled set of algebraic equations, can be derived from the topology and element information directly. We conclude by demonstrating the established results for several benchmark networks. This includes a comparison of numerical solutions for the decoupled ODE and the DAE system. In addition we present the advantages of the topology-adapted spatial discretisation over existing well established methods. Y1 - 2018 U6 - https://doi.org/10.18452/19596 ER - TY - INPR A1 - Shyshkanova, Ganna A1 - Walther, Andrea T1 - Contact Pressure over Doubly Connected Rectangular Domains and Punch Shape Optimization N2 - Contact problems arise in a variety of industrial processes, engineering and biomechanical systems. 3-D contact problem for a rigid punch with a doubly connected base bounded by the lines close to rectangles is in consideration. An analytic-numerical technique is developed for its solving. The problem contains Fredholm integral equations of the first kind, which are transformed into the second kind by means of regularization. Using the simple layer potential expansion, the kernels of the integrals are presented in the form of expansions in the powers of the polar radius. The difference between the values of the desired function at different points and the subsequent interpolation of the terms are proposed to smooth the kernels and eliminate singularities. The integral equations are reduced to one-dimension and then solved using quadrature formulas. Subsequently a punch shape is taken as a desired function, and as a minimizing functional is considered the root-mean-square deviation of the pressure distribution arising under the punch from some optimal distribution. In this case, the values of the total forces and moments applied to the punch are assumed to be given, which leads to restrictions imposed on the distributions by the equilibrium conditions. The normal displacements are determined which arising under the action of the found contact pressure on the elastic half-space. The desired punch shape is found using the simple layer potential. A solution to the problem is obtained for the punch with the doubly connected base bounded by lines close to rectangles. KW - contact problem KW - shape optimization KW - simple layer potential KW - integral equations Y1 - 2022 ER - TY - JOUR A1 - Kreimeier, Timo A1 - Kuchlbauer, Martina A1 - Liers, Frauke A1 - Stingl, Michael A1 - Walther, Andrea T1 - Towards the Solution of Robust Gas Network Optimization Problems Using the Constrained Active Signature Method N2 - This work studies robust gas network optimization under uncertainties in demand and in the physical parameters. The corresponding optimization problems are nonconvex in node pressures and flows along the pipes. They are thus very difficult to solve for realistic instance sizes. In recent approaches, an adaptive bundle method has been developed, where one solves the occurring adversarial problems via iteratively refined piecewise linear relaxations. These subproblems need to be solved always from scratch using mixed-integer linear programming (MIP). As alternative to the MIP solver, we employ here a nonsmooth optimization approach that allows a warm start strategy such that it can profit from the results obtained for coarser relaxations. We evaluate the approach for realistic gas network topologies and outline possibilities for future research. Y1 - 2022 ER - TY - INPR A1 - Gahururu, Deborah A1 - Hintermüller, Michael A1 - Surowiec, Thomas T1 - Risk-Neutral PDE-Constrained Generalized Nash Equilibrium Problems N2 - A class of risk-neutral PDE-constrained generalized Nash equilibrium problems is introduced in which the feasible strategy set of each player is subject to a common linear elliptic partial differential equation with random inputs. In addition, each player’s actions are taken from a bounded, closed, and convex set on the individual strategies and a bound constraint on the common state variable. Existence of Nash equilibria and first-order optimality conditions are derived by exploiting higher integrability and regularity of the random field state variables and a specially tailored constraint qualification for GNEPs with the assumed structure. A relaxation scheme based on the Moreau-Yosida approximation of the bound constraint is proposed, which ultimately leads to numerical algorithms for the individual player problems as well as the GNEP as a whole. The relaxation scheme is related to probability constraints and the viability of the proposed numerical algorithms are demonstrated via several examples. Y1 - 2021 ER - TY - INPR A1 - Geiersbach, Caroline A1 - Hintermüller, Michael T1 - Optimality conditions and Moreau–Yosida regularization for almost sure state constraints N2 - We analyze a potentially risk-averse convex stochastic optimization problem, where the control is deterministic and the state is a Banach-valued essentially bounded random variable. We obtain strong forms of necessary and sufficient optimality conditions for problems subject to equality and conical constraints. We propose a Moreau–Yosida regularization for the conical constraint and show consistency of the optimality conditions for the regularized problem as the regularization parameter is taken to infinity. Y1 - 2021 ER - TY - INPR A1 - Hante, Falk T1 - Relaxation methods for optimal switching control of PDE-dynamical systems N2 - The chapter reviews certain computational approaches to solve optimal control problems for evolution-type partial differential equations, where some control functions are limited to switching. The mechanism that enforces switching is modeled as integer restrictions. This brings a combinatorial aspect into the apart from switching already computationally very demanding optimization problems. Recently, great advances have been made to tackle such problems rigorously using relaxation and combinatorial integral approximation. An overview of these methods and the known theoretical results concerning convergence and error estimates are provided in a consistent manner. Further, we point to applications with benchmark character as well as to open problems. Y1 - ER - TY - INPR A1 - Kreimeier, Timo A1 - Sauter, Henning A1 - Streubel, Tom A1 - Tischendorf, Caren A1 - Walther, Andrea T1 - Solving Least-Squares Collocated Differential Algebraic Equations by Successive Abs-Linear Minimization - A Case Study on Gas Network Simulation N2 - This paper studies the numerical simulation of gas networks with regulating elements using differential algebraic equations (DAEs) in combination with least-squares collocation. In contrast to classical collocation methods, more collocation points than degrees of freedom for the collocation polynomials are used. Recently, it has been shown that such a least-squares collocation has a regularizing effect for DAEs, in particular for DAEs with higher index. In each time step of the numerical integration, one has to solve a system of nonlinear equations that is nonsmooth due to the regulating elements in the gas networks. We consider four solvers one of which explicitly exploits the inherent nonsmooth nature. Numerical results are given for three different test cases with increasing complexity illustrating the feasibility of the proposed approach to approximate a solution of the DAE and the advantageous performance of the nonsmooth solver that is based on the concept of abs-linearization. KW - Abs-smooth Algorithmic Differentiation KW - Numerical Integration KW - Simulation of Gas Transportation Networks KW - Nonsmooth Optimization KW - SALMIN KW - Least-Squares Collocation Method KW - Target Values KW - Set Point Values KW - Controlling Regulators and Compressors Y1 - 2021 ER - TY - INPR A1 - Sauter, Henning A1 - Tischendorf, Caren T1 - Optimal control of gas network DAEs Y1 - 2021 ER - TY - INPR A1 - Sauter, Henning A1 - Tischendorf, Caren T1 - Least squares collocation for the simulation of gas network DAEs Y1 - 2021 ER - TY - INPR A1 - Hante, Falk A1 - Krug, Richard A1 - Schmidt, Martin T1 - Time-Domain Decomposition for Mixed-Integer Optimal Control Problems N2 - We consider mixed-integer optimal control problems, whose optimality conditions involve global combinatorial optimization aspects for the corresponding Hamiltonian pointwise in time. We propose a time-domain decomposition, which makes this problem class accessible for mixed-integer programming using parallel-in-time direct discretizations. The approach is based on a decomposition of the optimality system and the interpretation of the resulting subproblems as suitably chosen mixed-integer optimal control problems on subintervals in time. An iterative procedure then ensures continuity of the states at the boundaries of the subintervals via co-state information encoded in virtual controls. We prove convergence of this iterative scheme for discrete-continuous linear-quadratic problems and present numerical results both for linear-quadratic as well as nonlinear problems. KW - Mixed-integer optimal control problems KW - Time-domain decomposition KW - Mixed-integer nonlinear optimization KW - Convergence Y1 - 2021 ER - TY - INPR A1 - Huck, Christoph A1 - Tischendorf, Caren T1 - Topology motivated discretization of hyperbolic PDAEs describing flow networks KW - PDAE KW - DAE KW - Index KW - discretization Y1 - 2017 ER - TY - INPR A1 - Schmidt, Martin A1 - Hiller, Benjamin A1 - Koch, Thorsten A1 - Pfetsch, Marc A1 - Geißler, Björn A1 - Henrion, René A1 - Joormann, Imke A1 - Martin, Alexander A1 - Morsi, Antonio A1 - Römisch, Werner A1 - Schewe, Lars A1 - Schultz, Rüdiger A1 - Steinbach, Marc C. T1 - Capacity Evaluation for Large-Scale Gas Networks N2 - Natural gas is important for the energy turnaround in many countries like in Germany, where it serves as a "bridging energy" towards a fossil-free energy supply in the future. About 20% of the total German energy demand is provided by natural gas, which is transported through a complex pipeline network with a total length of about 30000 km and the efficient use of the given transport infrastructure for natural gas is of political, economic, and societal importance. As a consequence of the liberalization of the European gas market in the last decades, gas trading and transport have been decoupled. This has led to new challenges for gas transport companies, and mathematical optimization is perfectly suited for tackling many of these challenges. However, the underlying mathematical problems are by far too hard to be solved by today's general-purpose software so that novel mathematical theory and algorithms are needed. The industrial research project "ForNe: Research Cooperation Network Optimization" has been initiated and funded by Open Grid Europe in 2009 and brought together experts in mathematical optimization from seven German universities and research institutes, which cover almost the entire range of mathematical optimization: integer and nonlinear optimization as well as optimization under uncertainty. The mathematical research results have been put together in a software package that has been delivered to Open Grid Europe at the end of the project. Moreover, the research is still continuing - e.g., in the Collaborative Research Center/Transregio 154 "Mathematical Modelling, Simulation and Optimization using the Example of Gas Networks" funded by the German Research Foundation. Y1 - 2019 ER - TY - INPR A1 - Klimm, Max A1 - Pfetsch, Marc E. A1 - Raber, Rico A1 - Skutella, Martin T1 - Packing under Convex Quadratic Constraints N2 - We consider a general class of binary packing problems with a convex quadratic knapsack constraint. We prove that these problems are APX-hard to approximate and present constant-factor approximation algorithms based upon three different algorithmic techniques: (1) a rounding technique tailored to a convex relaxation in conjunction with a non-convex relaxation whose approximation ratio equals the golden ratio; (2) a greedy strategy; (3) a randomized rounding method leading to an approximation algorithm for the more general case with multiple convex quadratic constraints. We further show that a combination of the first two strategies can be used to yield a monotone algorithm leading to a strategyproof mechanism for a game-theoretic variant of the problem. Finally, we present a computational study of the empirical approximation of the three algorithms for problem instances arising in the context of real-world gas transport networks. Y1 - 2019 ER - TY - INPR A1 - Klimm, Max A1 - Pfetsch, Marc A1 - Raber, Rico A1 - Skutella, Martin T1 - On the Robustness of Potential-Based Flow Networks N2 - Potential-based flows provide a simple yet realistic mathematical model of transport in many real-world infrastructure networks such as, e.g., electricity, gas, or water networks, where the flow along each edge is controlled via the (difference of) potentials at its end nodes. A potential-based flow network is robust if the maximal difference of node potentials needed to satisfy a set of demands cannot increase if demands are decreased. This notion of robustness is motivated by infrastructure networks where users first make reservations for certain demands that may be larger than the actual amounts sent later on. Here node potentials correspond to physical quantities such as the pressures or the voltages and must be guaranteed to lie within a fixed range, even if the actual amounts are smaller than the previously reserved demands. Our main results are a precise characterization of such robust networks for the case of point-to-point demands via forbidden node-labeled graph minors, as well as an efficient algorithm for testing robustness. Y1 - 2019 ER - TY - JOUR A1 - Adelhütte, Dennis A1 - Aßmann, Denis A1 - Gonzàlez Grandòn, Tatiana A1 - Gugat, Martin A1 - Heitsch, Holger A1 - Liers, Frauke A1 - Henrion, René A1 - Nitsche, Sabrina A1 - Schultz, Rüdiger A1 - Stingl, Michael A1 - Wintergerst, David T1 - Joint model of probabilistic/robust (probust) constraints applied to gas network optimization N2 - Optimization tasks under uncertain conditions abound in many real-life applications. Whereas solution approaches for probabilistic constraints are often developed in case the uncertainties can be assumed to follow a certain probability distribution, robust approaches are usually used in case solutions are sought that are feasible for all realizations of uncertainties within some pre-defined uncertainty set. As many applications contain different types of uncertainties that require robust as well as probabilistic treatments, we deal with a class of joint probabilistic/robust constraints as its appears in optimization problems under uncertainty. Focusing on complex uncertain gas network optimization problems, we show the relevance of this class of problems for the task of maximizing free booked capacities in an algebraic model for a stationary gas network. We furthermore present approaches for their solution. Finally, we study the problem of controlling a transient system that is governed by the wave equation. The task consists in determining controls such that a certain robustness measure remains below some given upper bound, with high probability. KW - robust optimization KW - chance constraints KW - optimal control KW - spheric-radial decomposition Y1 - 2017 U6 - https://doi.org/10.1007/s10013-020-00434-y ER - TY - JOUR A1 - Hintermüller, Michael A1 - Strogies, Nikolai T1 - Identification of the friction function in a semilinear system for gas transport through a network JF - Optimization Methods and Software N2 - An identification problem for the friction parameter in a semilinear system of balance laws, describing the transport of gas through a passive network of pipelines, is considered. The existence of broad solutions to the state system is proven and sensitivity results for the corresponding solution operator are obtained. The existence of solutions to the output least squares formulation of the identification problem, based on noisy measurements over time at fixed spatial positions is established. Finally, numerical experiments validate the theoretical findings. Y1 - 2017 VL - 35 SP - 576 EP - 617 ER - TY - INPR A1 - Brodskyi, Yan A1 - Hante, Falk A1 - Seidel, Arno T1 - Stabilization of Partial Differential Equations by Sequential Action Control N2 - We extend the framework of sequential action control to systems of partial differential equations which can be posed as abstract linear control problems in a Hilbert space. We follow a late-lumping approach and show that the control action can be explicitly obtained from variational principles using adjoint information. Moreover, we analyze the closed-loop system obtained from the SAC feedback for quadratic stage costs. We apply this theory prototypically to an unstable heat equation and verify the results numerically. Y1 - 2019 ER - TY - JOUR A1 - Göttlich, Simone A1 - Hante, Falk A1 - Potschka, Andreas A1 - Schewe, Lars T1 - Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints JF - Mathematical Programming N2 - We consider mixed-integer optimal control problems with combinatorial constraints that couple over time such as minimum dwell times. We analyze a lifting and decomposition approach into a mixed-integer optimal control problem without combinatorial constraints and a mixed-integer problem for the combinatorial constraints in the control space. Both problems can be solved very efficiently with existing methods such as outer convexification with sum-up-rounding strategies and mixed-integer linear programming techniques. The coupling is handled using a penalty-approach. We provide an exactness result for the penalty which yields a solution approach that convergences to partial minima. We compare the quality of these dedicated points with those of other heuristics amongst an academic example and also for the optimization of electric transmission lines with switching of the network topology for flow reallocation in order to satisfy demands. Y1 - 2019 ER - TY - JOUR A1 - Hajian, Soheil A1 - Hintermüller, Michael A1 - Schillings, Claudia A1 - Strogies, Nikolai T1 - A Bayesian approach to parameter identification in gas networks JF - Control and Cybernetics N2 - The inverse problem of identifying the friction coefficient in an isothermal semilinear Euler system is considered. Adopting a Bayesian approach, the goal is to identify the distribution of the quantity of interest based on a finite number of noisy measurements of the pressure at the boundaries of the domain. First well-posedness of the underlying non-linear PDE system is shown using semigroup theory, and then Lipschitz continuity of the solution operator with respect to the friction coefficient is established. Based on the Lipschitz property, well-posedness of the resulting Bayesian inverse problem for the identification of the friction coefficient is inferred. Numerical tests for scalar and distributed parameters are performed to validate the theoretical results. Y1 - 2018 VL - 48 SP - 377 EP - 402 ER - TY - JOUR A1 - Hanke, Michael A1 - März, Roswitha A1 - Tischendorf, Caren T1 - Least-Squares Collocation for Higher-Index Linear Differential-Algebraic Equations: Estimating the Instability Threshold JF - Math. Comp. N2 - Differential-algebraic equations with higher index give rise to essentially ill-posed problems. The least-squares collocation by discretizing the pre-image space is not much more computationally expensive than standard collocation methods used in the numerical solution of ordinary differential equations and index-1 differential-algebraic equations. This approach has displayed excellent convergence properties in numerical experiments, however, theoretically, till now convergence could be established merely for regular linear differential-algebraic equations with constant coefficients. We present now an estimate of the instability threshold which serves as the basic key for proving convergence for general regular linear DAEs. KW - differential-algebraic equation, higher index, essentially ill-posed problem, collocation, boundary value problem, initial value problem Y1 - 2017 U6 - https://doi.org/10.1090/mcom/3393 VL - 88 SP - 1647 EP - 1683 ER - TY - INPR A1 - Hante, Falk M. A1 - Schmidt, Martin T1 - Gas Transport Network Optimization: Mixed-Integer Nonlinear Models N2 - Although modern societies strive towards energy systems that are entirely based on renewable energy carriers, natural gas is still one of the most important energy sources. This became even more obvious in Europe with Russia's 2022 war against the Ukraine and the resulting stop of gas supplies from Russia. Besides that it is very important to use this scarce resource efficiently. To this end, it is also of significant relevance that its transport is organized in the most efficient, i.e., cost- or energy-efficient, way. The corresponding mathematical optimization models have gained a lot of attention in the last decades in different optimization communities. These models are highly nonlinear mixed-integer problems that are constrained by algebraic constraints and partial differential equations (PDEs), which usually leads to models that are not tractable. Hence, simplifications have to be made and in this chapter, we present a commonly accepted finite-dimensional stationary model, i.e., a model in which the steady-state solutions of the PDEs are approximated with algebraic constraints. For more details about the involved PDEs and the treatment of transient descriptions we refer to Hante and Schmidt (2023). The presented finite-dimensional as well as mixed-integer nonlinear and nonconvex model is still highly challenging if it needs to be solved for real-world gas transport networks. Hence, we also review some classic solution approaches from the literature. KW - Gas networks KW - Mixed-integer nonlinear optimization KW - Mixed-integer linear optimization KW - Nonlinear optimization Y1 - 2023 ER - TY - INPR A1 - Kreimeier, Timo A1 - Pokutta, Sebastian A1 - Walther, Andrea A1 - Woodstock, Zev T1 - On a Frank-Wolfe Approach for Abs-smooth Functions N2 - We propose an algorithm which appears to be the first bridge between the fields of conditional gradient methods and abs-smooth optimization. Our nonsmooth nonconvex problem setting is motivated by machine learning, since the broad class of abs-smooth functions includes, for instance, the squared $\ell_2$-error of a neural network with ReLU or hinge Loss activation. To overcome the nonsmoothness in our problem, we propose a generalization to the traditional Frank-Wolfe gap and prove that first-order minimality is achieved when it vanishes. We derive a convergence rate for our algorithm which is identical to the smooth case. Although our algorithm necessitates the solution of a subproblem which is more challenging than the smooth case, we provide an efficient numerical method for its partial solution, and we identify several applications where our approach fully solves the subproblem. Numerical and theoretical convergence is demonstrated, yielding several conjectures. KW - Frank-Wolfe algorithm KW - Active Signature Method KW - abs-smooth functions KW - nonsmooth optimization KW - convergence rate Y1 - 2022 ER - TY - JOUR A1 - Shyshkanova, Ganna A1 - Zaytseva, Tetyana A1 - Zhushman, V A1 - Levchenko, Ntaliia A1 - Korotunova, Olena T1 - Solving three-dimensional contact problems for foundation design in green building N2 - Design of foundations on an elastic base is carried out using the solution of three-dimensional problems of contact interaction. Improving the accuracy of engineering calculations is necessary to ensure economic efficiency and increase energy savings in green building. The problems of indentation of punches with a flat base bounded by doubly connected close to polygonal contact areas are researched in the present work. Small parameter method is used to obtain explicit analytical expressions for the contact pressure distribution and the punch displacement dependence in a simplified form, which is convenient for engineering practice. The found load-displacement dependence satisfies the known inequalities that are valid for an arbitrary contact domain. Also a numerical-analytical method is in consideration. It uses the simple layer potential expansion and successive approximations for the problems accounting roughness of the elastic half-space. Roughness coefficient is considered as a parameter of regularization of the integral equation for the smooth contact problem. The results of both methods coincide with sufficient accuracy. Y1 - 2023 U6 - https://doi.org/10.1088/1742-6596/2609/1/012001 ER - TY - INPR A1 - Kannan, Aswin A1 - Kreimeier, Timo A1 - Walther, Andrea T1 - On Solving Nonsmooth Retail Portfolio Maximization Problems Using Active Signature Methods Y1 - 2023 ER - TY - INPR A1 - Hante, Falk A1 - Kuchler, Christian T1 - Indirect methods for optimal control of hybrid PDE-dynamical / switching systems using relaxation N2 - We propose a novel algorithmic approach to computationally solve optimal control problems governed by linear evolution-type PDEs including a state-dependent control-regime switching mechanism. We introduce an equivalent mixed-integer formulation featuring vanishing constraints arising by methods of disjunctive programming. We embed the problem into the class of equilibrium constraints by introduction of an additional slack variable. Based on theoretical results associated with Sum-Up-Rounding strategies, we proceed with the solution of the related relaxed formulation by an indirect approach. In order to obtain a computationally tractable optimality system, we apply a Moreau-Yosida type penalty approach of the vanishing constraints. After the theoretical discussion, we introduce and exert the algorithmic framework founded on a semismooth Newton method. Finally, we communicate computational experiments based on our approach. Y1 - ER - TY - INPR A1 - Hante, Falk M. A1 - Schmidt, Martin T1 - Gas Transport Network Optimization: PDE-Constrained Models N2 - The optimal control of gas transport networks was and still is a very important topic for modern economies and societies. Accordingly, a lot of research has been carried out on this topic during the last years and decades. Besides mixed-integer aspects in gas transport network optimization, one of the main challenges is that a physically and technically detailed modeling of transient gas dynamics leads to theoretically and computationally highly demanding models involving nonlinear partial differential equations (PDEs). For further background on the application, historical notes and a detailed discussion of mixed-integer aspects for stationary descriptions we refer to Hante and Schmidt (2023). In this chapter, we focus on the most common modeling approaches concerning transient descriptions, point out the challenges, and summarize important contributions concerning the optimization of the most relevant control parameters for this particular class of problems. KW - Gas networks KW - Partial differential equations KW - Optimal control KW - PDE-constrained optimization KW - Modeling Y1 - 2023 ER - TY - INPR A1 - Bongarti, Marcelo A1 - Hintermüller, T1 - Optimal boundary control of the isothermal semilinear Euler equation for gas dynamics on a network N2 - The analysis and boundary optimal control of the nonlinear transport of gas on a network of pipelines is considered. The evolution of the gas distribution on a given pipe is modeled by an isothermal semilinear compressible Euler system in one space dimension. On the network, solutions satisfying (at nodes) the Kirchhoff flux continuity conditions are shown to exist in a neighborhood of an equilibrium state. The associated nonlinear optimization problem then aims at steering such dynamics to a given target distribution by means of suitable (network) boundary controls while keeping the distribution within given (state) constraints. The existence of local optimal controls is established and a corresponding Karush-Kuhn-Tucker (KKT) stationarity system with an almost surely non-singular Lagrange multiplier is derived. KW - optimal boundary control KW - gas dynamics KW - gas networks KW - isothermal Euler equation KW - compressible fluid dynamics Y1 - 2023 ER - TY - INPR A1 - Kreimeier, Timo A1 - Walther, Andrea A1 - Griewank, Andreas T1 - An active signature method for constrained abs-linear minimization N2 - In this paper we consider the solution of optimization tasks with a piecewise linear objective function and piecewise linear constraints. First, we state optimality conditions for that class of problems using the abs-linearization approach and prove that they can be verified in polynomial time. Subsequently, we propose an algorithm called Constrained Active Signature Method that explicitly exploits the piecewise linear structure to solve such optimization problems. Convergence of the algorithm within a finite number of iterations is proven. Numerical results for various testcases including linear complementarity conditions and a bi-level problem illustrate the performance of the new algorithm. Y1 - 2021 ER - TY - INPR A1 - Hante, Falk A1 - Kuchler, Christian T1 - An Algorithmic Framework for Optimal Control of Hybrid Dynamical System with Parabolic PDEs N2 - We present an algorithmic approach for the computational solution of optimal control problems with hybrid nature governed by linear parabolic PDEs featuring implicit switches. We propose a stepwise reformulation of the original formulation into a more tractable setting via application of methods from disjunctive programming and a time transformation method. After removal of the implicit switching rule at the cost of the introduction of explicit switching variables and vanishing constraints, the connection of the resulting formulation to problems with equilibrium constraints is established and studied. The previous steps in combination with smoothening and a Moreau-Yosida type penalty approach allow the derivation of necessary first order optimality conditions to characterize candidates for optimality to the original system. Following the discussion of each individual reformulation step, we introduce the algorithmic framework founded on a semismooth Newton method. Finally, we report on computational of the proposed framework. Y1 - 2023 ER - TY - JOUR A1 - Shyshkanova, Ganna A1 - Walther, Andrea T1 - Optimization of a punch shape with a doubly connected contact domain N2 - The objective is to optimize the pressure distribution under a rigid punch having a doubly connected contact domain close to a circular ring and interacting with an elastic half-space. The required design variable is the punch shape. The functional to be minimized is the root-mean-square deviation of the pressure distribution from some given distribution. An analytical technique is developed for solving the problem for the punches with doubly connected shape, by reducing to a sequence of similar problems for the circular ring punches using expansions of the simple layer potential. The method of expansion in terms of a small parameter is used. The simple layer potential expansion is proposed when mapping a doubly connected integration domain onto a circular ring by transforming the integration variables and transforming the coordinates of the pole of the kernel. As a result, a sequence of similar problems was obtained for a circular ring to determine the functions characterizing the distribution of normal pressure under the punch in the form of a non-circular ring, as well as the normal displacements, from where the optimal punch shape is determined. Y1 - 2023 ER - TY - INPR A1 - Graser, Gertrud A1 - Kreimeier, Timo A1 - Walther, Andrea T1 - Solving Linear Generalized Nash Games Using an Active Signature Method N2 - We propose a method to solve linear generalized Nash equilibrium problems (LGNEPs). For this purpose, a reformulation of the LGNEPs as piecewise linear problems is considered. This requires the calculation of all vertices for a special kind of unbounded convex polyhedra. Then the active signature method for constrained abs-linear problems can be used to determine the Nash equilibria. We analyse the computational effort for the resulting solution procedure. This includes also the verification of suitable optimality conditions. Finally, we present and analyse numerical results for some test problems. Y1 - 2024 ER - TY - INPR A1 - Domschke, Pia A1 - Giesselmann, Jan A1 - Lang, Jens A1 - Breiten, Tobias A1 - Mehrmann, Volker A1 - Morandin, Riccardo A1 - Hiller, Benjamin A1 - Tischendorf, Caren T1 - Gas Network Modeling: An Overview (Extended English Version) N2 - With this overview we want to provide a compilation of different models for the description of gas flow in networks in order to facilitate the introduction to the topic. Special attention is paid to the hierarchical structure inherent to the modeling, and the detailed description of individual components such as valves and compressors. Also included are network model classes based on purely algebraic relations, and energy-based port-Hamiltonian models. A short overview of basic numerical methods and concepts for the treatment of hyperbolic balance equations is also given. We do not claim completeness and refer in many places to the existing literature. Y1 - 2023 ER - TY - INPR A1 - Hante, Falk M. A1 - Schmidt, Martin A1 - Topalovic, Antonia T1 - Stabilizing GNEP-Based Model Predictive Control: Quasi-GNEPs and End Constraints N2 - We present a feedback scheme for non-cooperative dynamic games and investigate its stabilizing properties. The dynamic games are modeled as generalized Nash equilibrium problems (GNEP), in which the shared constraint consists of linear time-discrete dynamic equations (e.g., sampled from a partial or ordinary differential equation), which are jointly controlled by the players’ actions. Further, the individual objectives of the players are interdependent and defined over a fixed time horizon. The feedback law is synthesized by moving-horizon model predictive control (MPC). We investigate the asymptotic stability of the resulting closed-loop dynamics. To this end, we introduce α-quasi GNEPs, a family of auxiliary problems based on a modification of the Nikaido–Isoda function, which approximate the original games. Basing the MPC scheme on these auxiliary problems, we derive conditions on the players’ objectives, which guarantee asymptotic stability of the closed-loop if stabilizing end constraints are enforced. This analysis is based on showing that the associated optimal-value function is a Lyapunov function. Additionally, we identify a suitable Lyapunov function for the MPC scheme based on the original GNEP, whose solution fulfills the stabilizing end constraints. The theoretical results are complemented by numerical experiments. KW - Model predictive control KW - Non-cooperative distributed control KW - Closed-loop stability KW - Generalized Nash equilibrium problems Y1 - 2024 ER -