TY - JOUR A1 - Filipkovska, Maria T1 - Qualitative analysis of nonregular differential-algebraic equations and the dynamics of gas networks N2 - Conditions for the existence, uniqueness and boundedness of global solutions, as well as ultimate boundedness of solutions, and conditions for the blow-up of solutions of nonregular semilinear differential-algebraic equations have been obtained. An example demonstrating the application of the obtained results has been considered. Isothermal models of gas networks have been proposed as applications. KW - nonregular differential-algebraic equation KW - degenerate differential equation KW - singular pencil KW - gas network KW - global solvability Y1 - 2023 U6 - https://doi.org/https://doi.org/10.15407/mag19.04.719 VL - 19 IS - 4 SP - 719 EP - 765 ER - TY - INPR A1 - Alldredge, Graham A1 - Frank, Martin A1 - Giesselmann, Jan T1 - On the convergence of the regularized entropy-based moment method for kinetic equations N2 - The entropy-based moment method is a well-known discretization for the velocity variable in kinetic equations which has many desirable theoretical properties but is difficult to implement with high-order numerical methods. The regularized entropy-based moment method was recently introduced to remove one of the main challenges in the implementation of the entropy-based moment method, namely the requirement of the realizability of the numerical solution. In this work we use the method of relative entropy to prove the convergence of the regularized method to the original method as the regularization parameter goes to zero and give convergence rates. Our main assumptions are the boundedness of the velocity domain and that the original moment solution is Lipschitz continuous in space and bounded away from the boundary of realizability. We provide results from numerical simulations showing that the convergence rates we prove are optimal. Y1 - 2023 U6 - https://doi.org/https://doi.org/10.5802/smai-jcm.93 VL - 9 ER - TY - INPR A1 - Hante, Falk A1 - Kuchler, Christian T1 - Indirect methods for optimal control of parabolic hybrid PDE-dynamical / switching systems using relaxation N2 - We propose a novel algorithmic approach to computationally solve optimal control problems governed by linear parabolic partial differential equations (PDEs) including a state-dependent control-regime switching mechanism. We state an equivalent mixed-integer formulation featuring vanishing constraints (VCs) arising from methods of disjunctive programming. We embed the problem into the class of equilibrium constraints (ECs) by introduction of an additional slack variable. Based on theoretical results associated with Sum-Up-Rounding (SUR) 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 for the VCs. After a theoretical discussion, we introduce and exert the algorithmic framework founded on a semismooth Newton method. Finally, we communicate computational experiments based on the proposed approach. Y1 - ER - TY - INPR A1 - Grimm, Veronika A1 - Grübel, Julia A1 - Schmidt, Martin A1 - Schwartz, Alexandra A1 - Wiertz, Ann-Kathrin A1 - Zöttl, Gregor T1 - On a Tractable Single-Level Reformulation of a Multilevel Model of the European Entry-Exit Gas Market with Market Power N2 - We propose a framework that allows to quantitatively analyze the interplay of the different agents involved in gas trade and transport in the context of the European entry-exit system. Previous contributions have focused on the case of perfectly competitive buyers and sellers of gas, which allows to replace the respective market equilibrium problem by a single welfare maximization problem. Our novel framework considers the mathematically more challenging case of a monopolistic and thus strategic gas seller. In this framework, the objective functions of the gas sellers and buyers cannot be aggregated into a common objective function, which is why a multilevel formulation is necessary to accurately capture the sequential nature of the decisions taken. For this setup, we derive sufficient conditions that allow for reformulating the challenging four-level model as a computationally tractable single-level reformulation. We prove the correctness of this reformulation and use it for solving several test instances to illustrate the applicability of our approach. KW - Multilevel optimization KW - Reformulations KW - Gas markets KW - Market power Y1 - 2023 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 - THES A1 - Krug, Richard T1 - Decomposition Methods for Time-Dependent Mixed-Integer Nonlinear Optimization Problems on Graphs N2 - Decomposition can be the method of choice to deal with optimization problems that contain hard to solve model structures or that are of large scale. The main idea is to decompose the problematic aspects of the problem into multiple smaller blocks that can be solved more easily. Here, the challenge is to combine the single pieces to a solution that is not only feasible but maybe even optimal for the original problem. In many cases, this can be done by introducing an iteration that eventually converges to a desired solution. In this cumulative dissertation, we present several iterative decomposition methods that are tailored to different types of optimization models and use distinct approaches to split up the problems. Our main motivation for this originates from the optimization of gas transport networks, where we encounter partial differential equations as well as discrete control decisions. Additionally, we engage in the related field of district heating network optimization to study the challenges arising from large-scale and fully discretized systems as well as undesirable model features such as, e.g., complementarity constraints. Here, we introduce two temperature mixing models that are well suited for optimization and a number of techniques to speed up the solution process, which are applied in numerical experiments. As a next step, we develop an iterative time-domain decomposition method that is applied to optimal control problems subject to semilinear hyperbolic systems of partial differential equations. For this, we derive first-order optimality conditions that are then split using a non-overlapping decomposition of the time horizon. We exploit the fact that the resulting systems have a primal interpretation as so-called virtual control problems. We prove the convergence of the iterative method and develop a posteriori error estimates. Later, we extend the scheme to systems of ordinary differential equations with mixed- integer controls by using Pontryagin’s maximum principle. We again show the convergence and conduct a numerical case study. Moreover, we use a consensus-based version of the classic penalty alternating direction method to solve tailored reformulations of transient gas network problems that allow us to minimize the number of coupling constraints between sub-problems. Here, we utilize the quasi-separable structure of the network to decompose it into sub-networks with more desirable properties. We also discuss different decomposition strategies and test them in a numerical case study. Finally, we present a successive linear relaxation method for mixed-integer nonlinear problems with multivariate Lipschitz continuous nonlinearities. The distinguishing feature of this algorithm is that it exploits no properties of the nonlinearities besides the Lipschitz constants. Therefore, the method is applicable for problems with non-convex or even non-differentiable constraints. The nonlinearities do not even need to be given in a closed form, which allows us to integrate black-box constraints into the model. We prove that the algorithm converges to an approximate global optimum and we provide a worst-case estimate for the number of iterations. The iterative method is applied to stationary gas transport problems, where implicitly given solutions of the differential equations are modeled via black-box constraints. Y1 - 2023 ER - TY - JOUR A1 - Ouanes, Nesrine A1 - González Grandón, Tatiana A1 - Heitsch, Holger A1 - Henrion, René T1 - Optimizing the economic dispatch of weakly-connected mini-grids under uncertainty using joint chance constraints N2 - In this paper, we deal with a renewable-powered mini-grid, connected to an unreliable main grid, in a Joint Chance Constrained (JCC) programming setting. In many countries with low energy access rates, grid-connected mini-grid system operators contend with four different types of uncertainties: stochastic solar power and demand forecast errors; absolute uncertain national grid outage onset times; and outages duration subjected to statistical analysis. These uncertainties pose new challenges to the classical power system’s operation tasks. Two alternatives to the JCC problem are presented. In particular, we present an Individual Chance Constraint (ICC) and a purely deterministic dispatch model. The JCC model has the capability to address all four uncertainties, while the ICC covers only three of them, overlooking the uncertainty about the outage duration. In contrast, the purely deterministic model completely ignores any uncertain parameters. We illustrate the three models through a comparison of outcomes attained from a real mini-grid in Lake Victoria, Tanzania. Results show how the dispatch is modified across the models to plan the battery and diesel reserves in the chance-constrained models, with the reserves in the JCC being larger than in the ICC model. In comparison between all models, we prove that the JCC model offers the most robust results, since it can handle uncertainties about forecasting errors, on the one hand, and grid outages, on the other. The results also show that the decrease in profits due to the hedging with reserves kept in the MG is significantly small compared to the high level of reliability reached and the potential load shedding that could be avoided in the case of an outage. 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 - Goerigk, Marc A1 - Kurtz, Jannis A1 - Schmidt, Martin A1 - Thürauf, Johannes T1 - Connections between Robust and Bilevel Optimization N2 - Robust and bilevel optimization share the common feature that they involve a certain multilevel structure. Hence, although they model something rather different when used in practice, they seem to have a similar mathematical structure. In this paper, we analyze the connections between different types of robust problems (static robust problems with and without decision-dependence of their uncertainty sets, worst-case regret problems, and two-stage robust problems) as well as of bilevel problems (optimistic problems, pessimistic problems, and robust bilevel problems). It turns out that bilevel optimization seems to be more general in the sense that for most types of robust problems, one can find proper reformulations as bilevel problems but not necessarily the other way around. We hope that these results pave the way for a stronger connection between the two fields - in particular to use both theory and algorithms from one field in the other and vice versa. KW - Bilevel optimization KW - Robust optimization KW - Reformulations Y1 - 2023 ER - TY - INPR A1 - Gugat, Martin A1 - Qian, Meizhi A1 - Sokolowski, Jan T1 - Topological derivative method for control of wave equation on networks N2 - The dynamical, boundary optimal control problems on networks are considered. The domain of definition for the distributed parameter system is given by a graph G. The optimal cost function for control problem is further optimized with respect to the shape and topology of the graph Ω. The small cycle is introduced and the topological derivative of the cost with respect to the size of the cycle is determined. In this way, the singular perturbations of the graph can be analyzed in order to change the topology Ω. The topological derivative method in shape and topology optimization is a new tool which can be used to minimize the shape functionals under the Partial Differential Equations (PDEs) constraints. The topological derivative is used as well for solution of optimum design problems for graphs. In optimal control problems the topological derivative is used for optimum design of the domain of integration of the state equation. As an example, optimal control problems are considered on a cross with a small cycle. The state equation is the wave equation on the graph. The boundary control problem by Neumann conditions at a boundary vertex is solved for a tracking cost function. The shape functional is given by the optimal value of the control cost. The topological derivative of the shape functional is determined for the steady state model with the size of a cycle ε → 0. Numerical results for a model problem are presented. KW - distributed parameter system KW - optimal control KW - shape optimization KW - topological derivative KW - network modelling Y1 - 2023 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 - 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 - INPR A1 - Göß, Adrian A1 - Martin, Alexander A1 - Pokutta, Sebastian A1 - Sharma, Kartikey T1 - Norm-induced Cuts: Optimization with Lipschitzian Black-box Functions N2 - Optimal control problems usually involve constraints which model physical states and their possible transitions. These are represented by ordinary or partial differential equations (ODEs/PDEs) which add a component of infinite dimension to the problem. In recent literature, one method to simulate such ODEs/PDEs are physics-informed neural networks. Typically, neural networks are highly non-linear which makes their addition to optimization problems challenging. Hence, we leverage their often available Lipschitz property on a compact domain. The respective Lipschitz constants have to be computed only once and are accessible thereafter. We present a method that, based on this property, iteratively adds cuts involving the violation of the constraints by the current incumbent and the Lipschitz constant. Hereby, the “shape” of a cut depends on the norm used. We prove the correctness of the method by showing that it either returns an optimal solution when terminating or creates a sequence with optimal accumulation points. This is complemented by a discussion about the termination in the infeasible case, as well as an analysis of the problem complexity. For the analysis, we show that the lower and upper iteration bound asymptotically coincide when the relative approximation error goes to zero. In the end, we visualize the method on a small example based on a two-dimensional non-convex optimization problem, as well as stress the necessity of having a globally optimal oracle for the sub-problems by another example. KW - Global Optimization KW - Lipschitz Optimization KW - Black-box Optimization KW - Derivative-free Optimization Y1 - 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 - JOUR A1 - Gugat, Martin A1 - Lazar, Martin T1 - Turnpike Properties for Partially Uncontrollable Systems N2 - We analyse the turnpike properties for a general, infinite dimensional, linear-quadratic (LQ) optimal control problem, both in the deterministic and in the stochastic case. The novelty of the paper is twofold. Firstly, it obtains positive turnpike results for systems that are (partially) uncontrollable. Secondly, it provides turnpike results for averaged control associated to a family of problems that depend on a random parameter, which is the first turnpike type result in the averaged controllability framework. KW - Measure Turnpike KW - Averaged Control KW - LQ optimal control problem KW - Infinite-time admissibility KW - Turnpike phenomenon Y1 - 2023 VL - Automatica IS - 149 ER - TY - INPR A1 - Schuster, Michael A1 - Sakamoto, Noboru T1 - A Turnpike Result for Optimal Boundary Control Problems with the Transport Equation under Uncertainty N2 - In this paper we analyze the turnpike phenomenon for optimal boundary control problems with a linear transport equation with source term. The convex objective function depends on the boundary traces of the transport equation and is strictly convex with respect to the boundary control. We show an integral turnpike result for an optimal Dirichlet boundary control problem in the sense that if the time horizon goes to infinity, then the dynamic optimal control converges to the corresponding steady state optimal control. The novelty of this work is two-sided. On the one hand, even if turnpike results for this kind of optimal boundary control problem already exist, we present a new direct proof without using adjoint calculus that leads to sharper estimates. On the other hand we consider uncertainty in the initial data and/or in the source term. We show that the integral turnpike result also holds considering uncertainty. Throughout the paper we use numerical examples to illustrate the results. KW - Turnpike KW - Boundary Control KW - Transport Equation KW - Random Boundary Data Y1 - 2023 ER - TY - JOUR A1 - Egerer, Jonas A1 - Grimm, Veronika A1 - Niazmand, Kiana A1 - Runge, Philipp T1 - The economics of global green ammonia trade – "Shipping Australian wind and sunshine to Germany" JF - Applied Energy N2 - This paper contributes to understanding the transformation of global energy trade to green energy carriers, focusing on green ammonia as the foreseeable first green hydrogen carrier. We provide a comprehensive overview of today's ammonia trade and assess scaling options for the trade of green ammonia. To that aim, we develop an optimization model for the integrated assessment of the green ammonia value chain that covers all steps from green ammonia production in an exporting country, up to delivery to a harbor in an importing country. The model endogenously chooses among different technology options and determines cost minimal operation. In a case study, we apply the model to the large-scale import of ammonia from Australia to Germany in a scenario for 2030. The results show that green ammonia can reach cost parity with gray ammonia even for moderate gas prices (but not necessarily with blue ammonia) if CO2 prices are high enough. We also provide a sensitivity analysis with respect to the interest rate and other key technical and economic parameters and show that cracking ammonia to provide pure hydrogen comes at a 45 % cost markup per MWh at the destination. KW - green ammonia KW - ammonia trade KW - optimization model KW - case study Australia to Germany Y1 - 2023 U6 - https://doi.org/https://doi.org/10.1016/j.apenergy.2023.120662 VL - 334 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 - 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 - RPRT A1 - Oggioni, Giorgia A1 - Schwartz, Alexandra A1 - Zöttl, Gregor A1 - Wiertz, Ann-Kathrin T1 - Dynamic Pricing and Strategic Retailers in the Energy Sector: A Multi-Leader-Follower Approach N2 - We consider strategic retail pricing in markets, where retail companies buy commodities at fluctuating wholesale prices and resell them to final consumers by applying dynamic retail tariffs. This is of especially large relevance in the context of energy markets where substantial wholesale price fluctuations are observed. Policy makers currently foster the introduction of such dynamic tariff schemes. From a modelling point of view, we propose a multi-leader-follower problem to investigate the implications of strategic retail pricing and we compare the impacts of implementing dynamic tariffs on retailers and final consumers. Our analysis tackles different aspects: first, we formulate the model and provide theoretical results. Second, we develop algorithms, which solve the multi-leader-follower problem and allow us to characterize the resulting market equilibria. Third, we calibrate and solve our framework based on data of the German retail electricity market for the years 2020 and 2021. This allows us to quantitatively assess the impact of introducing real time prices on retailers’ profits and customers’ benefits. As our results show, dynamic real-time pricing on the one hand typically increases market efficiency, which confirms previous results obtained without the explicit consideration of strategic behavior. On the other hand, however, as a novel aspect, dynamic real-time pricing turns out to significantly reduce equilibrium profits in case of strategic firms. This effect is especially large in environments with strongly fluctuating wholesale prices. Y1 - 2022 ER -