Friedrich-Alexander-Universität Erlangen-Nürnberg
Refine
Year of publication
Keywords
- Bilevel optimization (8)
- Optimal control (7)
- Gas networks (6)
- Uniqueness (6)
- Convergence (5)
- Networks (5)
- Robust optimization (5)
- robust optimization (5)
- Branch-and-cut (4)
- Mixed-Integer Nonlinear Optimization (4)
- Mixed-Integer Nonlinear Programming (4)
- Mixed-integer optimization (4)
- Mixed-integer programming (4)
- Multilevel Optimization (4)
- optimal control (4)
- A posteriori error estimates (3)
- Alternating direction methods (3)
- Gas Networks (3)
- Linear complementarity problems (3)
- Mixed-integer nonlinear optimization (3)
- Perfect competition (3)
- Pricing (3)
- Robust Optimization (3)
- Time-domain decomposition (3)
- Turnpike (3)
- Turnpike phenomenon (3)
- Adjustable Robustness (2)
- Big-M (2)
- Booking (2)
- Bookings (2)
- Combinatorial optimization (2)
- Complementarity constraints (2)
- Computational complexity (2)
- Electricity market equilibrium models (2)
- European entry-exit market (2)
- Existence (2)
- Gas Market (2)
- Gas transport networks (2)
- Global Optimization (2)
- Graph Partitioning (2)
- Lipschitz Optimization (2)
- Market Equilibria (2)
- Mixed-integer linear optimization (2)
- Multilevel optimization (2)
- Multiplicity (2)
- Network design (2)
- Nodal Control (2)
- Penalty methods (2)
- Piecewise Linearization (2)
- Potential networks (2)
- Potential-based flows (2)
- Probabilistic Constraints (2)
- Semilinear hyperbolic systems (2)
- Space- and time-domain decomposition (2)
- chance constrained programming (2)
- chance constraints (2)
- gas networks (2)
- isothermal Euler equations (2)
- linear hyperbolic systems (2)
- optimal nodal control (2)
- optimal power flow (2)
- p-Laplace problem on a graph (2)
- 1-d wave equations (1)
- 28 (1)
- AC Optimal Power Flow (1)
- Active elements (1)
- Adaptive error control (1)
- Aggregation (1)
- Applications (1)
- Averaged Control (1)
- Averaged controllability, averaged observability, observability, random heat equation (1)
- BV-coefficients (1)
- Benders Decomposition (1)
- Bilevel Optimization (1)
- Black-box Optimization (1)
- Black-box constraints (1)
- Boundary Control (1)
- Boundary feedback control, feedback stabilization, exponential stability, isothermal Euler equations, second-order quasilinear equation, Lyapunov function, stationary state, non-stationary state, gas pipeline. (1)
- Bounding polyhedra (1)
- Branch-and-bound (1)
- Chance constraints (1)
- Classical Solutions (1)
- Clique Problem (1)
- Competitive equilibrium (1)
- Complementarity Constraints (1)
- Complete description (1)
- Computational Analysis (1)
- Computational Complexity (1)
- Computational Equilibrium Models; Electricity Markets; Investment Incentives; Distribution Network Expansion Planning; Storage Investment and Operation; Renewable Energy Production; (Self-) Consumption (1)
- Computational analysis (1)
- Connectivity (1)
- Continuous Optimization (1)
- Control Constraint (1)
- Convex Envelope (1)
- Convex mixed-integer nonlinear optimization (1)
- Convexity (1)
- Cut-set inequalities (1)
- Cutting planes (1)
- Cycled Networks (1)
- DC Power Flow (1)
- Decomposition (1)
- Decomposition Method (1)
- Decomposition Methods (1)
- Demand side flexibility Load management Multi market bidding Stochastic programming Production planning Demand response (1)
- Derivative-free Optimization (1)
- Differential-algebraic equations (1)
- Direct methods (1)
- Dirichlet boundary control (1)
- Discrete Decisions (1)
- Discrete arc sizing (1)
- District heating networks (1)
- Domain decomposition (1)
- Dynamic Network Flows (1)
- Dynamic Robust Flow (1)
- Electric fuels, Hydrogen Utilization, Hydrogen Import, LOHC, Mobility (1)
- Electricity Market Design} (1)
- Electricity Markets (1)
- Electricity Markets, Network Expansion, Generation Expansion, Investment Incentives, Computational Equilibrium Models (1)
- Electricity Markets, Network Expansion, Generation Expansion, Investment Incentives, Market Design, Congestion Management, Computational Equilibrium Models (1)
- Electricity Markets, Redispatch, Congestion Management, Computational Equilibrium Models (1)
- Electricity Networks (1)
- Electricity System (1)
- Electricity market design (1)
- Electricity market modeling (1)
- Electricity tariffs (1)
- Ellipsoidal uncertainty sets (1)
- Energy Markets (1)
- Energy Networks (1)
- Energy markets (1)
- Energy storage, Consumer segmentation, Adoption decision, Innovation diffusion (1)
- Entry-Exit Gas Market (1)
- Entry-Exit System (1)
- Entry-exit system (1)
- Equilibrium Problems (1)
- Equilibrium computation (1)
- Euler and St. Venant equations (1)
- Euler equations (1)
- European Entry-Exit Gas Market (1)
- European gas market (1)
- Exact control (1)
- Exact controllability (1)
- Extended Incremental Method (1)
- First-Discretize-Then-Optimize (1)
- Flow Networks (1)
- Flow models (1)
- Fundamental Welfare Theorems (1)
- Galerkin projection (1)
- Game Theory (1)
- Game theory (1)
- Gas Dynamics (1)
- Gas Market Design (1)
- Gas Network Optimization (1)
- Gas Pipelines (1)
- Gas Transport (1)
- Gas Transport Networks (1)
- Gas markets (1)
- Gas network optimization (1)
- GasLib (1)
- Generalized Benders Decomposition (1)
- Global classical solutions Ideal gas Bi-directional flow Transsonic flow (1)
- Graph decomposition (1)
- Graph partitioning (1)
- Hardness (1)
- Heat equations with memory (1)
- Hyperbolic Balance Laws, Stabilization, Exact Controllability, Modeling of Gas Flow, Finite-Volume Schemes, Optimal control, Uncertainty (1)
- Illiquid investments (1)
- Infinite-time admissibility (1)
- Instantaneous control (1)
- Inverse parametric quadratic programming (1)
- Investment Incentives (1)
- Isothermal Euler Equations (1)
- Isothermal stationary Euler equations (1)
- Kernel Density Estimator (1)
- LQ optimal control problem (1)
- Linear Bilevel Optimization (1)
- Linear Complementarity Problems (1)
- Linear prices (1)
- Lipschitz continuity (1)
- MINLP (1)
- MPCC (1)
- MPEC (1)
- Market power (1)
- Marking strategy (1)
- Mathematical programs with complementarity constraints (MPCC) (1)
- Max-cut (1)
- Maximum flow problem (1)
- Measure Turnpike (1)
- Measure turnpike (1)
- Mixed-Integer (Non)Linear Programming (1)
- Mixed-Integer Nonlinear Optimization, Global Optimization, Lipschitz Optimization, Gas Networks (1)
- Mixed-Integer Nonlinear Optimization, Lipschitz Optimization, Inexact Function Evaluations, Decomposition Methods, Gas Networks (1)
- Mixed-Integer Optimization (1)
- Mixed-integer bilevel optimization (1)
- Mixed-integer nonlinear programming (1)
- Mixed-integer optimal control (1)
- Mixed-integer optimal control problems (1)
- Mixing (1)
- Model hierarchy (1)
- Multi-leader multi-follower game (1)
- Multilevel Modeling (1)
- Multilevel programming (1)
- Multiple-Choice Constraints (1)
- Multistage stochastic optimization (1)
- NP-Hardness (1)
- Nash Games (1)
- Nash-Cournot competition (1)
- Nash-Cournot equilibria (1)
- Natural Gas Markets (1)
- Natural Gas System (1)
- Neighboring Markets (1)
- Network Expansion (1)
- Network expansion (1)
- Network flow problems (1)
- Network reduction (1)
- Neumann boundary control (1)
- Neural ODEs (1)
- Nodal Stabilization (1)
- Nomination (1)
- Nonconvex Equilibrium Models (1)
- Nonconvex games (1)
- Nonlinear optimization (1)
- OR in energy (1)
- Optimal Transport (1)
- Optimal control, Gas networks, Euler's equation, Semilinear PDE, Nonoverlapping domain decomposition (1)
- Optimal shape design (1)
- Optimal value function (1)
- Optimality system (1)
- Optimization (1)
- Optimization under uncertainty (1)
- Optimization with Differential Equations (1)
- Optimization with differential equations (1)
- Outer Approximation (1)
- Outer approximation (1)
- PDE constrained optimization (1)
- PDE constrained optimization, probabilistic constraints, uncertain initial data (1)
- PDEs on graphs (1)
- Parabolic equation (1)
- Parametric optimization (1)
- Partial differential equations on graphs (1)
- Peak-Load Pricing (1)
- Peak-load pricing (1)
- Penalty method (1)
- Perfect Competition (1)
- Piecewise Linear Relaxation (1)
- Piecewise linear functions (1)
- Pilot projects, Organizational setup, Adoption decision, Quadruple Helix, Innovation diffusion (1)
- Policy risk (1)
- Polyhedral demand uncertainty (1)
- Portfolio optimization (1)
- Potential-Based Flows (1)
- Potential-based flows, Gas networks, Computational complexity, European entry-exit market, Bookings (1)
- Power-to-Gas (1)
- Presolve (1)
- Price Zones (1)
- Primal Heuristic (1)
- Probabilistic Robustness (1)
- Problem Instances (1)
- Quadratic programming (1)
- R-vine copula (1)
- Random Boundary Data (1)
- Reformulations (1)
- Regional Pricing (1)
- Renewables (1)
- Riccati equations (1)
- Risk Aversion (1)
- Robust Optimization, Mixed-integer programming, Uncertainty sets, Robust feasibility (1)
- Robust market equilibria (1)
- Robust network design (1)
- SOS-1 (1)
- Scenario generation (1)
- Scheduling (1)
- Second-Order Cone Programming (1)
- Sector Coupling (1)
- Sector Coupling, Eletricity Markets, Electric fuels, Hydrogen Utilization, LOHC, Mobility (1)
- Semidefinite Programming (1)
- Separation under uncertainty (1)
- Series-parallel graphs (1)
- Short- and Long-Run Market Equilibrium (1)
- Simulation Based Optimization (1)
- Simultaneous Convexification (1)
- Spheric Radial Decomposition (1)
- State constraint (1)
- Stationary points (1)
- Stochastic Programming (1)
- Storage Capacity Maximization (1)
- Strict dissipativity (1)
- Supply chain (1)
- Tariff design (1)
- Technical Capacities (1)
- Total Unimodularity (1)
- Total unimodularity (1)
- Tractable counterparts (1)
- Traffic equilibrium problems (1)
- Traffic flow (1)
- Transient Gas Transport Optimization (1)
- Transmission and generation investment (1)
- Transmission management (1)
- Transport Costs (1)
- Transport Equation (1)
- Trees (1)
- Uncertain Travel Times (1)
- Unit Commitment with AC Power Flow (1)
- Valid inequalities (1)
- Validation of nominations, Stationary states, Isothermal Euler equations, Gas networks, Convexity, Star-Shapedness, Spheric-radial decomposition (1)
- Validation of nominations, Stationary states, Isothermal Euler equations, Ideal Gas, Gas network, Gas transport, Compressor control, Uncertainty, Chance Constraints, Spheric-radial decomposition (1)
- ammonia trade (1)
- boundary control (1)
- case study Australia to Germany (1)
- chance constraint (1)
- conditional uncertainty set (1)
- conservation laws on network (1)
- coupling conditions (1)
- data classification (1)
- decision trees (1)
- decision-dependent uncertainty (1)
- decomposition of the flow (1)
- deep learning (1)
- delay (1)
- descriptor systems (1)
- distributed parameter system (1)
- distributionally robust optimization (1)
- dynamic control (1)
- energy decay (1)
- exact control (1)
- exponential stability (1)
- finite time blow-up (1)
- gas network (1)
- gas pipeline flow (1)
- gradient descent (1)
- green ammonia (1)
- here-and-now decision (1)
- hierarchy of models (1)
- hybrid parabolic-hyperbolic behavior (1)
- hyperbolic differential equation (1)
- hyperbolic system (1)
- instantaneous control (1)
- learning over time (1)
- linear systems (1)
- long time behavior (1)
- machine learning (1)
- mixed-integer programming (1)
- multilevel (1)
- network (1)
- network modelling (1)
- networks (1)
- nodal control (1)
- nodal profile con-trol (1)
- nonlinear stochastic optimization (1)
- nonlocal conservation laws (1)
- nonoverlapping omain decomposition, optimal control of semi-linear ellioptic systems on netowrks (1)
- optimization model (1)
- p-parabolic problems (1)
- p-system (1)
- partial differential-algebraic equations (1)
- pipes (1)
- polynomial optimization (1)
- port-Hamiltonian systems (1)
- power networks (1)
- quasilinear hyperbolic problem (1)
- random demand (1)
- random forests (1)
- real gas (1)
- relaxations (1)
- renewable energy auction, combinatorial auction, market design (1)
- shape optimization (1)
- simultaneous control (1)
- spheric-radial decomposition (1)
- spherical radial decomposition (1)
- state constraints (1)
- stationary gas transport (1)
- stochastic gradient method (1)
- systems of hyperbolic pdes (1)
- topological derivative (1)
- traveling waves (1)
- turnpike property (1)
- wave equation (1)
- Γ-robustness (1)
An Observer for pipeline flow with hydrogen blending in gas networks: exponential synchronization
(2024)
We consider a state estimation problem for gas flows in pipeline networks where hydrogen is blended into the natural gas. The flow is modeled by the quasi-linear isothermal Euler equations coupled to an advection equation on a graph. The flow through the vertices where the pipes are connected is governed by algebraic node conditions. The state is approximated by an observer system that uses nodal measurements. We prove that the state of the observer system converges to the original system state exponentially fast in the L2-norm if the measurements are exact. If measurement errors are present we show that the observer state approximates the original system state up to an error that is proportional to the maximal measurement error. The proof of the synchronization result uses Lyapunov functions with exponential weights.
We propose a framework that allows to quantitatively analyze the interplay of the different agents involved in gas trade and transport in the context of the European entry-exit system. While previous contributions focus on the case of perfectly competitive buyers and sellers of gas, our novel framework considers the mathematically more challenging case of a strategic and monopolistic gas seller. We present a multilevel framework that is suitable to capture the sequential nature of the decisions taken. We then derive sufficient conditions that allow for reformulating the challenging four-level model as a computationally tractable single-level reformulation. We prove the correctness of this reformulation and use it for solving several test instances to illustrate the applicability of our approach.
The dynamical, boundary optimal control problems
on networks are considered. The domain of definition for the distributed parameter system is given by a graph G. The optimal cost function for control problem is further optimized with respect to the shape and topology of the graph Ω. The small cycle is introduced and the topological derivative of the cost with respect to the size of the cycle is determined. In this way, the singular perturbations of the graph can be analyzed in order to change the topology Ω. The topological derivative method in shape and topology optimization is a new tool which can be used to minimize the shape functionals under the Partial Differential
Equations (PDEs) constraints. The topological derivative is used as well for solution of optimum design problems for graphs. In optimal control problems the topological derivative is used for
optimum design of the domain of integration of the state equation. As an example, optimal control problems are considered on a cross with a small cycle. The state equation is the wave equation
on the graph. The boundary control problem by Neumann
conditions at a boundary vertex is solved for a tracking cost function. The shape functional is given by the optimal value of the control cost. The topological derivative of the shape functional is determined for the steady state model with the size of a cycle ε → 0. Numerical results for a model problem are presented.
Optimal control problems usually involve constraints which model physical states and their possible transitions. These are represented by ordinary or partial differential equations (ODEs/PDEs) which add a component of infinite dimension to the problem. In recent literature, one method to simulate such ODEs/PDEs are physics-informed neural networks. Typically, neural networks are highly non-linear which makes their addition to optimization problems challenging. Hence, we leverage their often available Lipschitz property on a compact domain. The respective Lipschitz constants have to be computed only once and are accessible thereafter.
We present a method that, based on this property, iteratively adds cuts involving the violation of the constraints by the current incumbent and the Lipschitz constant. Hereby, the “shape” of a cut depends on the norm used. We prove the correctness of the method by showing that it either returns an optimal solution when terminating or creates a sequence with optimal accumulation points. This is complemented by a discussion about the termination in the infeasible case, as well as an analysis of the problem complexity. For the analysis, we show that the lower and upper iteration bound asymptotically coincide when the relative approximation error goes to zero. In the end, we visualize the method on a small example based on a two-dimensional non-convex optimization problem, as well as stress the necessity of having a globally optimal oracle for the sub-problems by another example.
In the transition to renewable energy sources, hydrogen will potentially play an important role for energy storage. The efficient transport of this gas is possible via pipelines. An understanding of the possibilities to control the gas flow in pipelines is one of the main building blocks towards the optimal use of gas.
For the operation of gas transport networks it is important to take into account the randomness of the consumers’ demand, where often information on the probability distribution is available.
Hence in an efficient optimal control model the corresponding probability should be included and the optimal control should be such that the state that is generated by the optimal control satisfies given state constraints with large probability. We comment on the modelling of gas pipeline flow and the problems of optimal nodal control with random demand, where the aim of the optimization is to determine controls that generate states that satisfy given pressure bounds with large probability. We include the H2 norm of the control as control cost, since this avoids large pressure fluctuations which are harmful in the transport of hydrogen since they can cause
embrittlement of the pipeline metal.
We analyse the turnpike properties for a general, infinite dimensional, linear-quadratic (LQ) optimal control problem, both in the deterministic and in the stochastic case.
The novelty of the paper is twofold. Firstly, it obtains positive turnpike results for
systems that are (partially) uncontrollable. Secondly, it provides turnpike results for averaged control associated to a family of problems that depend on a random parameter, which is the first turnpike type result in the averaged controllability framework.
In this paper we analyze the turnpike phenomenon for optimal boundary control problems with a linear transport equation with source term. The convex objective function depends on
the boundary traces of the transport equation and is strictly convex with respect to the boundary control. We show an integral turnpike result for an optimal Dirichlet boundary control problem in the sense that if the time horizon goes to infinity, then the dynamic optimal control converges to
the corresponding steady state optimal control.
The novelty of this work is two-sided. On the one hand, even if turnpike results for this kind of optimal boundary control problem already exist, we present a new direct proof without using adjoint calculus that leads to sharper estimates. On the other hand we consider uncertainty in
the initial data and/or in the source term. We show that the integral turnpike result also holds considering uncertainty. Throughout the paper we use numerical examples to illustrate the results.
We consider a state estimation problem for gas pipeline flow modeled by the one-dimensional barotropic Euler equations. In order to reconstruct the system state, we construct an observer system of Luenberger type based on distributed measurements of one state variable. First, we show the existence of Lipschitz-continuous semi-global solutions of the observer system and of the original system for initial and boundary data satisfying smallness and compatibility conditions for a single pipe and for general networks. Second, based on an extension of the relative energy method we prove that the state of the observer system converges exponentially in the long time limit towards the original system state. We show this for a single pipe and for star-shaped networks.
The economics of global green ammonia trade – "Shipping Australian wind and sunshine to Germany"
(2023)
This paper contributes to understanding the transformation of global energy trade to green energy carriers, focusing on green ammonia as the foreseeable first green hydrogen carrier. We provide a comprehensive overview of today's ammonia trade and assess scaling options for the trade of green ammonia. To that aim, we develop an optimization model for the integrated assessment of the green ammonia value chain that covers all steps from green ammonia production in an exporting country, up to delivery to a harbor in an importing country. The model endogenously chooses among different technology options and determines cost minimal operation. In a case study, we apply the model to the large-scale import of ammonia from Australia to Germany in a scenario for 2030. The results show that green ammonia can reach cost parity with gray ammonia even for moderate gas prices (but not necessarily with blue ammonia) if CO2 prices are high enough. We also provide a sensitivity analysis with respect to the interest rate and other key technical and economic parameters and show that cracking ammonia to provide pure hydrogen comes at a 45 % cost markup per MWh at the destination.
We consider dynamic gas transport optimization problems, which lead to large-scale and nonconvex mixed-integer nonlinear optimization problems (MINLPs) on graphs. Usually, the resulting instances are too challenging to be solved by state-of-the-art MINLP solvers. In this paper, we use graph decompositions to obtain multiple optimization problems on smaller blocks, which can be solved in parallel and which may result in simpler classes of optimization problems since not every block necessarily contains mixed-integer or nonlinear aspects. For achieving feasibility at the interfaces of the several blocks, we employ a tailored consensus-based penalty alternating direction method. Our numerical results show that such decomposition techniques can outperform the baseline approach of just solving the overall MINLP from scratch. However, a complete answer to the question of how to decompose MINLPs on graphs in dependence of the given model is still an open topic for future research.