TY - JOUR A1 - Ruiz-Balet, Domenec A1 - Zuazua, Enrique T1 - Neural ODE Control for Classification, Approximation and Transport N2 - We analyze Neural Ordinary Differential Equations (NODEs) from a control theoretical perspective to address some of the main properties and paradigms of Deep Learning (DL), in particular, data classification and universal approximation. These objectives are tackled and achieved from the perspective of the simultaneous control of systems of NODEs. For instance, in the context of classification, each item to be classified corresponds to a different initial datum for the control problem of the NODE, to be classified, all of them by the same common control, to the location (a subdomain of the euclidean space) associated to each label. Our proofs are genuinely nonlinear and constructive, allowing us to estimate the complexity of the control strategies we develop. The nonlinear nature of the activation functions governing the dynamics of NODEs under consideration plays a key role in our proofs, since it allows deforming half of the phase space while the other half remains invariant, a property that classical models in mechanics do not fulfill. This very property allows to build elementary controls inducing specific dynamics and transformations whose concatenation, along with properly chosen hyperplanes, allows achieving our goals in finitely many steps. The nonlinearity of the dynamics is assumed to be Lipschitz. Therefore, our results apply also in the particular case of the ReLU activation function. We also present the counterparts in the context of the control of neural transport equations, establishing a link between optimal transport and deep neural networks. KW - data classification KW - Neural ODEs KW - Optimal Transport KW - simultaneous control KW - deep learning Y1 - 2021 ER - TY - INPR A1 - Egerer, Jonas A1 - Grimm, Veronika A1 - Grübel, Julia A1 - Zöttl, Gregor T1 - Long-run market equilibria in coupled energy sectors: A study of uniqueness N2 - We propose an equilibrium model for coupled markets of multiple energy sectors. The agents in our model are operators of sector-specific production and sector-coupling technologies, as well as price-sensitive consumers with varying demand. We analyze long-run investment in production capacity in each sector and investment in coupling capacity between sectors, as well as production decisions determined at repeated spot markets. We show that in our multi-sector model, multiplicity of equilibria may occur, even if all assumptions hold that would be sufficient for uniqueness in a single-sector model. We then contribute to the literature by deriving sufficient conditions for the uniqueness of short- and long-run market equilibrium in coupled markets of multiple energy sectors. We illustrate via simple examples that these conditions are indeed required to guarantee uniqueness in general. The uniqueness result is an important step to be able to incorporate the proposed market equilibrium problem in more complex computational multilevel equilibrium models, in which uniqueness of lower levels is a prerequisite for obtaining meaningful solutions. Our analysis also paves the way to understand and analyze more complex sector coupling models in the future. KW - Energy Markets KW - Sector Coupling KW - Regional Pricing KW - Uniqueness KW - Short- and Long-Run Market Equilibrium Y1 - 2021 ER - TY - JOUR A1 - Kleinert, Thomas A1 - Manns, Julian A1 - Schmidt, Martin A1 - Weninger, Dieter T1 - Presolving Linear Bilevel Optimization Problems JF - EURO Journal on Computational Optimization N2 - Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization. Thus, during the last years and decades many branch-and-bound methods, cutting planes, or heuristics have been proposed. On the other hand, there is almost no literature on presolving linear bilevel problems although presolve is a very important ingredient in state-of-the-art mixed-integer optimization solvers. In this paper, we carry over standard presolve techniques from single-level optimization to bilevel problems and show that this needs to be done with great caution since a naive application of well-known techniques does often not lead to correctly presolved bilevel models. Our numerical study shows that presolve can also be very beneficial for bilevel problems but also highlights that these methods have a more heterogeneous effect on the solution process compared to what is known from single-level optimization. As a side result, our numerical experiments reveal that there is an urgent need for better and more heterogeneous test instance libraries to further propel the field of computational bilevel optimization. KW - Linear Bilevel Optimization KW - Presolve KW - Computational Analysis Y1 - 2021 U6 - https://doi.org/10.1016/j.ejco.2021.100020 IS - 9 ER - TY - JOUR A1 - Domschke, Pia A1 - Kolb, Oliver A1 - Lang, Jens T1 - Fast and Reliable Transient Simulation and Continuous Optimization of Large-Scale Gas Networks N2 - We are concerned with the simulation and optimization of large-scale gas pipeline systems in an error-controlled environment. The gas flow dynamics is locally approximated by sufficiently accurate physical models taken from a hierarchy of decreasing complexity and varying over time. Feasible work regions of compressor stations consisting of several turbo compressors are included by semiconvex approximations of aggregated characteristic fields. A discrete adjoint approach within a first-discretize-then-optimize strategy is proposed and a sequential quadratic programming with an active set strategy is applied to solve the nonlinear constrained optimization problems resulting from a validation of nominations. The method proposed here accelerates the computation of near-term forecasts of sudden changes in the gas management and allows for an economic control of intra-day gas flow schedules in large networks. Case studies for real gas pipeline systems show the remarkable performance of the new method. Y1 - 2021 U6 - https://doi.org/https://doi.org/10.1007/s00186-021-00765-7 PB - Mathematical Methods of Operations Research ER - TY - JOUR A1 - Frenzel, David A1 - Lang, Jens T1 - A Third-Order Weighted Essentially Non-Oscillatory Scheme in Optimal Control Problems Governed by Nonlinear Hyperbolic Conservation Laws N2 - The weighted essentially non-oscillatory (WENO) methods are popular and effective spatial discretization methods for nonlinear hyperbolic partial differential equations. Although these methods are formally first-order accurate when a shock is present, they still have uniform high-order accuracy right up to the shock location. In this paper, we propose a novel third-order numerical method for solving optimal control problems subject to scalar nonlinear hyperbolic conservation laws. It is based on the first-disretize-then-optimize approach and combines a discrete adjoint WENO scheme of third order with the classical strong stability preserving three-stage third-order Runge-Kutta method SSPRK3. We analyze its approximation properties and apply it to optimal control problems of tracking-type with non-smooth target states. Comparisons to common first-order methods such as the Lax-Friedrichs and Engquist-Osher method show its great potential to achieve a higher accuracy along with good resolution around discontinuities. Y1 - 2021 U6 - https://doi.org/https://doi.org/10.1007/s10589-021-00295-2 VL - Computational Optimization and Applications IS - 80 SP - 301 EP - 320 ER - TY - JOUR A1 - Lang, Jens A1 - Domschke, Pia A1 - Strauch, Elisa T1 - Adaptive Single- and Multilevel Stochastic Collocation Methods for Uncertain Gas Transport in Large-Scale Networks N2 - In this paper, we are concerned with the quantification of uncertainties that arise from intra-day oscillations in the demand for natural gas transported through large-scale networks. The short-term transient dynamics of the gas flow is modelled by a hierarchy of hyperbolic systems of balance laws based on the isentropic Euler equations. We extend a novel adaptive strategy for solving elliptic PDEs with random data, recently proposed and analysed by Lang, Scheichl, and Silvester [J. Comput. Phys., 419:109692, 2020], to uncertain gas transport problems. Sample-dependent adaptive meshes and a model refinement in the physical space is combined with adaptive anisotropic sparse Smolyak grids in the stochastic space. A single-level approach which balances the discretization errors of the physical and stochastic approximations and a multilevel approach which additionally minimizes the computational costs are considered. Two examples taken from a public gas library demonstrate the reliability of the error control of expectations calculated from random quantities of interest, and the further use of stochastic interpolants to, e.g., approximate probability density functions of minimum and maximum pressure values at the exits of the network. Y1 - 2021 VL - In: Mesh Generation and Adaptation, Cutting-Edge Techniques. R. Sevilla, S. Perotto, K. Morgan (eds.), SEMA-SIMAI Springer Series IS - Vol. 30 SP - 113 EP - 135 ER - TY - JOUR A1 - Gräßle, Carmen A1 - Hinze, Michael A1 - Lang, Jens A1 - Ullmann, Sebastian T1 - POD model order reduction with space-adapted snapshots for incompressible flows N2 - We consider model order reduction based on proper orthogonal decomposition (POD) for unsteady incompressible Navier-Stokes problems, assuming that the snapshots are given by spatially adapted finite element solutions. We propose two approaches of deriving stable POD-Galerkin reduced-order models for this context. In the first approach, the pressure term and the continuity equation are eliminated by imposing a weak incompressibility constraint with respect to a pressure reference space. In the second approach, we derive an inf-sup stable velocity-pressure reduced-order model by enriching the velocity reduced space with supremizers computed on a velocity reference space. For problems with inhomogeneous Dirichlet conditions, we show how suitable lifting functions can be obtained from standard adaptive finite element computations. We provide a numerical comparison of the considered methods for a regularized lid-driven cavity problem. Y1 - 2019 U6 - https://doi.org/doi:10.1007/s10444-019-09716-7 VL - Advances in Computational Mathematics IS - 45 SP - 2401 EP - 2428 ER - TY - JOUR A1 - Lang, Jens A1 - Schmitt, Bernhard A. T1 - Discrete Adjoint Implicit Peer Methods in Optimal Control N2 - It is well known that in the first-discretize-then-optimize approach in the control of ordinary differential equations the adjoint method may converge under additional order conditions only. For Peer two-step methods we derive such adjoint order conditions and pay special attention to the boundary steps. For $s$-stage methods, we prove convergence of order s for the state variables if the adjoint method satisfies the conditions for order s-1, at least. We remove some bottlenecks at the boundaries encountered in an earlier paper of the first author et al. [J. Comput. Appl. Math., 262:73--86, 2014] and discuss the construction of 3-stage methods for the order pair (3,2) in detail including some matrix background for the combined forward and adjoint order conditions. The impact of nodes having equal differences is highlighted. It turns out that the most attractive methods are related to BDF. Three 3-stage methods are constructed which show the expected orders in numerical tests. Y1 - 2020 U6 - https://doi.org/https://doi.org/10.1016/j.cam.2022.114596 VL - Journal of Computational and Applied Mathematics IS - 416:114596 ER - TY - JOUR A1 - Lang, Jens A1 - Scheichl, Robert A1 - Silvester, David T1 - A Fully Adaptive Multilevel Stochastic Collocation Strategy for Solving Elliptic PDEs with Random Data N2 - We propose and analyse a fully adaptive strategy for solving elliptic PDEs with random data in this work. A hierarchical sequence of adaptive mesh refinements for the spatial approximation is combined with adaptive anisotropic sparse Smolyak grids in the stochastic space in such a way as to minimize the computational cost. The novel aspect of our strategy is that the hierarchy of spatial approximations is sample dependent so that the computational effort at each collocation point can be optimised individually. We outline a rigorous analysis for the convergence and computational complexity of the adaptive multilevel algorithm and we provide optimal choices for error tolerances at each level. Two numerical examples demonstrate the reliability of the error control and the significant decrease in the complexity that arises when compared to single level algorithms and multilevel algorithms that employ adaptivity solely in the spatial discretisation or in the collocation procedure. Y1 - 2021 U6 - https://doi.org/doi:10.1016/j.jcp.2020.109692 VL - Journal of Computational Physics IS - 419 ER - TY - INPR A1 - Heitsch, Holger A1 - Henrion, René A1 - Kleinert, Thomas A1 - Schmidt, Martin T1 - On Convex Lower-Level Black-Box Constraints in Bilevel Optimization with an Application to Gas Market Models with Chance Constraints N2 - Bilevel optimization is an increasingly important tool to model hierarchical decision making. However, the ability of modeling such settings makes bilevel problems hard to solve in theory and practice. In this paper, we add on the general difficulty of this class of problems by further incorporating convex black-box constraints in the lower level. For this setup, we develop a cutting-plane algorithm that computes approximate bilevel-feasible points. We apply this method to a bilevel model of the European gas market in which we use a joint chance constraint to model uncertain loads. Since the chance constraint is not available in closed form, this fits into the black-box setting studied before. For the applied model, we use further problem-specific insights to derive bounds on the objective value of the bilevel problem. By doing so, we are able to show that we solve the application problem to approximate global optimality. In our numerical case study we are thus able to evaluate the welfare sensitivity in dependence of the achieved safety level of uncertain load coverage. KW - Bilevel optimization KW - Black-box constraints KW - Chance constraints KW - Cutting planes KW - European gas market Y1 - 2021 ER - TY - INPR A1 - Spürkel, Kai A1 - Claus, Matthias T1 - Improving constants of strong convexity in linear stochastic programming N2 - We derive formulas for constants of strong convexity (CSCs) of risk functions encountered in two-stage stochastic programs with linear recourse. One of them yields a CSC as the optimal value of a certain QCQP, another one in terms of the thickness of the feasibility polytope of the dual problem associated to the recourse problem. CSCs appear in Hoelder-type estimates relating the distance of optimal solution sets of stochastic programs to a suitable distance of underlying probability distributions. KW - Strong Convexity KW - Stochastic Programming KW - Linear Recourse Y1 - 2021 ER - TY - JOUR A1 - Gugat, Martin T1 - On the turnpike property with interior decay for optimal control problems JF - Mathematics of Control, Signals, and Systems N2 - In this paper the turnpike phenomenon is studied for problems of optimal control where both pointwise-in-time state and control constraints can appear. We assume that in the objective function, a tracking term appears that is given as an integral over the time-interval [0, T] and measures the distance to a desired stationary state. In the optimal control problem, both the initial and the desired terminal state are prescribed. We assume that the system is exactly controllable in an abstract sense if the time horizon is long enough. We show that that the corresponding optimal control problems on the time intervals [0, T] give rise to a turnpike structure in the sense that for natural numbers n if T is su� ciently large, the contribution of the objective function from subintervals of [0, T] of the form [t - t/2^n, t + (T-t)/2^n] is of the order 1/min{t^n, (T-t)^n}. We also show that a similar result holds for epsilon-optimal solutions of the optimal control problems if epsilon > 0 is chosen suffciently small. At the end of the paper we present both systems that are governed by ordinary differential equations and systems governed by partial differential equations where the results can be applied. KW - Optimal control KW - Turnpike KW - Control Constraint KW - State constraint KW - Exact controllability Y1 - 2021 U6 - https://doi.org/https://doi.org/10.1007/s00498-021-00280-4 ER - TY - INPR A1 - Gugat, Martin A1 - Sokolowski, Jan T1 - On Problems of Dynamic Optimal Nodal control for Gas Networks N2 - We consider a dynamic ptimal control problem for gas pipeline systems. The flow is governed by a quasilinear hyperbolic model. Since in the operation of the gas networks regular solutions without shocks are desirable, we impose appropriate state and control constraint in order to guarantee that a classical solution is generated. Due to a W^{2;inf}-regularization term in the objective function, we can show the existence of an optimal control. Moreover, we give conditions that guarantee that the control becomes constant a the end of the control time interval if the weight of the regularization term is suffciently large. KW - optimal nodal control KW - gas network KW - turnpike property KW - quasilinear hyperbolic problem KW - dynamic control Y1 - 2021 ER - TY - JOUR A1 - Plein, Fränk A1 - Thürauf, Johannes A1 - Labbé, Martine A1 - Schmidt, Martin T1 - A Bilevel Optimization Approach to Decide the Feasibility of Bookings in the European Gas Market JF - Mathematical Methods of Operations Research N2 - The European gas market is organized as a so-called entry-exit system with the main goal to decouple transport and trading. To this end, gas traders and the transmission system operator (TSO) sign so-called booking contracts that grant capacity rights to traders to inject or withdraw gas at certain nodes up to this capacity. On a day-ahead basis, traders then nominate the actual amount of gas within the previously booked capacities. By signing a booking contract, the TSO guarantees that all nominations within the booking bounds can be transported through the network. This results in a highly challenging mathematical problem. Using potential-based flows to model stationary gas physics, feasible bookings on passive networks, i.e., networks without controllable elements, have been characterized in the recent literature. In this paper, we consider networks with linearly modeled active elements such as compressors or control valves. Since these active elements allow the TSO to control the gas flow, the single-level approaches for passive networks from the literature are no longer applicable. We thus present a bilevel model to decide the feasibility of bookings in networks with active elements. While this model is well-defined for general active networks, we focus on the class of networks for which active elements do not lie on cycles. This assumption allows us to reformulate the original bilevel model such that the lower-level problem is linear for every given upper-level decision. Consequently, we derive several single-level reformulations for this case. Besides the classic Karush-Kuhn-Tucker reformulation, we obtain three problem-specific optimal-value-function reformulations. The latter also lead to novel characterizations of feasible bookings in networks with active elements that do not lie on cycles. We compare the performance of our methods by a case study based on data from the GasLib. KW - Gas networks KW - Bilevel optimization KW - European entry-exit market KW - Bookings KW - Active elements Y1 - 2021 U6 - https://doi.org/10.1007/s00186-021-00752-y ER - TY - JOUR A1 - Sarac, Yesim A1 - Zuazua, Enrique T1 - Sidewise control of 1-d waves N2 - We analyze the sidewise controllability for the variable coefficients one-dimensional wave equation. The control is acting on one extreme of the string with the aim that the solution tracks a given path at the otherfree end. This sidewise control problem is also often referred to as nodal profile or tracking control. First, the problem is reformulated as a dual observability property for the corresponding adjoint system. Using sidewiseenergy propagation arguments the sidewise observability is shown to hold, ina sufficiently large time, in the class of BV-coefficients. We also present a number of open problems and perspectives for further research. KW - 1-d wave equations KW - BV-coefficients KW - nodal profile con-trol Y1 - 2021 ER - TY - JOUR A1 - Beck, Yasmine A1 - Schmidt, Martin T1 - A Robust Approach for Modeling Limited Observability in Bilevel Optimization JF - Operations Research Letters N2 - Many applications of bilevel optimization contain a leader facing a follower whose reaction deviates from the one expected by the leader due to some kind of bounded rationality. We consider bilinear bilevel problems with follower's response uncertainty due to limited observability regarding the leader's decision and exploit robust optimization to model the decision making of the follower. We show that the robust counterpart of the lower level allows to tackle the problem via the lower level's KKT conditions. KW - Bilevel optimization KW - Robust optimization KW - Bounded rationality KW - Limited observability KW - Reformulations Y1 - 2021 IS - 49(5) SP - 752 EP - 758 ER - TY - JOUR A1 - Kleinert, Thomas A1 - Labbé, Martine A1 - Ljubić, Ivana A1 - Schmidt, Martin T1 - A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization JF - EURO Journal on Computational Optimization N2 - Bilevel optimization is a field of mathematical programming in which some variables are constrained to be the solution of another optimization problem. As a consequence, bilevel optimization is able to model hierarchical decision processes. This is appealing for modeling real-world problems, but it also makes the resulting optimization models hard to solve in theory and practice. The scientific interest in computational bilevel optimization increased a lot over the last decade and is still growing. Independent of whether the bilevel problem itself contains integer variables or not, many state-of-the-art solution approaches for bilevel optimization make use of techniques that originate from mixed-integer programming. These techniques include branch-and-bound methods, cutting planes and, thus, branch-and-cut approaches, or problem-specific decomposition methods. In this survey article, we review bilevel-tailored approaches that exploit these mixed-integer programming techniques to solve bilevel optimization problems. To this end, we first consider bilevel problems with convex or, in particular, linear lower-level problems. The discussed solution methods in this field stem from original works from the 1980's but, on the other hand, are still actively researched today. Second, we review modern algorithmic approaches to solve mixed-integer bilevel problems that contain integrality constraints in the lower level. Moreover, we also briefly discuss the area of mixed-integer nonlinear bilevel problems. Third, we devote some attention to more specific fields such as pricing or interdiction models that genuinely contain bilinear and thus nonconvex aspects. Finally, we sketch a list of open questions from the areas of algorithmic and computational bilevel optimization, which may lead to interesting future research that will further propel this fascinating and active field of research. KW - Bilevel optimization KW - Mixed-integer programming KW - Applications KW - Branch-and-bound KW - Branch-and-cut Y1 - 2021 ER - TY - INPR A1 - Giesselmann, Jan A1 - Egger, Herbert T1 - Stability and asymptotic analysis for instationary gas transport via relative energy estimates N2 - We consider the transport of gas in long pipes and pipeline networks for which the dynamics are dominated by friction at the pipe walls. The governing equations can be formulated as an abstract dissipative Hamiltonian system which allows us to derive perturbation bounds by means of relative energy estimates. As particular consequences, we obtain stability with respect to initial conditions and model parameters and quantitative estimates in the high friction limit. Our results are established in detail for the flow in a single pipe and through the energy-based modelling they naturally generalize also to pipe networks. KW - gas transport on networks KW - asymptotic limits KW - hyperbolic balance laws KW - relative energy estimates KW - singular perturbations Y1 - 2020 ER - TY - JOUR A1 - Krug, Richard A1 - Leugering, Günter A1 - Martin, Alexander A1 - Schmidt, Martin A1 - Weninger, Dieter T1 - Time-Domain Decomposition for Optimal Control Problems Governed by Semilinear Hyperbolic Systems JF - SIAM Journal on Control and Optimization N2 - In this article, we extend the time-domain decomposition method described by Lagnese and Leugering (2003) to semilinear optimal control problems for hyperbolic balance laws with spatio-temporal varying coefficients. We provide the design of the iterative method applied to the global first-order optimality system, prove its convergence, and derive an a posteriori error estimate. The analysis is done entirely on the continuous level. A distinguishing feature of the method is that the decomposed optimality system can be interpreted as an optimality system of a local "virtual" optimal control problem. Thus, the iterative time-domain decomposition of the optimality system can be interpreted as an iterative parallel scheme for virtual optimal control problems on the subintervals. A typical example and further comments are given to show the range of potential applications. Moreover, we provide some numerical experiments to give a first interpretation of the role of the parameters involved in the iterative process. KW - Time-domain decomposition KW - Optimal control KW - Semilinear hyperbolic systems KW - Convergence KW - A posteriori error estimates Y1 - 2020 ER - TY - JOUR A1 - Esteve, Carlos A1 - Geshkovski, Borjan A1 - Pighin, Dario A1 - Zuazua, Enrique T1 - Turnpike in Lipschitz-nonlinear optimal control N2 - We present a new proof of the turnpike property for nonlinear optimal control problems, when the running target is a steady control-state pair of the underlying dynamics. Our strategy combines the construction of suboptimal quasi-turnpike trajectories via controllability, and a bootstrap argument, and does not rely on analyzing the optimality system or linearization techniques. This in turn allows us to address several optimal control problems for finite-dimensional, control-affine systems with globally Lipschitz (possibly nonsmooth) nonlinearities, without any smallness conditions on the initial data or the running target. These results are motivated by the large-layer regime of residual neural networks, commonly used in deep learning applications. We show that our methodology is applicable to controlled PDEs as well, such as the semilinear wave and heat equation with a globally Lipschitz nonlinearity, once again without any smallness assumptions. Y1 - ER - TY - JOUR A1 - Gontran, Lance A1 - Trélat, Emmanuel A1 - Zuazua, Enrique T1 - Shape turnpike for linear parabolic PDE models N2 - We introduce and study the turnpike property for time-varying shapes, within the viewpoint of optimal control. We focus here on second-order linear parabolic equations where the shape acts as a source term and we seek the optimal time-varying shape that minimizes a quadratic criterion. We first establish existence of optimal solutions under some appropriate sufficient conditions. We then provide necessary conditions for optimality in terms of adjoint equations and, using the concept of strict dissipativity, we prove that state and adjoint satisfy the measure-turnpike property, meaning that the extremal time-varying solution remains essentially close to the optimal solution of an associated static problem. We show that the optimal shape enjoys the exponential turnpike property in term of Hausdorff distance for a Mayer quadratic cost. We illustrate the turnpike phenomenon in optimal shape design with several numerical simulations. Y1 - 2020 U6 - https://doi.org/https://doi.org/10.1016/j.sysconle.2020.104733 VL - 142 PB - Syst. Control. Lett. ER - TY - JOUR A1 - Biccari, Umberto A1 - Navarro-Quiles, Ana A1 - Zuazua, Enrique T1 - Stochastic optimization methods for the simultaneous control of parameter-dependent systems N2 - We address the application of stochastic optimization methods for the simultaneous control of parameter-dependent systems. In particular, we focus on the classical Stochastic Gradient Descent (SGD) approach of Robbins and Monro, and on the recently developed Continuous Stochastic Gradient (CSG) algorithm. We consider the problem of computing simultaneous controls through the minimization of a cost functional defined as the superposition of individual costs for each realization of the system. We compare the performances of these stochastic approaches, in terms of their computational complexity, with those of the more classical Gradient Descent (GD) and Conjugate Gradient (CG) algorithms, and we discuss the advantages and disadvantages of each methodology. In agreement with well-established results in the machine learning context, we show how the SGD and CSG algorithms can significantly reduce the computational burden when treating control problems depending on a large amount of parameters. This is corroborated by numerical experiments. KW - Parameter-dependent systems KW - simultaneous controllability KW - stochastic optimization KW - computational cost Y1 - 2020 ER - TY - JOUR A1 - Esteve, Carlos A1 - Kouhkouh, H A1 - Pighin, Dario A1 - Zuazua, Enrique T1 - The Turnpike property and the long-time behavior of the Hamilton-Jacobi equation N2 - In this work, we analyze the consequences that the so-called turnpike property has on the long-time behavior of the value function corresponding to an optimal control problem. As a by-product, we obtain the long-time behavior of the solution to the associated Hamilton-Jacobi-Bellman equation. In order to carry out our study, we use the setting of a finite-dimensional linear-quadratic optimal control problem, for which the turnpike property is well understood. We prove that, when the time horizon T tends to infinity, the value function converges to a travelling-front like solution of the form W(x) + c T + λ. In addition, we provide a control interpretation of each of these three terms in the spirit of the turnpike theory. Finally, we compare this asymptotic decomposition with the existing results on long-time behavior for Hamilton-Jacobi equations. We stress that in our case, the Hamiltonian is not coercive in the momentum variable, a case rarely considered in the classical literature about Hamilton-Jacobi equations. KW - Optimal control problems KW - long-time behavior KW - the turnpike property KW - Hamilton-Jacobi-Bellman equations KW - linear-quadratic Y1 - 2020 ER - TY - JOUR A1 - Ruiz-Balet, Domenec A1 - Zuazua, Enrique T1 - Control under constraints for multi-dimensional reaction-diffusion monostable and bistable equations N2 - Dynamic phenomena in social and biological sciences can often be modeled employing reaction diffusion equations. Frequently in applications, their control plays an important role when avoiding population extinction or propagation of infectious diseases, enhancing multicultural features, etc. When addressing these issues from a mathematical viewpoint one of the main challenges is that, because of the intrinsic nature of the models under consideration, the solution, typically a proportion or a density function, needs to preserve given lower and upper bounds (taking values in [0; 1])). Controlling the system to the desired final configuration then becomes complex, and sometimes even impossible. In the present work, we analyze the controllability to constant steady states of spatially homogeneous semilinear heat equations, with constraints in the state, and using boundary controls, which is indeed a natural way of acting on the system in the present context. The nonlinearities considered are among the most frequent: monostable and bistable ones. We prove that controlling the system to a constant steadystate may become impossible when the diffusivity is too small (or when the domain is large), due to the existence of barrier functions. When such an obstruction does not arise, we build sophisticated control strategies combining the dissipativity of the system, the existence of traveling waves, some connectivity of the set of steady states. This connectivity allows building paths that the controlled trajectories can follow, in a long time, with small oscillations, preserving the natural constraints of the system. This kind of strategy was successfully implemented in one space dimension, where phase plane analysis techniques allowed to decode the nature of the set of steady states. These techniques fail in the present multidimensional setting. We employ a fictitious domain technique, extending the system to a larger ball, and building paths of radially symmetric solution that can then be restricted to the original domain. The results are illustrated by numerical simulations of these models that find several applications, such as the extinction of minority languages or the survival of rare species in sufficiently large reserved areas. KW - Constraints KW - Controllability KW - Mathematical biology KW - Reaction-diffusion Y1 - 2020 U6 - https://doi.org/https://doi.org/10.1016/j.matpur.2020.08.006 VL - 143 SP - 345 EP - 375 ER - TY - JOUR A1 - Ko, Dongnam A1 - Zuazua, Enrique T1 - Model predictive control with random batch methods for a guiding problem N2 - We model, simulate and control the guiding problem for a herd of evaders under the action of repulsive drivers. The problem is formulated in an optimal control framework, where the drivers (controls) aim to guide the evaders (states) to a desired region of the Euclidean space. The numerical simulation of such models quickly becomes unfeasible for a large number of interacting agents. To reduce the computational cost, we use the Random Batch Method (RBM), which provides a computationally feasible approximation of the dynamics. At each time step, the RBM randomly divides the set of particles into small subsets (batches), considering only the interactions inside each batch. Due to the averaging effect, the RBM approximation converges to the exact dynamics as the time discretization gets finer. We propose an algorithm that leads to the optimal control of a fixed RBM approximated trajectory using a classical gradient descent. The resulting control is not optimal for the original complete system, but rather for the reduced RBM model. We then adopt a Model Predictive Control (MPC) strategy to handle the error in the dynamics. While the system evolves in time, the MPC strategy consists in periodically updating the state and computing the optimal control over a long-time horizon, which is implemented recursively in a shorter time-horizon. This leads to a semi-feedback control strategy. Through numerical experiments we show that the combination of RBM and MPC leads to a significant reduction of the computational cost, preserving the capacity of controlling the overall dynamics. KW - Agent-based models KW - Guiding problem KW - large scale complex systems KW - Random Batch Method KW - Model Predictive Control Y1 - 2020 U6 - https://doi.org/https://doi.org/10.1142/S0218202521500329 N1 - Ko Dongnam, Zuazua Enrique. Model predictive control with random batch methods for a guiding problem (2021). Math. Models Methods Appl. Sci., Vol. 31, No. 8, pp. 1569-1592. (2021) DOI: https://doi.org/10.1142/S0218202521500329 VL - 31 IS - 8 SP - 1569 EP - 1592 PB - Math. Models Methods Appl. Sci. ER - TY - JOUR A1 - Zuazua, Enrique T1 - Asymptotic behavior of scalar convection-diffusion equations N2 - In these lecture notes, we address the problem of large-time asymptotic behaviour of the solutions to scalar convection-diffusion equations set in [katex]\mathbb{R}^N[/katex]. The large-time asymptotic behaviour of the solutions to many convection-diffusion equations is strongly linked with the behavior of the initial data at infinity. In fact, when the initial datum is integrable and of mass [katex]M[/katex], the solutions to the equations under consideration oftentimes behave like the associated self-similar profile of mass [katex]M[/katex], thus emphasising the role of scaling variables in these scenarios. However, these equations can also manifest other asymptotic behaviors, including weakly non-linear, linear or strongly non-linear behavior depending on the form of the convective term. We give an exhaustive presentation of several results and techniques, where we clearly distinguish the role of the spatial dimension and the form of the nonlinear convective term. Y1 - 2020 ER - TY - JOUR A1 - Biccari, Umberto A1 - Zuazua, Enrique T1 - A Stochastic Approach to the Synchronization of Coupled Oscillators N2 - This paper deals with an optimal control problem associated with the Kuramoto model describing the dynamical behavior of a network of coupled oscillators. Our aim is to design a suitable control function allowing us to steer the system to a synchronized configuration in which all the oscillators are aligned on the same phase. This control is computed via the minimization of a given cost functional associated with the dynamics considered. For this minimization, we propose a novel approach based on the combination of a standard Gradient Descent (GD) methodology with the recently-developed Random Batch Method (RBM) for the efficient numerical approximation of collective dynamics. Our simulations show that the employment of RBM improves the performances of the GD algorithm, reducing the computational complexity of the minimization process and allowing for a more efficient control calculation. KW - coupled oscillators KW - gradient descent KW - Kuramoto model KW - optimal control KW - random batch method Y1 - 2020 U6 - https://doi.org/10.3389/fenrg.2020.00115 VL - 8 ER - TY - JOUR A1 - Heiland, Jan A1 - Zuazua, Enrique T1 - Classical system theory revisited for Turnpike in standard state space systems and impulse controllable descriptor systems N2 - The concept of turnpike connects the solution of long but finite time horizon optimal control problems with steady state optimal controls. A key ingredient of the analysis of the turnpike is the linear quadratic regulator problem and the convergence of the solution of the associated differential Riccati equation as the terminal time approaches infinity. This convergence has been investigated in linear systems theory in the 1980s. We extend classical system theoretic results for the investigation of turnpike properties of standard state space systems and descriptor systems. We present conditions for turnpike in the nondetectable case and for impulse controllable descriptor systems. For the latter, in line with the theory for standard linear systems, we establish existence and convergence of solutions to a generalized differential Riccati equation. KW - descriptor systems KW - linear systems KW - long time behavior KW - optimal control KW - Riccati equations Y1 - 2020 ER - TY - JOUR A1 - Esteve, Carlos A1 - Geshkovski, Borjan A1 - Pighin, Dario A1 - Zuazua, Enrique T1 - Large-time asymptotics in deep learning N2 - It is by now well-known that practical deep supervised learning may roughly be cast as an optimal control problem for a specific discrete-time, nonlinear dynamical system called an artificial neural network. In this work, we consider the continuous-time formulation of the deep supervised learning problem, and study the latter’s behavior when the final time horizon increases, a fact that can be interpreted as increasing the number of layers in the neural network setting. When considering the classical regularized empirical risk minimization problem, we show that, in long time, the optimal states converge to zero training error, namely approach the zero training error regime, whilst the optimal control parameters approach, on an appropriate scale, minimal norm parameters with corresponding states precisely in the zero training error regime. This result provides an alternative theoretical underpinning to the notion that neural networks learn best in the overparametrized regime, when seen from the large layer perspective. We also propose a learning problem consisting of minimizing a cost with a state tracking term, and establish the well-known turnpike property, which indicates that the solutions of the learning problem in long time intervals consist of three pieces, the first and the last of which being transient short-time arcs, and the middle piece being a long-time arc staying exponentially close to the optimal solution of an associated static learning problem. This property in fact stipulates a quantitative estimate for the number of layers required to reach the zero training error regime. Both of the aforementioned asymptotic regimes are addressed in the context of continuous-time and continuous space-time neural networks, the latter taking the form of nonlinear, integro-differential equations, hence covering residual neural networks with both fixed and possibly variable depths. KW - deep learning KW - Neural ODEs KW - optimal control KW - Residual Neural Networks KW - Supervised Learning Y1 - 2020 ER - TY - JOUR A1 - Esteve, C A1 - Zuazua, Enrique T1 - The Inverse Problem for Hamilton-Jacobi equations and Semiconcave Envelopes N2 - We study the inverse problem, or inverse design problem, for a time-evolution Hamilton-Jacobi equation. More precisely, given a target function [katex]u_T[/katex] and a time horizon [katex]T > 0[/katex], we aim to construct all the initial conditions for which the viscosity solution coincides with [katex]u_T[/katex] at time [katex]T[/katex]. As it is common in this kind of nonlinear equations, the target might not be reachable. We first study the existence of at least one initial condition leading the system to the given target. The natural candidate, which indeed allows determining the reachability of [katex]u_T[/katex] , is the one obtained by reversing the direction of time in the equation, considering [katex]u_T[/katex] as terminal condition. In this case, we use the notion of backward viscosity solution, that provides existence and uniqueness for the terminal-value problem. We also give an equivalent reachability condition based on a differential inequality, that relates the reachability of the target with its semiconcavity properties. Then, for the case when [katex]u_T[/katex] is reachable, we construct the set of all initial conditions for which the solution coincides with [katex]u_T[/katex] at time [katex]T[/katex]. Note that in general, such initial conditions are not unique. Finally, for the case when the target [katex]u_T[/katex] is not necessarily reachable, we study the projection of [katex]u_T[/katex] on the set of reachable targets, obtained by solving the problem backward and then forward in time. This projection is then identified with the solution of a fully nonlinear obstacle problem, and can be interpreted as the semiconcave envelope of [katex]u_T[/katex] , i.e. the smallest reachable target bounded from below by [katex]u_T[/katex] . KW - Remove term: Hamilton-Jacobi equation Hamilton-Jacobi equation KW - inverse design problem KW - obstacle problems KW - semiconcave envelopes Y1 - 2020 ER - TY - JOUR A1 - Bárcena, J.A. A1 - Zuazua, Enrique T1 - Averaged dynamics and control for heat equations with random diffusion N2 - Abstract. This paper deals with the averaged dynamics for heat equations in the degenerate case where the diffusivity coefficient, assumed to be constant, is allowed to take the null value. First we prove that the averaged dynamics is analytic. This allows to show that, most often, the averaged dynamics enjoys the property of unique continuation and is approximately controllable. We then determine if the averaged dynamics is actually null controllable or not depending on how the density of averaging behaves when the diffusivity vanishes. In the critical density threshold the dynamics of the average is similar to the $\frac{1}{2}$-fractional Laplacian, which is wellknown to be critical in the context of the controllability of fractional diffusion processes. Null controllability then fails (resp. holds) when the density weights more (resp. less) in the null diffusivity regime than in this critical regime. KW - Averaged controllability, averaged observability, observability, random heat equation Y1 - 2020 ER - TY - INPR A1 - Gabriel, Steven A. A1 - Leal, Marina A1 - Schmidt, Martin T1 - On Linear Bilevel Optimization Problems with Complementarity-Constrained Lower Levels N2 - We consider a novel class of linear bilevel optimization models with a lower level that is a linear program with complementarity constraints (LPCC). We present different single-level reformulations depending on whether the linear complementarity problem (LCP) as part of the lower-level constraint set depends on the upper-level decisions or not as well as on whether the LCP matrix is positive definite or positive semidefinite. Moreover, we illustrate the connection to linear trilevel models that can be reduced to bilevel problems with LPCC lower levels having positive (semi)definite matrices. Finally, we provide two generic and illustrative bilevel models from the fields of transportation and energy to show the practical relevance of the newly introduced class of bilevel problems and show related theoretical results. KW - Bilevel optimization KW - Linear programs with complementarity constraints KW - Linear complementarity problems KW - Reformulations KW - Spatial price equilibria Y1 - 2020 ER - TY - INPR A1 - Kleinert, Thomas A1 - Schmidt, Martin T1 - Why there is no need to use a big-M in linear bilevel optimization: A computational study of two ready-to-use approaches N2 - Linear bilevel optimization problems have gained increasing attention both in theory as well as in practical applications of Operations Research (OR) during the last years and decades. The latter is mainly due to the ability of this class of problems to model hierarchical decision processes. However, this ability makes bilevel problems also very hard to solve. Since no general-purpose solvers are available, a "best-practice" has developed in the applied OR community, in which not all people want to develop tailored algorithms but "just use" bilevel optimization as a modeling tool for practice. This best-practice is the big-M reformulation of the Karush-Kuhn-Tucker (KKT) conditions of the lower-level problem - an approach that has been shown to be highly problematic by Pineda and Morales (2019). Choosing invalid values for M yields solutions that may be arbitrarily bad. Checking the validity of the big-Ms is however shown to be as hard as solving the original bilevel problem in Kleinert et al. (2019). Nevertheless, due to its appealing simplicity, especially w.r.t. the required implementation effort, this ready-to-use approach still is the most popular method. Until now, there has been a lack of approaches that are competitive both in terms of implementation effort and computational cost. In this note we demonstrate that there is indeed another competitive ready-to-use approach: If the SOS-1 technique is applied to the KKT complementarity conditions, adding the simple additional root-node inequality developed by Kleinert et al. (2020) leads to a competitive performance - without having all the possible theoretical disadvantages of the big-M approach. KW - Bilevel optimization KW - Big-M KW - SOS-1 KW - Valid inequalities KW - Computational analysis Y1 - 2020 ER - TY - JOUR A1 - Egger, Herbert A1 - Philippi, Nora T1 - On the transport limit of singularly perturbed convection-diffusion problems on networks N2 - We consider singularly perturbed convection-diffusion equations on one-dimensional networks (metric graphs) as well as the transport problems arising in the vanishing diffusion limit. Suitable coupling condition at inner vertices are derived that guarantee conservation of mass as well as dissipation of a mathematical energy which allows us to prove stability and well-posedness. For single intervals and appropriately specified initial conditions, it is well-known that the solutions of the convection-diffusion problem converge to that of the transport problem with order O(sqrt(eps)) in the L1(L2)- norm with diffusion eps -> 0. In this paper, we prove a corresponding result for problems on one-dimensional networks. The main difficulty in the analysis is that the number and type of coupling conditions changes in the singular limit which gives rise to additional boundary layers at the interior vertices of the network. Since the values of the solution at these network junctions are not known a-priori, the asymptotic analysis requires a delicate choice of boundary layer functions that allows to handle these interior layers. Y1 - 2020 ER - TY - JOUR A1 - Egger, Herbert A1 - Philippi, Nora T1 - A hybrid discontinuous Galerkin method for transport equations on networks JF - Finite Volumes for Complex Applications IX - Methods, Theoretical Aspects, Examples N2 - We discuss the mathematical modeling and numerical discretization of 5 transport problems on one-dimensional networks. Suitable coupling conditions are derived that guarantee conservation of mass across network junctions and dissipation of a mathematical energy which allows us to prove existence of unique solutions. We then consider the space discretization by a hybrid discontinuous Galerkin method which provides a suitable upwind mechanism to handle the transport prob10 lem and allows to incorporate the coupling conditions in a natural manner. In addition, the method inherits mass conservation and stability of the continuous problem. Order optimal convergence rates are established and illustrated by numerical tests. Y1 - 2020 ER - TY - INPR A1 - Gugat, Martin A1 - Herty, Michael T1 - Limits of stabilizabilizy for a semilinear model for gas pipeline flow N2 - We present a positive and a negative stabilization result for a semilinear model of gas flow in pipelines. For feedback boundary conditions we obtain an unconditional stabilization result in the absence and conditional instability in the presence of the source term. We also obtain unconditional instability for the corresponding quasilinear model given by the isothermal Euler equations Y1 - 2020 ER - TY - INPR A1 - Gugat, Martin A1 - Herty, Michael T1 - Modeling, Control and Numerics of Gas Networks N2 - In this article we survey recent progress on mathematical results on gas flow in pipe networks with a special focus on questions of control and stabilization. We briefly present the modeling of gas flow and coupling conditions for flow through vertices of a network. Our main focus is on gas models for spatially one-dimensional flow governed by hyperbolic balance laws. We survey results on classical solutions as well as weak solutions. We present results on well–posedness, controllability, feedback stabilization, the inclusion of uncertainty in the models and numerical methods. KW - Hyperbolic Balance Laws, Stabilization, Exact Controllability, Modeling of Gas Flow, Finite-Volume Schemes, Optimal control, Uncertainty Y1 - 2020 ER - TY - JOUR A1 - Branda, Martin A1 - Henrion, René A1 - Pistek, Miroslav T1 - Producer’s Best Response in Pay-as-clear Day-ahead Electricity Market with Uncertain Demand N2 - We deal with several sources of uncertainty in electricity markets. The independent system operator (ISO) maximizes the social welfare using chance constraints to hedge against discrepancies between the estimated and real electricity demand. We find an explicit solution of the ISO problem, and use it to tackle the problem of a producer. In our model, production as well as income of a producer are determined based on the estimated electricity demand predicted by the ISO, that is unknown to producers. Thus, each producer is hedging against the uncertainty of prediction of the demand using the value-at-risk approach. To illustrate our results, a numerical study of a producer’s best response given a historical distribution of both estimated and real electricity demand is provided. KW - electricity market KW - multi-leader-common-follower game KW - stochastic demand KW - day-ahead bidding KW - chance constraints Y1 - 2020 ER - TY - JOUR A1 - Adam, Lukas A1 - Branda, Martin A1 - Heitsch, Holger A1 - Henrion, René T1 - Solving joint chance constrained problems using regularization and Benders' decomposition JF - Annals of Operations Research N2 - In this paper we investigate stochastic programs with joint chance constraints. We consider discrete scenario set and reformulate the problem by adding auxiliary variables. Since the resulting problem has a difficult feasible set, we regularize it. To decrease the dependence on the scenario number, we propose a numerical method by iteratively solving a master problem while adding Benders cuts. We find the solution of the slave problem (generating the Benders cuts) in a closed form and propose a heuristic method to decrease the number of cuts. We perform a numerical study by increasing the number of scenarios and compare our solution with a solution obtained by solving the same problem with continuous distribution. KW - chance constrained programming KW - optimality conditions KW - regularization KW - Benders cuts KW - gas networks Y1 - U6 - https://doi.org/10.1007/s10479-018-3091-9 VL - 292 SP - 683 EP - 709 ER - TY - INPR A1 - Bohlayer, Markus A1 - Bürger, Adrian A1 - Fleschutz, Markus A1 - Braun, Marco A1 - Zöttl, Gregor T1 - Multi-period investment pathways - Modeling approaches to design distributed energy systems under uncertainty N2 - Multi-modal distributed energy system planning is applied in the context of smart grids, industrial energy supply,and in the building energy sector. In real-world applications, these systems are commonly characterized by existing system structures of different age where monitoring and investment are conducted in a closed-loop, with the iterative possibility to invest. The literature contains two main approaches to approximate this computationally intensive multiperiod investment problem. The first approach simplifies the temporal decision-making process collapsing the multistage decision to a two-stage decision, considering uncertainty in the second stage decision variables. The second approach considers multi-period investments under the assumption of perfect foresight. In this work, we propose a multi-stage stochastic optimization problem that captures multi-period investment decisions under uncertainty and solves the problem to global optimality, serving as a first-best benchmark to the problem. To evaluate the performance of conventional approaches applied in a multi-year setup and to solve the multi-period problem at lower computational effort, we propose a rolling horizon heuristic that on the one hand reveals the performance of conventional approaches applied in a multi-period set-up and on the other hand enables planners to identify approximate solutions to the original multi-stage stochastic problem. Additionally, we consider an open-loop version of the rolling horizon algorithm to evaluate how single-period investments perform with respect to the entire scenario tree and compared to multi-period investments. We conduct a real-world case study and investigate solution quality as well as the computational performance of the proposed approaches. Our findings indicate that the approximation of multi-period investments by two-stage stochastic approaches yield the best results regarding constraint satisfaction, while deterministic multi-period approximations yield better economic and computational performance. Y1 - 2020 ER - TY - INPR A1 - Runge, Philipp A1 - Sölch, Christian A1 - Albert, Jakob A1 - Wasserscheid, Peter A1 - Zöttl, Gregor A1 - Grimm, Veronika T1 - Economic comparison of electric fuels produced at excellent locations for renewable energies: A Scenario for 2035 N2 - The use of electric fuels (e-fuels) enables CO2-neutral mobility and opens therefore an alternative to fossil-fuel-fired engines or battery-powered electric motors. This paper compares the cost-effectiveness of Fischer-Tropsch diesel, methanol, and hydrogen stored as cryogenic liquid (LH2) or in form of liquid organic hydrogen carriers (LOHCs). The production cost of those fuels are to a large extent driven by the energy-intensive electrolytic water splitting. The option of producing e-fuels in Germany competes with international locations with excellent conditions for renewable energy harvesting and thus very low levelized cost of electricity. We developed a mathematical model that covers the entire process chain. Starting with the production of the required resources such as fresh water, hydrogen, carbon dioxide, carbon monoxide, electrical and thermal energy, the subsequent chemical synthesis, the transport to filling stations in Germany and finally the energetic utilization of the fuels in the vehicle. We found that the choice of production site can have a major impact on the mobility cost using the respective fuels. Especially in case of diesel production, the levelized cost of electricity driven by the full load hours of the applied renewable energy source have a huge impact. An LOHC-based system is shown to be less dependent on the kind of electricity source compared to other technologies due to its comparatively low electricity consumption and the low cost for the hydrogenation units. The length of the transportation route and the price of the filling station infrastructure, on the other hand, clearly increase mobility cost for LOHC and LH2. KW - Electric fuels, Hydrogen Utilization, Hydrogen Import, LOHC, Mobility Y1 - 2020 ER - TY - JOUR A1 - Burger, Martin T1 - Network structured kinetic models of social interactions N2 - The aim of this paper is to study the derivation of appropriate meso- and macroscopic models for interactions as appearing in social processes. There are two main characteristics the models take into account, namely a network structure of interactions, which we treat by an appropriate mesoscopic description, and a different role of interacting agents. The latter differs from interactions treated in classical statistical mechanics in the sense that the agents do not have symmetric roles, but there is rather an active and a passive agent. We will demonstrate how a certain form of kinetic equations can be obtained to describe such interactions at a mesoscopic level and moreover obtain macroscopic models from monokinetics solutions of those. The derivation naturally leads to systems of nonlocal reaction-diffusion equations (or in a suitable limit local versions thereof), which can explain spatial phase separation phenomena found to emerge from the microscopic interactions. We will highlight the approach in three examples, namely the evolution and coarsening of dialects in human language, the construction of social norms, and the spread of an epidemic. Y1 - 2021 U6 - https://doi.org/10.1007/s10013-021-00505-8 ET - Vietnam Journal of Mathematics ER - TY - JOUR A1 - Gugat, Martin A1 - Giesselmann, Jan T1 - Boundary feedback stabilization of a semilinear model for the flow in star-shaped gas networks N2 - The flow of gas through a pipeline network can be modelled by a coupled system of 1-d quasilinear hyperbolic equations. In this system, the influence of certain source terms that model friction effects is essential. Often for the solution of control problems it is convenient to replace the quasilinear model by a simpler semilinear model. In this paper, we analyze the behavior of such a semilinear model on a star-shaped network. The model is derived from the diagonal form of the quasilinear model by replacing the eigenvalues by the sound speed multiplied by 1 or -1 respectively. Thus in the corresponding eigenvalues the influence of the gas velocity is neglected, which is justified in the applications since it is much smaller than the sound speed in the gas. For a star-shaped network of horizontal pipes for suitable coupling conditions we present boundary feedback laws that stabilize the system state exponentially fast to a position of rest for sufficiently small initial data. We show the exponential decay of the $H^1$-norm for arbitrarily long pipes. This is remarkable since in general even for linear systems, for certain source terms the system can become exponentially unstable if the space interval is too long. Our proofs are based upon observability inequalities for the $L^2$ and the $H^1$-norm. Y1 - 2020 U6 - https://doi.org/10.1051/cocv/2021061 CY - ESAIM:COCV ER - TY - JOUR A1 - Gugat, Martin A1 - Schuster, Michael A1 - Zuazua, Enrique T1 - M. Gugat, M. Schuster, E. Zuazua. The Finite-Time Turnpike Phenomenon for Optimal Control Problems: Stabilization by Non-Smooth Tracking Terms, in “Stabilization of Distributed Parameter Systems: Design Methods and Applications”. Grigory Sklyar Alexander Zuyev Eds., ICIAM 2019 SEMA SIMAI Springer Series 2, p. 17-42. ISSN 2199-3041 N2 - In this paper, problems of optimal control are considered where in the objective function, in addition to the control cost, there is a tracking term that measures the distance to a desired stationary state. The tracking term is given by some norm, and therefore it is in general not differentiable. In the optimal control problem, the initial state is prescribed. We assume that the system is either exactly controllable in the classical sense or nodal profile controllable. We show that both for systems that are governed by ordinary differential equations and for infinite-dimensional systems, for example, for boundary control systems governed by the wave equation, under certain assumptions, the optimal system state is steered exactly to the desired state after finite time. Y1 - 2020 VL - SEMA SIMAI Springer Series 2 SP - 17 EP - 42 PB - Springer International Publishing ET - Grigory Sklyar Alexander Zuyev Eds., ICIAM 2019 ER - TY - INPR A1 - Sarna, Neeraj A1 - Giesselmann, Jan A1 - Benner, Peter T1 - Data-Driven Snapshot Calibration via Monotonic Feature Matching N2 - Snapshot matrices of hyperbolic equations have a slow singular value decay, resulting in inefficient reduced-order models. We develop on the idea of inducing a faster singular value decay by computing snapshots on a transformed spatial domain, or the so-called snapshot calibration/transformation. We are particularly interested in problems involving shock collision, shock rarefaction-fan collision, shock formation, etc. For such problems, we propose a realizable algorithm to compute the spatial transform using monotonic feature matching. We consider discontinuities and kinks as features, and by carefully partitioning the parameter domain, we ensure that the spatial transform has properties that are desirable both from a theoretical and an implementation standpoint. We use these properties to prove that our method results in a fast $m$-width decay of a so-called calibrated manifold. A crucial observation we make is that due to calibration, the $m$-width does not only depend on $m$ but also on the accuracy of the full order model, which is in contrast to elliptic and parabolic problems that do not need calibration. The method we propose only requires the solution snapshots and not the underlying partial differential equation (PDE) and is therefore, data-driven. We perform several numerical experiments to demonstrate the effectiveness of our method. Y1 - 2020 ER - TY - JOUR A1 - Schuster, Michael A1 - Strauch, Elisa A1 - Gugat, Martin A1 - Lang, Jens T1 - Probabilistic Constrained Optimization on Flow Networks N2 - Uncertainty often plays an important role in dynamic flow problems. In this paper, we consider both, a stationary and a dynamic flow model with uncertain boundary data on networks. We introduce two different ways how to compute the probability for random boundary data to be feasible, discussing their advantages and disadvantages. In this context, feasible means, that the flow corresponding to the random boundary data meets some box constraints at the network junctions. The first method is the spheric radial decomposition and the second method is a kernel density estimation. In both settings, we consider certain optimization problems and we compute derivatives of the probabilistic constraint using the kernel density estimator. Moreover, we derive necessary optimality conditions for the stationary and the dynamic case. Throughout the paper, we use numerical examples to illustrate our results by comparing them with a classical Monte Carlo approach to compute the desired probability. KW - Probabilistic Constraints KW - Flow Networks KW - Gas Networks KW - Spheric Radial Decomposition KW - Kernel Density Estimator Y1 - 2020 U6 - https://doi.org/https://doi.org/10.1007/s11081-021-09619-x VL - Optimization and Engineering ER - TY - INPR A1 - Aigner, Kevin-Martin A1 - Burlacu, Robert A1 - Liers, Frauke A1 - Martin, Alexander T1 - Solving AC Optimal Power Flow with Discrete Decisions to Global Optimality N2 - We present a solution framework for general alternating current optimal power flow (AC OPF) problems that include discrete decisions. The latter occur, for instance, in the context of the curtailment of renewables or the switching of power generation units and transmission lines. Our approach delivers globally optimal solutions and is provably convergent. We model AC OPF problems with discrete decisions as mixed-integer nonlinear programs. The solution method starts from a known framework that uses piecewise linear relaxations. These relaxations are modeled as as mixed-integer linear programs and adaptively refined until some termination criterion is fulfilled. In this work, we extend and complement this approach by problem-specific as well as very general algorithmic enhancements. In particular, these are mixed-integer second-order cone programs as well as primal and dual cutting planes. For example objective cuts and no-good-cuts help to compute good feasible solutions as where outer approximation constraints tighten the relaxations. We present extensive numerical results for various AC OPF problems where discrete decisions play a major role. Even for hard instances with a large proportion of discrete decisions, the method is able to generate high quality solutions efficiently. Furthermore, we compare our approach with state-of-the-art MINLP. Our method outperforms all other algorithms. KW - Mixed-Integer Nonlinear Programming KW - Second-Order Cone Programming KW - AC Optimal Power Flow KW - Discrete Decisions KW - Piecewise Linear Relaxation Y1 - 2020 ER - TY - JOUR A1 - Schewe, Lars A1 - Schmidt, Martin A1 - Thürauf, Johannes T1 - Global Optimization for the Multilevel European Gas Market System with Nonlinear Flow Models on Trees JF - Journal of Global Optimization N2 - The European gas market is implemented as an entry-exit system, which aims to decouple transport and trading of gas. It has been modeled in the literature as a multilevel problem, which contains a nonlinear flow model of gas physics. Besides the multilevel structure and the nonlinear flow model, the computation of so-called technical capacities is another major challenge. These lead to nonlinear adjustable robust constraints that are computationally intractable in general. We provide techniques to equivalently reformulate these nonlinear adjustable constraints as finitely many convex constraints including integer variables in the case that the underlying network is tree-shaped. We further derive additional combinatorial constraints that significantly speed up the solution process. Using our results, we can recast the multilevel model as a single-level nonconvex mixed-integer nonlinear problem, which we then solve on a real-world network, namely the Greek gas network, to global optimality. Overall, this is the first time that the considered multilevel entry-exit system can be solved for a real-world sized network and a nonlinear flow model. Y1 - 2020 U6 - https://doi.org/10.1007/s10898-021-01099-8 ER - TY - THES A1 - Manns, Julian T1 - Presolve of Linear Bilevel Programs N2 - Bilevel programs are complex optimization problems that can be used to model hierarchical decision processes, which occur e.g. in energy markets, critical infrastructure defense or pricing models. Even the most simple bilevel programs, where only linear objective functions and constraints appear, are non-convex optimization problems and equivalent single level formulations replace the lower level problem by its non-convex optimality constraints. This makes linear bilevel programs inherently difficult so solve. The simplification of mixed-integer linear programs before solving them, called presolve, significantly accelerated the solving of these problems. However, there is only very few literature on the topic of presolve of bilevel programs. In this thesis we review said literature on presolve of bilevel programs in the context of linear bilevel programming, derive new theoretical foundations for presolve of linear bilevel programs and then apply these results to analyze how common presolve techniques for linear and mixed integer programs can be used to presolve linear bilevel programs. Y1 - 2020 ER - TY - INPR A1 - Biefel, Christian A1 - Liers, Frauke A1 - Rolfes, Jan A1 - Schmidt, Martin T1 - Affinely Adjustable Robust Linear Complementarity Problems N2 - Linear complementarity problems are a powerful tool for modeling many practically relevant situations such as market equilibria. They also connect many sub-areas of mathematics like game theory, optimization, and matrix theory. Despite their close relation to optimization, the protection of LCPs against uncertainties - especially in the sense of robust optimization - is still in its infancy. During the last years, robust LCPs have only been studied using the notions of strict and Γ-robustness. Unfortunately, both concepts lead to the problem that the existence of robust solutions cannot be guaranteed. In this paper, we consider affinely adjustable robust LCPs. In the latter, a part of the LCP solution is allowed to adjust via a function that is affine in the uncertainty. We show that this notion of robustness allows to establish strong characterizations of solutions for the cases of uncertain matrix and vector, separately, from which existence results can be derived. Our main results are valid for the case of an uncertain LCP vector. Here, we additionally provide sufficient conditions on the LCP matrix for the uniqueness of a solution. Moreover, based on characterizations of the affinely adjustable robust solutions, we derive a mixed-integer programming formulation that allows to solve the corresponding robust counterpart. If, in addition, the certain LCP matrix is positive semidefinite, we prove polynomial-time solvability and uniqueness of robust solutions. If the LCP matrix is uncertain, characterizations of solutions are developed for every nominal matrix, i.e., these characterizations are, in particular, independent of the definiteness of the nominal matrix. Robust solutions are also shown to be unique for positive definite LCP matrix but both uniqueness and mixed-integer programming formulations still remain open problems if the nominal LCP matrix is not positive definite. KW - Linear Complementarity Problems KW - Adjustable Robustness KW - Robust Optimization KW - Existence KW - Uniqueness Y1 - 2020 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 - INPR A1 - Grimm, Veronika A1 - Nowak, Daniel A1 - Schewe, Lars A1 - Schmidt, Martin A1 - Schwartz, Alexandra A1 - Zöttl, Gregor T1 - A Tractable Multi-Leader Multi-Follower Peak-Load-Pricing Model with Strategic Interaction N2 - While single-level Nash equilibrium problems are quite well understood nowadays, less is known about multi-leader multi-follower games. However, these have important applications, e.g., in the analysis of electricity and gas markets, where often a limited number of firms interacts on various subsequent markets. In this paper, we consider a special class of two-level multi-leader multi-follower games that can be applied, e.g., to model strategic booking decisions in the European entry-exit gas market. For this nontrivial class of games, we develop a solution algorithm that is able to compute the complete set of Nash equilibria instead of just individual solutions or a bigger set of stationary points. Additionally, we prove that for this class of games, the solution set is finite and provide examples for instances without any Nash equilibria in pure strategies. We apply the algorithm to a case study in which we compute strategic booking and nomination decisions in a model of the European entry-exit gas market system. Finally, we use our algorithm to provide a publicly available test library for the considered class of multi-leader multi-follower games. This library contains problem instances with different economic and mathematical properties so that other researchers in the field can test and benchmark newly developed methods for this challenging class of problems. KW - Game theory KW - Nash-Cournot equilibria KW - Multi-leader multi-follower game KW - Peak-load pricing Y1 - 2020 U6 - https://doi.org/10.1007/s10107-021-01708-0 ER - TY - JOUR A1 - Böttger, Tom A1 - Grimm, Veronika A1 - Kleinert, Thomas A1 - Schmidt, Martin T1 - The Cost of Decoupling Trade and Transport in the European Entry-Exit Gas Market with Linear Physics Modeling JF - European Journal of Operational Research N2 - Liberalized gas markets in Europe are organized as entry-exit regimes so that gas trade and transport are decoupled. The decoupling is achieved via the announcement of technical capacities by the transmission system operator (TSO) at all entry and exit points of the network. These capacities can be booked by gas suppliers and customers in long-term contracts. Only traders who have booked capacities up-front can "nominate" quantities for injection or withdrawal of gas via a day-ahead market. To ensure feasibility of the nominations for the physical network, the TSO must only announce technical capacities for which all possibly nominated quantities are transportable. In this paper, we use a four-level model of the entry-exit gas market to analyze possible welfare losses associated with the decoupling of gas trade and transport. In addition to the multilevel structure, the model contains robust aspects to cover the conservative nature of the European entry-exit system. We provide several reformulations to obtain a single-level mixed-integer quadratic problem. The overall model of the considered market regime is extremely challenging and we thus have to make the main assumption that gas flows are modeled as potential-based linear flows. Using the derived single-level reformulation of the problem, we show that the feasibility requirements for technical capacities imply significant welfare losses due to unused network capacity. Furthermore, we find that the specific structure of the network has a considerable influence on the optimal choice of technical capacities. Our results thus show that trade and transport are not decoupled in the long term. As a further source of welfare losses and discrimination against individual actors, we identify the minimum prices for booking capacity at the individual nodes. KW - Entry-Exit Gas Market KW - Gas Market Design KW - Multilevel Optimization KW - Robust Optimization Y1 - 2020 ER - TY - JOUR A1 - Kleinert, Thomas A1 - Labbé, Martine A1 - Schmidt, Martin A1 - Plein, Fränk T1 - Closing the Gap in Linear Bilevel Optimization: A New Valid Primal-Dual Inequality JF - Optimization Letters N2 - Linear bilevel optimization problems are often tackled by replacing the linear lower-level problem with its Karush–Kuhn–Tucker (KKT) conditions. The resulting single-level problem can be solved in a branch-and-bound fashion by branching on the complementarity constraints of the lower-level problem’s optimality conditions. While in mixed-integer single-level optimization branch-and-cut has proven to be a powerful extension of branch-and-bound, in linear bilevel optimization not too many bilevel-tailored valid inequalities exist. In this paper, we briefly review existing cuts for linear bilevel problems and introduce a new valid inequality that exploits the strong duality condition of the lower level. We further discuss strengthened variants of the inequality that can be derived from McCormick envelopes. In a computational study, we show that the new valid inequalities can help to close the optimality gap very effectively on a large test set of linear bilevel instances. Y1 - 2020 IS - 15 SP - 1027 EP - 1040 ER - TY - INPR A1 - Thürauf, Johannes T1 - Deciding the Feasibility of a Booking in the European Gas Market is coNP-hard N2 - We show that deciding the feasibility of a booking (FB) in the European entry-exit gas market is coNP-hard if a nonlinear potential-based flow model is used. The feasibility of a booking can be characterized by polynomially many load flow scenarios with maximum potential-difference, which are computed by solving nonlinear potential-based flow models. We use this existing characterization of the literature to prove that FB is coNP-hard by reducing Partition to the infeasibility of a booking. We further prove that computing a potential-difference maximizing load flow scenario is NP-hard even if we can determine the flow direction a priori. From the literature, it is known that FB can be decided in polynomial time on trees and a single cycle. Thus, our hardness result draws the first line that separates the easy from the hard variants of FB and finally answers that FB is hard in general. KW - Potential-based flows, Gas networks, Computational complexity, European entry-exit market, Bookings Y1 - 2020 ER - TY - INPR A1 - Aigner, Kevin-Martin A1 - Clarner, Jan-Patrick A1 - Liers, Frauke A1 - Martin, Alexander T1 - Robust Approximation of Chance Constrained DC Optimal Power Flow under Decision-Dependent Uncertainty N2 - We propose a mathematical optimization model and its solution for joint chance constrained DC Optimal Power Flow. In this application, it is particularly important that there is a high probability of transmission limits being satisfied, even in the case of uncertain or fluctuating feed-in from renewable energy sources. In critical network situations where the network risks overload, renewable energy feed-in has to be curtailed by the transmission system operator (TSO). The TSO can reduce the feed-in in discrete steps at each network node. The proposed optimization model minimizes curtailment while ensuring that there is a high probability of transmission limits being maintained. The latter is modeled via (joint) chance constraints that are computationally challenging. Thus, we propose a solution approach based on the robust safe approximation of these constraints. Hereby, probabilistic constraints are replaced by robust constraints with suitably defined uncertainty sets constructed from historical data. The uncertainty sets are calculated by encompassing randomly drawn scenarios using the scenario approach proposed by Margellos et al. (IEEE Transactions on Automatic Control, 59 (2014)). The ability to discretely control the power feed-in then leads to a robust optimization problem with decision-dependent uncertainties, i.e. the uncertainty sets depend on decision variables. We propose an equivalent mixed-integer linear reformulation for box uncertainties with the exact linearization of bilinear terms. Finally, we present numerical results for different test cases from the Nesta archive, as well as for a real network. We consider the discrete curtailment of solar feed-in, for which we use real-world weather and network data. The experimental tests demonstrate the effectiveness of this method and run times are very fast. Moreover, on average the calculated robust solutions lead only to a small increase in curtailment, when compared to nominal solutions. KW - OR in energy KW - optimal power flow KW - chance constrained programming KW - robust optimization KW - decision-dependent uncertainty Y1 - 2020 ER - TY - INPR A1 - Habeck, Oliver A1 - Pfetsch, Marc E. T1 - Combinatorial Acyclicity Models for Potential-based Flows N2 - Potential-based flows constitute a basic model to represent physical behavior in networks. Under natural assumptions, the flow in such networks must be acyclic. The goal of this paper is to exploit this property for the solution of corresponding optimization problems. To this end, we introduce several combinatorial models for acyclic flows, based on binary variables for flow directions. We compare these models and introduce a particular model that tries to capture acyclicity together with the supply/demand behavior. We analyze properties of this model, including variable fixing rules. Our computational results show that the usage of the corresponding constraints speeds up solution times by about a factor of 3 on average and a speed-up of a factor of almost 5 for the time to prove optimality. KW - Network Optimization KW - Potential networks KW - Potential-based flows KW - acyclic flows Y1 - 2020 ER - TY - JOUR A1 - Roland, Marius A1 - Schmidt, Martin T1 - Mixed-Integer Nonlinear Optimization for District Heating Network Expansion JF - at - Automatisierungstechnik N2 - We present a mixed-integer nonlinear optimization model for computing the optimal expansion of an existing tree-shaped district heating network given a number of potential new consumers. To this end, we state a stationary and nonlinear model of all hydraulic and thermal effects in the pipeline network as well as nonlinear models for consumers and the network's depot. For the former, we consider the Euler momentum and the thermal energy equation. The thermal aspects are especially challenging. Here, we develop a novel polynomial approximation that we use in the optimization model. The expansion decisions are modeled by binary variables for which we derive additional valid inequalities that greatly help to solve the highly challenging problem. Finally, we present a case study in which we identify three major aspects that strongly influence investment decisions: the estimated average power demand of potentially new consumers, the distance between the existing network and the new consumers, and thermal losses in the network. KW - District heating networks KW - Network expansion KW - Mixed-integer nonlinear optimization Y1 - 2020 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 - Gabriel, Steven A. A1 - Leal, Marina A1 - Schmidt, Martin T1 - Solving Binary-Constrained Mixed Complementarity Problems Using Continuous Reformulations JF - Computers & Operations Research N2 - Mixed complementarity problems are of great importance in practice since they appear in various fields of applications like energy markets, optimal stopping, or traffic equilibrium problems. However, they are also very challenging due to their inherent, nonconvex structure. In addition, recent applications require the incorporation of integrality constraints. Since complementarity problems often model some kind of equilibrium, these recent applications ask for equilibrium points that additionally satisfy certain integer conditions. Obviously, this makes the problem even harder to solve. The solution approach used most frequently in the literature is to recast the complementarity conditions as disjunctive constraints using additional binary variables and big-M constraints. However, both latter aspects create issues regarding the tractability and correctness of the reformulation. In this paper, we follow the opposite route and restate the integrality conditions as complementarity constraints, leading to purely continuous reformulations that can be tackled by local solvers. We study these reformulations theoretically and provide a numerical study that shows that continuous reformulations are useful in practice both in terms of solution times and solution quality. KW - Binary-constrained mixed complementarity problems KW - Mixed-integer optimization KW - Continuous reformulations KW - Spatial price equilibrium problems Y1 - 2020 ER - TY - INPR A1 - Kuchlbauer, Martina A1 - Liers, Frauke A1 - Stingl, Michael T1 - Adaptive bundle methods for nonlinear robust optimization N2 - Currently, there are few theoretical or practical approaches available for general nonlinear robust optimization. Moreover, the approaches that do exist impose restrictive assumptions on the problem structure. We present an adaptive bundle method for nonlinear and non-convex robust optimization problems with a suitable notion of inexactness in function values and subgradients. As the worst case evaluation requires a global solution to the adversarial problem, it is a main challenge in a general non-convex nonlinear setting. Moreover, computing elements of an epsilon-perturbation of the Clarke subdifferential in the l2-norm sense is in general prohibitive for this class of problems. In this article, instead of developing an entirely new bundle concept, we demonstrate how existing approaches, such as Noll's bundle method for non-convex minimization with inexact information (Computational and analytical mathematics 50: 555-592, 2013) can be modified to be able to cope with this situation. Extending the non-convex bundle concept to the case of robust optimization in this way, we prove convergence under two assumptions: Firstly, that the objective function is lower C1 and secondly, that approximately optimal solutions to the adversarial maximization problem are available. The proposed method is hence applicable to a rather general setting of nonlinear robust optimization problems. In particular, we do not rely on a specific structure of the adversary's constraints. The considered class of robust optimization problems covers the case that the worst-case adversary only needs to be evaluated up to a certain precision. One possibility to evaluate the worst case with the desired degree of precision is the use of techniques from mixed-integer linear programming (MIP). We investigate the procedure on some analytic examples. As applications, we study the gas transport problem under uncertainties in demand and in physical parameters that affect pressure losses in the pipes. Computational results for examples in large realistic gas network instances demonstrate the applicability as well as the efficiency of the method. Y1 - 2020 ER - TY - THES A1 - Philippi, Nora T1 - Analysis and Numerical Approximation of Transport Equations on Networks N2 - This work deals with the analysis and numerical approximation of transport problems on networks. Appropriate coupling conditions are proposed that allow to establish well-posedness of the continuous problem by semigroup theory. A discontinuous Galerkin method is proposed for the space discretization and its well-posedness and order optimal convergence rates are proven. In addition, the time discretization by the implicit Euler method is investigated. Y1 - 2020 ER - TY - JOUR A1 - Çelebi, Emre A1 - Krebs, Vanessa A1 - Schmidt, Martin T1 - Γ-Robust Electricity Market Equilibrium Models with Transmission and Generation Investments JF - Energy Systems N2 - We consider uncertain robust electricity market equilibrium problems including transmission and generation investments. Electricity market equilibrium modeling has a long tradition but is, in most of the cases, applied in a deterministic setting in which all data of the model are known. Whereas there exist some literature on stochastic equilibrium problems, the field of robust equilibrium models is still in its infancy. We contribute to this new field of research by considering Γ-robust electricity market equilibrium models on lossless DC networks with transmission and generation investments. We state the nominal market equilibrium problem as a mixed complementarity problem as well as its variational inequality and welfare optimization counterparts. For the latter, we then derive a Γ-robust formulation and show that it is indeed the counterpart of a market equilibrium problem with robustified player problems. Finally, we present two case studies to gain insights into the general effects of robustification on electricity market models. In particular, our case studies reveal that the transmission system operator tends to act more risk-neutral in the robust setting, whereas generating firms clearly behave more risk-averse. KW - Robust optimization KW - Robust market equilibria KW - Electricity market equilibrium models KW - Transmission and generation investment KW - Perfect competition Y1 - 2020 ER - TY - JOUR A1 - Schewe, Lars A1 - Schmidt, Martin A1 - Thürauf, Johannes T1 - Computing Technical Capacities in the European Entry-Exit Gas Market is NP-Hard JF - Annals of Operations Research N2 - As a result of its liberalization, the European gas market is organized as an entry-exit system in order to decouple the trading and transport of natural gas. Roughly summarized, the gas market organization consists of four subsequent stages. First, the transmission system operator (TSO) is obliged to allocate so-called maximal technical capacities for the nodes of the network. Second, the TSO and the gas traders sign mid- to long-term capacity-right contracts, where the capacity is bounded above by the allocated technical capacities. These contracts are called bookings. Third, on a day-ahead basis, gas traders can nominate the amount of gas that they inject or withdraw from the network at entry and exit nodes, where the nominated amount is bounded above by the respective booking. Fourth and finally, the TSO has to operate the network such that the nominated amounts of gas can be transported. By signing the booking contract, the TSO guarantees that all possibly resulting nominations can indeed be transported. Consequently, maximal technical capacities have to satisfy that all nominations that comply with these technical capacities can be transported through the network. This leads to a highly challenging mathematical optimization problem. We consider the specific instantiations of this problem in which we assume capacitated linear as well as potential-based flow models. In this contribution, we formally introduce the problem of Computing Technical Capacities (CTC) and prove that it is NP-complete on trees and NP-hard in general. To this end, we first reduce the Subset Sum problem to CTC for the case of capacitated linear flows in trees. Afterward, we extend this result to CTC with potential-based flows and show that this problem is also NP-complete on trees by reducing it to the case of capacitated linear flow. Since the hardness results are obtained for the easiest case, i.e., on tree-shaped networks with capacitated linear as well as potential-based flows, this implies the hardness of CTC for more general graph classes. KW - European Entry-Exit Gas Market KW - Technical Capacities KW - Potential-Based Flows KW - Computational Complexity KW - NP-Hardness Y1 - 2020 U6 - https://doi.org/10.1007/s10479-020-03725-2 IS - 295 SP - 337 EP - 362 ER - TY - INPR A1 - Liers, Frauke A1 - Martin, Alexander A1 - Merkert, Maximilian A1 - Mertens, Nick A1 - Michaels, Dennis T1 - Solving Mixed-Integer Nonlinear Optimization Problems using Simultaneous Convexification - a Case Study for Gas Networks N2 - Solving mixed-integer nonlinear optimization problems (MINLPs) to global optimality is extremely challenging. An important step for enabling their solution consists in the design of convex relaxations of the feasible set. Known solution approaches based on spatial branch-and-bound become more effective the tighter the used relaxations are. Relaxations are commonly established by convex underestimators, where each constraint function is considered separately. Instead, a considerably tighter relaxation can be found via so-called simultaneous convexification, where convex underestimators are derived for more than one constraint function at a time. In this work, we present a global solution approach for solving mixed-integer nonlinear problems that uses simultaneous convexification. We introduce a separation method that relies on determining the convex envelope of linear combinations of the constraint functions and on solving a nonsmooth convex problem. In particular, we apply the method to quadratic absolute value functions and derive their convex envelopes. The practicality of the proposed solution approach is demonstrated on several test instances from gas network optimization, where the method outperforms standard approaches that use separate convex relaxations. KW - Mixed-Integer Nonlinear Programming KW - Simultaneous Convexification KW - Convex Envelope KW - Gas Network Optimization Y1 - 2020 ER - TY - JOUR A1 - Kleinert, Thomas A1 - Grimm, Veronika A1 - Schmidt, Martin T1 - Outer Approximation for Global Optimization of Mixed-Integer Quadratic Bilevel Problems JF - Mathematical Programming (Series B) N2 - Bilevel optimization problems have received a lot of attention in the last years and decades. Besides numerous theoretical developments there also evolved novel solution algorithms for mixed-integer linear bilevel problems and the most recent algorithms use branch-and-cut techniques from mixed-integer programming that are especially tailored for the bilevel context. In this paper, we consider MIQP-QP bilevel problems, i.e., models with a mixed-integer convex-quadratic upper level and a continuous convex-quadratic lower level. This setting allows for a strong-duality-based transformation of the lower level which yields, in general, an equivalent nonconvex single-level reformulation of the original bilevel problem. Under reasonable assumptions, we can derive both a multi- and a single-tree outer-approximation-based cutting-plane algorithm. We show finite termination and correctness of both methods and present extensive numerical results that illustrate the applicability of the approaches. It turns out that the proposed methods are capable of solving bilevel instances with several thousand variables and constraints and significantly outperform classical solution approaches. KW - Bilevel optimization KW - Outer approximation KW - Quadratic programming KW - Convex mixed-integer nonlinear optimization Y1 - 2019 ER - TY - INPR A1 - Veronika, Grimm A1 - Kretschmer, Sandra A1 - Mehl, Simon T1 - Home energy storage: A characterization of potential adopters in Germany N2 - Home energy storage (HES) poses a promising option to foster flexible electricity demand and grid-stabilising self-supply. Understanding the characteristics of potential storage adopters and their motives for adopting is essential to enable targeted measures to promote diffusion. This paper presents an in-depth analysis of motivational and psychological factors as well as product characteristics that affect the willingness to adopt domestic energy storage. Based on a selective sample of solar panel owners as the main energy storage target group, we find that potential adopters differ systematically in their evaluation of economic and non-economic characteristics of home energy storage. Using correlation-based average linkage clustering, we identify four distinct types of storage adopters: finance-oriented, independence-oriented, idealistic and multilaterally oriented households. Our findings emphasise that segment-specific policy strategies and support mechanisms are needed to stimulate HES adoption to pave the way for a sustainable energy system. KW - Energy storage, Consumer segmentation, Adoption decision, Innovation diffusion Y1 - 2019 ER - TY - JOUR A1 - Grimm, Veronika A1 - Kretschmer, Sandra A1 - Mehl, Simon T1 - Green innovations: The organizational setup of pilot projects and its influence on consumer perceptions JF - Energy Policy N2 - Pilot-, test- and demonstration-projects (PTDs) are a prominent policy tool to promote the adoption of smart, green technologies. However, as technology adoption is heavily dependent on the individual attributes and beliefs of potential adopters, it is important to understand the influence of a PTD’s organizational setup on technology perception. By varying the information about a PTD’s organizational setup in a survey experiment among a selected sample of potential PTD-participants, we gather first experimental evidence for the effect of different setups on the perception of green technologies. We show that the organizational setup has a significant impact on a product’s perceived contribution to the energy transition, its establishment in the market, cost-reduction potential, innovativeness and environmental friendliness. In particular, full organizational cooperation between government, university and industry consistently improves perceptions compared to a partial setup. Regarding the willingness to participate in a PTD, we find that communication and support are the most imperative aspects and even more important than economic benefits. Our findings provide policy-makers with a more ample foundation on how PTDs should be designed to successfully transfer technologies to the market. KW - Pilot projects, Organizational setup, Adoption decision, Quadruple Helix, Innovation diffusion Y1 - 2019 U6 - https://doi.org/10.1016/j.enpol.2020.111474 IS - 142 ER - TY - JOUR A1 - Bichler, Martin A1 - Grimm, Veronika A1 - Kretschmer, Sandra A1 - Sutterer, Paul T1 - Market Design for Renewable Energy Auctions: An Analysis of Alternative Auction Formats JF - Energy Economics N2 - Auctions are widely used to determine the remuneration for renewable energies. They typically induce a high concentration of renewable energy plants at very productive sites far-off the main load centres, leading to an inefficient allocation as transmission line capacities are restricted but not considered in the allocation, resulting in an inefficient system configuration in the long run. To counteract these tendencies effectively, we propose a combinatorial auction design that allows to implement regional target capacities, provides a simple pricing rule and maintains a high level of competition between bidders by permitting package bids. By means of extensive numerical experiments we evaluate the combinatorial auction as compared to three further RES auction designs, the current German nationwide auction design, a simple nationwide auction, and regional auctions. We find that if bidders benefit from high enough economies of scale, the combinatorial auction design implements system-optimal target capacities without increasing the average remuneration per kWh as compared to the current German auction design. The prices resulting from the combinatorial auction are linear and anonymous for each region whenever possible, while minimal personalised markups on the linear prices are applied only when necessary. We show that realistic problem sizes can be solved in seconds, even though the problem is computationally hard. KW - renewable energy auction, combinatorial auction, market design Y1 - 2019 U6 - https://doi.org/10.1016/j.eneco.2020.104904 IS - 92 ER - TY - JOUR A1 - Ambrosius, Mirjam A1 - Egerer, Jonas A1 - Grimm, Veronika A1 - van der Weijde, Adriaan H. T1 - Uncertain bidding zone configurations: The role of expectations for transmission and generation capacity expansion JF - European Journal of Operational Research N2 - Ongoing policy discussions on the reconfiguration of bidding zones in European electricity markets induce uncertainty about the future market design. This paper deals with the question of how this uncertainty affects market participants and their long-run investment decisions in generation and transmission capacity. Generalizing the literature on pro-active network expansion planning, we propose a stochastic multilevel model which incorporates generation capacity investment, network expansion, and market operation, taking into account uncertainty about the future bidding zone configuration. Using a stylized two-node network, we disentangle different effects that uncertainty has on market outcomes. If there is a possibility that future bidding zone configurations provide improved regional price signals, welfare gains materialize even if the change does not actually take place. As a consequence, welfare gains of an actual change of the bidding zone configuration are substantially lower due to those anticipatory effects. Additionally, we show substantial distributional effects in terms of both expected gains and risks, between producers and consumers and between different generation technologies. Y1 - 2019 U6 - https://doi.org/10.1016/j.ejor.2020.01.024 IS - 285 (1) SP - 343 EP - 359 ER - TY - JOUR A1 - Heitsch, Holger A1 - Henrion, René T1 - An enumerative formula for the spherical cap discrepancy N2 - The spherical cap discrepancy is a widely used measure for how uniformly a sample of points on the sphere is distributed. Being hard to compute, this discrepancy measure is typically replaced by some lower or upper estimates when designing optimal sampling schemes for the uniform distribution on the sphere. In this paper, we provide a fully explicit, easy to implement enumerative formula for the spherical cap discrepancy. Not surprisingly, this formula is of combinatorial nature and, thus, its application is limited to spheres of small dimension and moderate sample sizes. Nonetheless, it may serve as a useful calibrating tool for testing the efficiency of sampling schemes and its explicit character might be useful also to establish necessary optimality conditions when minimizing the discrepancy with respect to a sample of given size. KW - spherical cap discrepancy KW - uniform distribution on sphere KW - optimality conditions Y1 - 2019 U6 - https://doi.org/10.1016/j.cam.2021.113409 ER - TY - INPR A1 - Grimm, Veronika A1 - Martin, Alexander A1 - Sölch, Christian A1 - Weibelzahl, Martin A1 - Zöttl, Gregor T1 - Market-Based Redispatch May Result in Inefficient Dispatch N2 - In this paper we analyze a uniform price electricity spot market that is followed by redispatch in the case of network congestion. We assume that the transmission system operator is incentivized to minimize redispatch cost and compare a cost-based redispatch (CBR) to a market-based redispatch (MBR) mechanism. For networks with at least three nodes we show that in contrast to CBR, in the case of MBR the redispatch cost minimizing allocation may not be short-run efficient. As we demonstrate, in case of MBR the possibility of the transmission system operator to reduce redispatch cost at the expense of a reduced welfare may be driven by the electricity supply side or the electricity demand side. If, however, the transmission system operator is obliged to implement the welfare maximizing (instead of the redispatch cost minimizing) dispatch by regulation, this will result in an efficient dispatch also in case of MBR. KW - Electricity Markets, Redispatch, Congestion Management, Computational Equilibrium Models Y1 - 2019 ER - TY - JOUR A1 - Runge, Philipp A1 - Sölch, Christian A1 - Albert, Jakob A1 - Wasserscheid, Peter A1 - Zöttl, Gregor A1 - Grimm, Veronika T1 - Economic comparison of different electric fuels for energy scenarios in 2035 JF - Applied Energy N2 - Electric fuels (e-fuels) enable CO2-neutral mobility and are therefore an alternative to battery-powered electric vehicles. This paper compares the cost-effectiveness of Fischer-Tropsch diesel, methanol and Liquid Organic Hydrogen Carriers. The production costs of those fuels are to a large part driven by the energy-intensive electrolytic hydrogen production. In this paper, we apply a multi-level electricity market model to calculate future hourly electricity prices for various electricity market designs in Germany for the year 2035. We then assess the economic efficiency of the different fuels under various future market conditions. In particular, we use the electricity price vectors derived from an electricity market model calibrated for 2035 as an input for a mathematical model of the entire process chain from hydrogen production and chemical bonding to the energetic utilization of the fuels in a vehicle. Within this model, we perform a sensitivity analysis, which quantifies the impact of various parameters on the fuel production cost. Most importantly, we consider prices resulting from own model calculations for different energy market designs, the investment cost for the electrolysis systems and the carbon dioxide purchase price. The results suggest that the use of hydrogen, which is temporarily bound to Liquid Organic Hydrogen Carriers, is a favorable alternative to the more widely discussed synthetic diesel and methanol. KW - Sector Coupling, Eletricity Markets, Electric fuels, Hydrogen Utilization, LOHC, Mobility Y1 - 2019 U6 - https://doi.org/10.1016/j.apenergy.2018.10.023 IS - 233-234 SP - 1078 EP - 1093 ER - TY - JOUR A1 - Grimm, Veronika A1 - Grübel, Julia A1 - Rückel, Bastian A1 - Sölch, Christian A1 - Zöttl, Gregor T1 - Storage investment and network expansion in distribution networks: The impact of regulatory frameworks JF - Applied Energy N2 - In this paper we propose a bi-level equilibrium model that allows to analyze the impact of different regulatory frameworks on storage and network investment in distribution networks. In our model, a regulated distribution system operator decides on network investment and operation while he anticipates the decisions of private agents on storage investment and operation. Since, especially in distribution networks, voltage stability and network losses have a decisive influence on network expansion and operation, we use a linearized AC power flow formulation to adequately account for these aspects. As adjustments of the current regulatory framework, we consider curtailment of renewable production, the introduction of a network fee based on the maximum renewable feed-in, and a subsidy scheme for storage investment. The performance of the different alternative frameworks is compared to the performance under rules that are commonly applied in various countries today, as well as to a system-optimal (first-best) benchmark. To illustrate the economic effects, we calibrate our model with data from the field project Smart Grid Solar. Our results reveal that curtailment and a redesign of network fees both have the potential to significantly reduce total system costs. On the contrary, investment subsidization of storage capacity has only a limited impact as long as the distribution system operator is not allowed to intervene in storage operation. KW - Computational Equilibrium Models; Electricity Markets; Investment Incentives; Distribution Network Expansion Planning; Storage Investment and Operation; Renewable Energy Production; (Self-) Consumption Y1 - 2019 U6 - https://doi.org/10.1016/j.apenergy.2019.114017 IS - 262 ER - TY - JOUR A1 - Grimm, Veronika A1 - Rückel, Bastian A1 - Sölch, Christian A1 - Zöttl, Gregor T1 - Regionally differentiated network fees to affect incentives for generation investment JF - Energy N2 - In this paper we propose an equilibrium model that allows to analyze subsidization schemes to affect locational choices for generation investment in electricity markets. Our framework takes into account generation investment decided by private investors and redispatch as well as network expansion decided by a regulated transmission system operator. In order to take into account the different objectives and decision variables of those agents, our approach uses a bi-level structure. We focus on the case of regionally differentiated network fees which have to be paid by generators (a so called g-component). The resulting investment and production decisions are compared to the outcome of an equilibrium model in the absence of such regionally differentiated investment incentives and to an overall optimal (first-best) benchmark. To illustrate possible economic effects, we calibrate our framework with data from the German electricity market. Our results reveal that while regionally differentiated network fees do have a significant impact on locational choice of generation capacities, we do not find significant effects on either welfare or network expansion. KW - Electricity Markets, Network Expansion, Generation Expansion, Investment Incentives, Computational Equilibrium Models Y1 - 2019 U6 - https://doi.org/10.1016/j.energy.2019.04.035 IS - 177 SP - 487 EP - 502 ER - TY - JOUR A1 - Grimm, Veronika A1 - Rückel, Bastian A1 - Sölch, Christian A1 - Zöttl, Gregor T1 - The impact of market design on transmission and generation investment in electricity markets JF - Energy Economics N2 - In this paper we propose an equilibrium model in order to analyze the impact of electricity market design on generation and transmission expansion in liberalized electricity markets. In a multi-level structure, our framework takes into account that generation investment and operation is decided by private investors, while network expansion and redispatch is decided by a regulated transmission system operator — as well as the different objectives of firms (profit maximization) and the regulator (welfare maximization). In order to illustrate the possibilities to quantify long term economic effects with our framework, we calibrate our model for the German electricity market. We consider various moderate adjustments of the market design: (i) the division of the market area into two price zones, (ii) the efficient curtailment of renewable production and (iii) a cost-benefit-driven balance between network expansion and network management measures. We then analyze the impact of these market designs on generation and transmission investment in case those design elements are anticipated upon network development planning. The resulting investment and production decisions are compared to a benchmark that reflects the current German electricity market design and to an overall optimal first-best benchmark. Our results reveal that price zones do have a significant impact on locational choice of generators and result in a reduced need for network expansion, but lead to only moderate annual welfare gains of approximately 0.9% of annual total system costs. Anticipation of optimal curtailment of renewables and a cost-benefit-driven use of redispatch operations upon network expansion planning, however, implies a welfare gain of over 4.9% of annual total system costs per year as compared to the existing market design, which equals 85% of the maximum possible welfare gain of the first-best benchmark. KW - Electricity Markets, Network Expansion, Generation Expansion, Investment Incentives, Market Design, Congestion Management, Computational Equilibrium Models Y1 - 2019 U6 - https://doi.org/10.1016/j.eneco.2020.104934 IS - 93 ER - TY - INPR A1 - Bohlayer, Markus A1 - Fleschutz, Markus A1 - Braun, Marco A1 - Zöttl, Gregor T1 - Energy-intense production-inventory planning with participation in sequential energy markets N2 - To support the uprise of demand response, especially in the context of industrial processes, we propose a new approach to integrally determine the production-inventory plan and the cost-minimizing bids to participate in sequential reserve and energy-only markets. In particular, our approach considers time-coupling constraints which occur in the context of a production-inventory planning problem. We extend this problem with a comprehensive bidding formulation, which allows evaluating revenues and potential cost from the market participation, considering price uncertainties and uncertain activations of committed reserve capacity. This results in a multistage stochastic mixed-integer linear program, which explicitly considers the stage-wise revelation of information in our setup. To illustrate the capabilities of our approach, we apply our model to a real-world case study in which we investigate the participation of a cement plant in the German energy-only and reserve markets. The results of our case study indicate significant revenues for flexible industrial processes when participating in German spot and reserve markets. KW - Demand side flexibility Load management Multi market bidding Stochastic programming Production planning Demand response Y1 - 2019 ER - TY - JOUR A1 - Egerer, Jonas A1 - Grimm, Veronika A1 - Kleinert, Thomas A1 - Schmidt, Martin A1 - Zöttl, Gregor T1 - The Impact of Neighboring Markets on Renewable Locations, Transmission Expansion, and Generation Investment JF - European Journal of Operational Research N2 - Many long-term investment planning models for liberalized electricity markets either optimize for the entire electricity system or focus on confined jurisdictions, abstracting from adjacent markets. In this paper, we provide models for analyzing the impact of the interdependencies between a core electricity market and its neighboring markets on key long-run decisions. This we do both for zonal and nodal pricing schemes. The identification of welfare optimal investments in transmission lines and renewable capacity within a core electricity market requires a spatially restricted objective function, which also accounts for benefits from cross-border electricity trading. This leads to mixed-integer nonlinear multilevel optimization problems with bilinear nonconvexities for which we adapt a Benders-like decomposition approach from the literature. In a case study, we use a stylized six-node network to disentangle different effects of optimal regional (as compared to supra-regional) investment planning. Regional planning alters investment in transmission and renewable capacity in the core region, which affects private investment in generation capacity also in adjacent regions and increases welfare in the core region at the cost of system welfare. Depending on the congestion-pricing scheme, the regulator of the core region follows different strategies to increase welfare causing distributional effects among stakeholders. KW - Neighboring Markets KW - Renewables KW - Network Expansion KW - Multilevel Optimization KW - Benders Decomposition Y1 - 2019 ER - TY - JOUR A1 - Ulbrich, Stefan A1 - Schmitt, Johann Michael A1 - Schäfer Aguilar, Paloma A1 - Moos, Michael T1 - On the numerical discretization of optimal control problems for conservation laws N2 - We analyze the convergence of discretization schemes for the adjoint equation arising in the adjoint-based derivative computation for optimal control problems governed by entropy solutions of conservation laws. The difficulties arise from the fact that the correct adjoint state is the reversible solution of a transport equation with discontinuous coefficient and discontinuous end data. We derive the discrete adjoint scheme for monotone difference schemes in conservation form. It is known that convergence of the discrete adjoint can only be expected if the numerical scheme has viscosity of order O(h^\alpha) with appropriate 0 < \alpha < 1, which leads to quite viscous shock profiles. We show that by a slight modification of the end data of the discrete adjoint scheme convergence to the correct reversible solution can be obtained also for numerical schemes with viscosity of order O(h) and with sharp shock resolution. The theoretical findings are confirmed by numerical results. 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 - JOUR A1 - Labbé, Martine A1 - Plein, Fränk A1 - Schmidt, Martin A1 - Thürauf, Johannes T1 - Deciding Feasibility of a Booking in the European Gas Market on a Cycle is in P for the Case of Passive Networks JF - Networks N2 - We show that the feasibility of a booking in the European entry-exit gas market can be decided in polynomial time on single-cycle networks that are passive, i.e., do not contain controllable elements. The feasibility of a booking can be characterized by solving polynomially many nonlinear potential-based flow models for computing so-called potential-difference maximizing load flow scenarios. We thus analyze the structure of these models and exploit both the cyclic graph structure as well as specific properties of potential-based flows. This enables us to solve the decision variant of the nonlinear potential-difference maximization by reducing it to a system of polynomials of constant dimension that is independent of the cycle's size. This system of fixed dimension can be handled with tools from real algebraic geometry to derive a polynomial-time algorithm. The characterization in terms of potential-difference maximizing load flow scenarios then leads to a polynomial-time algorithm for deciding the feasibility of a booking. Our theoretical results extend the existing knowledge about the complexity of deciding the feasibility of bookings from trees to single-cycle networks. KW - Gas networks KW - European entry-exit market KW - Bookings KW - Potential-based flows KW - Computational complexity Y1 - 2019 U6 - https://doi.org/10.1007/s00186-021-00752-y VL - 78 IS - 2 SP - 128 EP - 152 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 - Krebs, Vanessa A1 - Müller, Michael A1 - Schmidt, Martin T1 - Γ-Robust Linear Complementarity Problems with Ellipsoidal Uncertainty Sets T2 - International Transactions in Operational Research N2 - We study uncertain linear complementarity problems (LCPs), i.e., problems in which the LCP vector q or the LCP matrix M may contain uncertain parameters. To this end, we use the concept of Γ-robust optimization applied to the gap function formulation of the LCP. Thus, this work builds upon [16]. There, we studied Γ-robustified LCPs for l1- and box-uncertainty sets, whereas we now focus on ellipsoidal uncertainty set. For uncertainty in q or M, we derive conditions for the tractability of the robust counterparts. For these counterparts, we also give conditions for the existence and uniqueness of their solutions. Finally, a case study for the uncertain traffic equilibrium problem is considered, which illustrates the effects of the values of Γ on the feasibility and quality of the respective robustified solutions. KW - Robust optimization KW - Linear complementarity problems KW - Ellipsoidal uncertainty sets KW - Traffic equilibrium problems Y1 - 2019 IS - 29(1) SP - 417 EP - 441 ER - TY - JOUR A1 - Krug, Richard A1 - Mehrmann, Volker A1 - Schmidt, Martin T1 - Nonlinear Optimization of District Heating Networks JF - Optimization and Engineering N2 - We develop a complementarity-constrained nonlinear optimization model for the time-dependent control of district heating networks. The main physical aspects of water and heat flow in these networks are governed by nonlinear and hyperbolic 1d partial differential equations. In addition, a pooling-type mixing model is required at the nodes of the network to treat the mixing of different water temperatures. This mixing model can be recast using suitable complementarity constraints. The resulting problem is a mathematical program with complementarity constraints subject to nonlinear partial differential equations describing the physics. In order to obtain a tractable problem, we apply suitable discretizations in space and time, resulting in a finite-dimensional optimization problem with complementarity constraints for which we develop a suitable reformulation with improved constraint regularity. Moreover, we propose an instantaneous control approach for the discretized problem, discuss practically relevant penalty formulations, and present preprocessing techniques that are used to simplify the mixing model at the nodes of the network. Finally, we use all these techniques to solve realistic instances. Our numerical results show the applicability of our techniques in practice. KW - District heating networks KW - Nonlinear optimization KW - Euler equations KW - Differential-algebraic equations KW - Complementarity constraints Y1 - 2019 IS - 22(2) SP - 783 EP - 819 ER - TY - JOUR A1 - Farshbaf Shaker, Mohammad Hassan A1 - Gugat, Martin A1 - Heitsch, Holger A1 - Henrion, René T1 - Optimal Neumann boundary control of a vibrating string with uncertain initial data and probabilistic terminal constraints N2 - In optimal control problems, often initial data are required that are not known exactly in practice. In order to take into account this uncertainty, we consider optimal control problems for a system with an uncertain initial state. A finite terminal time is given. On account of the uncertainty of the initial state, it is not possible to prescribe an exact terminal state. Instead, we are looking for controls that steer the system into a given neighborhood of the desired terminal state with sufficiently high probability. This neighborhood is described in terms of an inequality for the terminal energy. The probabilistic constraint in the considered optimal control problem leads to optimal controls that are robust against the inevitable uncertainties of the initial state. We show the existence of such optimal controls. Numerical examples with optimal Neumann control of the wave equation are presented. KW - PDE constrained optimization, probabilistic constraints, uncertain initial data Y1 - U6 - https://doi.org/10.1137/19M1269944 ER - TY - JOUR A1 - Heitsch, Holger T1 - On probabilistic capacity maximization in a stationary gas network JF - Optimization N2 - The question for the capacity of a given gas network, i.e., determining the maximal amount of gas that can be transported by a given network, appears as an essential question that network operators and political administrations are regularly faced with. In that context we present a novel mathematical approach in order to assist gas network operators in managing increasing uncertainty with respect to customers gas nominations and in exposing free network capacities while reliability of transmission and supply is taken into account. The approach is based on the rigorous examination of optimization problems with nonlinear probabilistic constraints. As consequence we deal with solving a problem belonging to the class of probabilistic/robust optimization problems, which can be formulated with some joint probabilistic constraint over an infinite system of random inequalities. We will show that the inequality system can be reduced to a finite one in the situation of considering a tree network topology. A detailed study of the problem of maximizing bookable capacities in a stationary gas network is presented that comes up with an algebraic model involving Kirchhoff's first and second laws. The focus will be on both the theoretical and numerical side. The analytical part consists in introducing and validating a generalized version of the known rank two constraint qualification implying the differentiability of the considered capacity problem. The results are important in order to solve the capacity problem numerically, where function and gradient evaluations of the probabilistic constraints are performed by an approach using spheric-radial decomposition applicable for multivariate Gaussian random variables and more general distributions. KW - stationary gas networks, booked capacities, probabilistic constraints, constraint qualification, spheric-radial decomposition Y1 - 2019 U6 - https://doi.org/10.1080/02331934.2019.1625353 ER - TY - JOUR A1 - Heitsch, Holger A1 - Strogies, Nikolai T1 - Consequences of uncertain friction for the transport of natural gas through passive networks of pipelines JF - Springer N2 - Assuming a pipe-wise constant structure of the friction coefficient in the modeling of natural gas transport through a passive network of pipes via semilinear systems of balance laws with associated linear coupling and boundary conditions, uncertainty in this parameter is quantified by a Markov chain Monte Carlo method. Information on the prior distribution is obtained from practitioners. The results are applied to the problem of validating technical feasibility under random exit demand in gas transport networks. The impact of quantified uncertainty to the probability level of technical feasible exit demand situations is studied by two example networks of small and medium size. The gas transport of the network is modeled by stationary solutions that are steady states of the time dependent semilinear problems. KW - uncertainty quantification, Markov chain Monte Carlo, reliability of gas networks, nomination validation, spheric-radial decomposition Y1 - 2019 SP - 211 EP - 238 ET - Topics in Applied Analysis and Optimisation ER - TY - INPR A1 - Hümbs, Lukas A1 - Martin, Alexander A1 - Schewe, Lars T1 - Exploiting complete linear descriptions for decentralized power market problems with integralities N2 - It is well known that linear prices supporting a competitive equilibrium exist in the case of convex markets, however, in the presence of integralities this is open and hard to decide in general. We present necessary and sufficient conditions for the existence of such prices for decentralized market problems where market participants have integral decision variables and their feasible sets are given in complete linear description. We utilize total unimodularity and the aforementioned conditions to show that such linear prices exist and present some applications. Furthermore, we compute competitive equilibria for two classes of decentralized market problems arising in energy markets and show that competitive equilibria may exist regardless of integralities. KW - Mixed-integer programming KW - Competitive equilibrium KW - Linear prices KW - Total unimodularity Y1 - 2019 N1 - Former title: "On the existence of solutions to market equilibrium problems with integralities" ER - TY - JOUR A1 - Hauschild, Sarah-Alexa A1 - Marheineke, Nicole A1 - Mehrmann, Volker A1 - Mohring, Jan A1 - Badlyan, Arbi Moses A1 - Rein, Markus A1 - Schmidt, Martin T1 - Port-Hamiltonian modeling of district heating networks JF - Progress in Differential Algebraic Equations II (edited by Reis T., Grundel S., and Schöps S). Differential-Algebraic Equations Forum N2 - This paper provides a first contribution to port-Hamiltonian modeling of district heating networks. By introducing a model hierarchy of flow equations on the network, this work aims at a thermodynamically consistent port-Hamiltonian embedding of the partial differential-algebraic systems. We show that a spatially discretized network model describing the advection of the internal energy density with respect to an underlying incompressible stationary Euler-type hydrodynamics can be considered as a parameter-dependent finite-dimensional port-Hamiltonian system. Moreover, we present an infinite-dimensional port-Hamiltonian formulation for a compressible instationary thermodynamic fluid flow in a pipe. Based on these first promising results, we raise open questions and point out research perspectives concerning structure-preserving discretization, model reduction, and optimization. KW - Partial differential equations on networks KW - Port-Hamiltonian model framework KW - Energy-based formulation KW - District heating network KW - Thermodynamic fluid flow Y1 - 2019 ER - TY - JOUR A1 - Grimm, Veronika A1 - Orlinskaya, Galina A1 - Schewe, Lars A1 - Schmidt, Martin A1 - Zöttl, Gregor T1 - Optimal Design of Retailer-Prosumer Electricity Tariffs Using Bilevel Optimization JF - Computers & Operations Research N2 - We compare various flexible tariffs that have been proposed to cost-effectively govern a prosumer's electricity management - in particular time-of-use (TOU), critical-peak-pricing (CPP), and a real-time-pricing tariff (RTP). As the outside option, we consider a fixed-price tariff (FP) that restricts the specific characteristics of TOU, CPP, and RTP, so that the flexible tariffs are at least as profitable for the prosumer as the fixed-price tariff. We propose bilevel models to determine the optimal interplay between the retailer's tariff design and the prosumer's decisions on using the storage, on consumption, and on electricity purchases from as well as electricity sales to the grid. The single-level reformulations of the considered bilevel models are computationally highly challenging optimization problems since they, e.g., combine bilinearities and mixed-integer aspects for modeling certain tariff structures. Based on a computational study using real-world data, we find that RTP increases retailer profits, however, leads to the largest price volatility for the prosumer. TOU and CPP only yield mild additional retailer profits and, due to the multiplicity of optimal plans on the part of the prosumer, imply uncertain revenues for the retailer. KW - Electricity tariffs KW - Pricing KW - Bilevel optimization KW - Mixed-integer optimization KW - Tariff design Y1 - 2019 IS - 114 ER - TY - JOUR A1 - Gatzert, Nadine A1 - Martin, Alexander A1 - Schmidt, Martin A1 - Seith, Benjamin A1 - Vogl, Nikolai T1 - Portfolio Optimization with Irreversible Long-Term Investments in Renewable Energy under Policy Risk: A Mixed-Integer Multistage Stochastic Model and a Moving-Horizon Approach JF - European Journal of Operational Research N2 - Portfolio optimization is an ongoing hot topic of mathematical optimization and management science. Due to the current financial market environment with low interest rates and volatile stock markets, it is getting more and more important to extend portfolio optimization models by other types of investments than classical assets. In this paper, we present a mixed-integer multistage stochastic model that includes investment opportunities in irreversible and long-term infrastructure projects in the context of renewable energies, which are also subject to policy risk. On realistic time scales for investment problems of this type, the resulting instances are by far too large to be solved with today's most evolved optimization software. Thus, we present a tailored moving-horizon approach together with suitable approximations and simplifications of the model. We evaluate these approximations and simplifications in a computational sensitivity analysis and derive a final model that can be tackled on a realistic instance by our moving-horizon approach. KW - Mixed-integer optimization KW - Multistage stochastic optimization KW - Portfolio optimization KW - Illiquid investments KW - Policy risk 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 - 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 - INPR A1 - Liers, Frauke A1 - Schewe, Lars A1 - Thürauf, Johannes T1 - Radius of Robust Feasibility for Mixed-Integer Problems N2 - For a mixed-integer linear problem (MIP) with uncertain constraints, the radius of robust feasibility (RRF) determines a value for the maximal “size” of the uncertainty set such that robust feasibility of the MIP can be guaranteed. The approaches for the RRF in the literature are restricted to continuous optimization problems. We first analyze relations between the RRF of a MIP and its continuous linear (LP) relaxation. In particular, we derive conditions under which a MIP and its LP relaxation have the same RRF. Afterward, we extend the notion of the RRF such that it can be applied to a large variety of optimization problems and uncertainty sets. In contrast to the setting commonly used in the literature, we consider for every constraint a potentially different uncertainty set that is not necessarily full-dimensional. Thus, we generalize the RRF to MIPs as well as to include “safe” variables and constraints, i.e., where uncertainties do not affect certain variables or constraints. In the extended setting, we again analyze relations between the RRF for a MIP and its LP relaxation. Afterward, we present methods for computing the RRF of LPs as well as of MIPs with safe variables and constraints. Finally, we show that the new methodologies can be successfully applied to the instances in the MIPLIB 2017 for computing the RRF. KW - Robust Optimization, Mixed-integer programming, Uncertainty sets, Robust feasibility Y1 - 2019 U6 - https://doi.org/10.1287/ijoc.2020.1030 PB - Informs Journal on Computing ER - TY - JOUR A1 - Gugat, Martin A1 - Schuster, Michael ED - Weber, Gerhard-Wilhelm T1 - Stationary Gas Networks with Compressor Control and Random Loads: Optimization with Probabilistic Constraints JF - Mathematical Problems in Engineering N2 - We introduce a stationary model for gas flow based on simplified isothermal Euler equations in a non-cycled pipeline network. Especially the problem of the feasibility of a random load vector is analyzed. Feasibility in this context means the existence of a flow vectormeeting these loads, which satisfies the physical conservation laws with box constraints for the pressure. An important aspect of the model is the support of compressor stations, which counteract the pressure loss caused by friction in the pipes.The network is assumed to have only one influx node; all other nodes are efflux nodes.With these assumptions the set of feasible loads can be characterized analytically. In addition we show the existence of optimal solutions for some optimization problems with probabilistic constraints. A numerical example based on real data completes this paper. KW - Validation of nominations, Stationary states, Isothermal Euler equations, Ideal Gas, Gas network, Gas transport, Compressor control, Uncertainty, Chance Constraints, Spheric-radial decomposition Y1 - 2019 U6 - https://doi.org/https://doi.org/10.1155/2018/7984079 ER - TY - JOUR A1 - Gugat, Martin A1 - Schultz, Rüdiger A1 - Schuster, Michael T1 - Convexity and Starshapedness of Feasible Sets in Stationary Flow Networks JF - Networks and Heterogeneous Media N2 - We deal with a stationary model for flow through a network. The flows are determined by the values at the boundary nodes of the network that we call the loads of the network. In the applications , the feasible loads must satisfy some box constraints. We analyze the structure of the set of feasible loads. Our analysis is motivated by gas pipeline flows, where the box constraints are pressure bounds. We present sufficient conditions to show, that the feasible set is star-shaped with respect to special points. For stronger conditions, we prove the convexity of the set of feasible loads. All the results are given for active and passive networks, i.e. networks with and without inner control. This analysis is motivated by the aim to use the spheric-radial decomposition for stochastic boundary data in this model. This paper can be used for simplifying the algorithmic use of the spheric-radial decomposition. KW - Validation of nominations, Stationary states, Isothermal Euler equations, Gas networks, Convexity, Star-Shapedness, Spheric-radial decomposition Y1 - 2020 U6 - https://doi.org/10.3934/nhm.2020008 SP - 171 EP - 195 ER - TY - INPR A1 - Kleinert, Thomas A1 - Labbé, Martine A1 - Plein, Fränk A1 - Schmidt, Martin T1 - There's No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization T2 - Operations Research N2 - One of the most frequently used approaches to solve linear bilevel optimization problems consists in replacing the lower-level problem with its Karush-Kuhn-Tucker (KKT) conditions and by reformulating the KKT complementarity conditions using techniques from mixed-integer linear optimization. The latter step requires to determine some big-M constant in order to bound the lower level's dual feasible set such that no bilevel-optimal solution is cut off. In practice, heuristics are often used to find a big-M although it is known that these approaches may fail. In this paper, we consider the hardness of two proxies for the above mentioned concept of a bilevel-correct big-M. First, we prove that verifying that a given big-M does not cut off any feasible vertex of the lower level's dual polyhedron cannot be done in polynomial time unless P=NP. Second, we show that verifying that a given big-M does not cut off any optimal point of the lower level's dual problem (for any point in the projection of the high-point relaxation onto the leader's decision space) is as hard as solving the original bilevel problem. KW - Bilevel optimization KW - Mathematical programs with complementarity constraints (MPCC) KW - Bounding polyhedra KW - Big-M KW - Hardness Y1 - 2019 IS - 68(6) SP - 1716 EP - 1721 ER - TY - JOUR A1 - Ullmann, Sebastian A1 - Müller, Christopher A1 - Lang, Jens T1 - Stochastic Galerkin Reduced Basis Methods for Parametrized Linear Convection-Diffusion-Reaction Equations N2 - We consider the estimation of parameter-dependent statistics of functional outputs of steady-state convection–diffusion–reaction equations with parametrized random and deterministic inputs in the framework of linear elliptic partial differential equations. For a given value of the deterministic parameter, a stochastic Galerkin finite element (SGFE) method can estimate the statistical moments of interest of a linear output at the cost of solving a single, large, block-structured linear system of equations. We propose a stochastic Galerkin reduced basis (SGRB) method as a means to lower the computational burden when statistical outputs are required for a large number of deterministic parameter queries. Our working assumption is that we have access to the computational resources necessary to set up such a reduced-order model for a spatial-stochastic weak formulation of the parameter-dependent model equations. In this scenario, the complexity of evaluating the SGRB model for a new value of the deterministic parameter only depends on the reduced dimension. To derive an SGRB model, we project the spatial-stochastic weak solution of a parameter-dependent SGFE model onto a reduced basis generated by a proper orthogonal decomposition (POD) of snapshots of SGFE solutions at representative values of the parameter. We propose residual-corrected estimates of the parameter-dependent expectation and variance of linear functional outputs and provide respective computable error bounds.We test the SGRB method numerically for a convection–diffusion–reaction problem, choosing the convective velocity as a deterministic parameter and the parametrized reactivity or diffusivity field as a random input. Compared to a standard reduced basis model embedded in a Monte Carlo sampling procedure, the SGRB model requires a similar number of reduced basis functions to meet a given tolerance requirement. However, only a single run of the SGRB model suffices to estimate a statistical output for a new deterministic parameter value, while the standard reduced basis model must be solved for each Monte Carlo sample. Y1 - 2018 U6 - https://doi.org/doi:10.3390/fluids6080263 VL - Fluids IS - 6 SP - 263 ER - TY - JOUR A1 - Mindt, Pascal A1 - Lang, Jens A1 - Domschke, Pia T1 - Entropy-Preserving Coupling of Hierarchical Gas Models N2 - This paper is concerned with coupling conditions at junctions for transport models which differ in their fidelity to describe transient flow in gas pipelines. It also includes the integration of compressors between two pipes with possibly different models. A hierarchy of three one-dimensional gas transport models is built through the 3 × 3 polytropic Euler equations, the 2 × 2 isentropic Euler equations and a simplified version of it for small velocities. To ensure entropy preservation, we make use of the novel entropy-preserving coupling conditions recently proposed by Lang and Mindt [Netw. Heterog. Media, 13:177-190, 2018] and require the equality of the total enthalpy at the junction and that the specific entropy for pipes with outgoing flow equals the convex combination of all entropies that belong to pipes with incoming flow. We prove the existence and uniqueness of solutions to generalised Riemann problems at a junction in the neighbourhood of constant coupling functions and stationary states which belong to the subsonic region. This provides the basis for the well-posedness of certain Cauchy problems for initial data with sufficiently small total variation. Y1 - 2018 U6 - https://doi.org/doi:10.1137/19M1240034 VL - SIAM Journal on Mathematical Analysis IS - 51 SP - 4754 EP - 4775 ER - TY - JOUR A1 - Schneider, Moritz A1 - Lang, Jens A1 - Weiner, Rüdiger T1 - Super-Convergent Implicit-Explicit Peer Methods with Variable Step Sizes N2 - Dynamical systems with sub-processes evolving on many different time scales are ubiquitous in applications. Their efficient solution is greatly enhanced by automatic time step variation. This paper is concerned with the theory, construction and application of IMEX-Peer methods that are super-convergent for variable step sizes and A-stable in the implicit part. IMEX schemes combine the necessary stability of implicit and low computational costs of explicit methods to efficiently solve systems of ordinary differential equations with both stiff and non-stiff parts included in the source term. To construct super-convergent IMEX-Peer methods which keep their higher order for variable step sizes and exhibit favourable linear stability properties, we derive necessary and sufficient conditions on the nodes and coefficient matrices and apply an extrapolation approach based on already computed stage values. New super-convergent IMEX-Peer methods of order s + 1 for s = 2, 3, 4 stages are given as result of additional order conditions which maintain the super-convergence property independent of step size changes. Numerical experiments and a comparison to other super-convergent IMEX-Peer methods show the potential of the new methods when applied with local error control. Y1 - 2019 U6 - https://doi.org/doi:10.1016/j.cam.2019.112501 VL - J. Comput. Appl. Math. IS - 387 SP - 112501 ER -