arXiv subjects

Saif R. Kazi

Publications and source records attributed to Saif R. Kazi.

16 recordsLinked to original sources

arXiv2026

Controller- and Communication-Aware Flexibility Margins for Electric Distribution Networks

This paper develops a framework for quantifying operational flexibility in radial electric distribution systems under coupled active- and reactive-load uncertainty. Flexibility is defined as the largest scaling of a prescribed uncertainty set that can be accommodated while satisfying network and actuator limits under a given control architecture. We consider a one-sided Euclidean set for robust demand-growth capability, with a direct extension to bidirectional variations. Under LinDistFlow, controllable distributed resources and feeder-head exchange with the upstream grid jointly balance active-power disturbances, while local Volt/VAR feedback regulates reactive power. The resulting affine closed-loop disturbance response admits exact second-order-cone robust counterparts. For fixed Volt/VAR gains, a convex reformulation jointly optimizes the flexibility margin and active-power participation factors, including feeder-head participation. A sparse load-to-generator feedforward map further captures communication constraints. Numerical studies on the Iowa-240 feeder demonstrate how the amount of control authority and communication structure shape the achievable flexibility margin.

eess.SY↗

arXiv2026

A Bilevel Market Equilibrium Model for Natural Gas Pipeline Network Operations: Convex Relaxations and Single-level Reformulations

We propose an integrated market equilibrium model for determining the spot market prices and flow rates in a natural gas pipeline network. The traditional approach solves the market equilibrium model separately from the natural gas network flow allocation problem in a sequential manner. Our proposed framework synthesizes marketing and operations by using a bilevel optimization formulation where the market equilibrium model in the upper level is connected and simultaneously solved with the natural gas network flow model in the lower level. We introduce convex relaxations for the nonconvex Weymouth pipe pressure drop equation and a surrogate for the compressor operating cost. Furthermore, we compare multiple single level reformulations of the bilevel problem based on Karush-Kuhn-Tucker (KKT) optimality conditions, Wolfe duality, and Lagrange duality conditions. Numerical studies on a small 6-node network demonstrates the efficacy and accuracy of our model and the comparison between different duality and optimality based reformulations.

math.OC↗

arXiv2026

Optimal Control of Dynamic Gas Networks Using Gaussian Processes with Chance-Constraint Reformulation

Natural gas networks must accommodate variable demand and supply while maintaining pressure across pipelines whose stored gas couples operating decisions through time. Probabilistic surrogates can simplify compressor scheduling, but their predictive uncertainty must remain reliable where optimization uses it. We combine direct learning of the minimum pressure margin with assessment at optimizer-selected schedules. Using a warped Gaussian process, we express the posterior pressure requirement as one inequality in its predictive mean and standard deviation. We then parameterize block and Fourier schedules so scalar predictions and analytic derivatives replace trajectory states and time integration in whole-day optimization. In steady state, a surrogate that passes held-out accuracy and coverage checks nevertheless falls below the minimum pressure on 71% of its own dispatches at a nominal 1% tolerance, as the optimizer is drawn to schedules where the margin is overestimated. This diagnostic motivates an enrichment loop that audits selected dispatches against the physics and updates the surrogate by exact conditioning, with fitted quantities held fixed. The loop restores steady-state minimum-pressure risk control at every studied tolerance, with conditioning about four orders of magnitude faster than refitting. In transient operation, we complement this enrichment with empirical threshold calibration to address residual hourly optimism, bringing hourly violation rates closer to their declared tolerances with little compressor work overhead.

math.OC↗

arXiv2026

E-Globe: Scalable $ε$-Global Verification of Neural Networks via Tight Upper Bounds and Pattern-Aware Branching

Neural networks achieve strong empirical performance, but robustness concerns still hinder deployment in safety-critical applications. Formal verification provides robustness guarantees, but current methods face a scalability-completeness trade-off. We propose a hybrid verifier in a branch-and-bound (BaB) framework that efficiently tightens both upper and lower bounds until an $ε-$global optimum is reached or early stop is triggered. The key is an exact nonlinear program with complementarity constraints (NLP-CC) for upper bounding that preserves the ReLU input-output graph, so any feasible solution yields a valid counterexample and enables rapid pruning of unsafe subproblems. We further accelerate verification with (i) warm-started NLP solves requiring minimal constraint-matrix updates and (ii) pattern-aligned strong branching that prioritizes splits most effective at tightening relaxations. We also provide conditions under which NLP-CC upper bounds are tight. Experiments on MNIST and CIFAR-10 show markedly tighter upper bounds than PGD across perturbation radii spanning up to three orders of magnitude, fast per-node solves in practice, and substantial end-to-end speedups over MIP-based verification, amplified by warm-starting, GPU batching, and pattern-aligned branching.

cs.LG↗

arXiv2026

Real-Time Dynamic N-1 Screening: Identifying High-Risk Lines and Transformers After Common Faults

Power system operators routinely perform N-1 contingency analysis, yet conventional tools provide limited guidance on which lines or transformers deserve heightened attention during fast post-fault transients. In particular, static screening does not reveal whether (1) the same faulted line repeatedly triggers severe downstream overloads, or (2) a specific transformer emerges as vulnerable across many distinct fault scenarios. This paper introduces a real-time dynamic N-1 screening framework that addresses this gap by estimating, for each counterfactual single-phase transmission fault, the probability of transient overcurrent on critical grid elements. The output is an operator-facing dashboard that ranks (a) faulted lines whose outages most frequently lead to dangerous transformer overloads, and (b) transformers that consistently overload across top-risk scenarios, both of which are actionable indicators for real-time situational awareness. The approach models post-fault electromechanical dynamics using a linear stochastic formulation of the swing equations with short-lived, fault-localized uncertainty, and combines analytic transient evaluation with cross-entropy based importance sampling to efficiently estimate rare but high-impact events. All N-1 contingencies are evaluated in parallel with linear computational complexity. The framework is demonstrated on the IEEE 118-bus system, where it reveals latent high-risk lines and transformers that remain invisible under deterministic dynamic or static N-1 analysis. Results show orders-of-magnitude computational speedup relative to brute-force Monte Carlo, enabling practical deployment within real-time operational cycles.

math.OC↗

arXiv2025

Real-Time Stochastic Assessment of Dynamic N-1 Grid Contingencies

Power system operators need tools for rapid, real-time counterfactual assessments of grid security under fast-changing conditions. Traditional N-1 contingency analysis lacks dynamic evaluation, especially of frequency swings from common faults. This paper introduces a real-time dashboard framework to screen dynamic contingencies. It assumes: (a) the grid starts in a balanced state; (b) faults can occur randomly on any transmission line, temporarily de-energizing and then reconnecting it within about one second; and (c) contingencies are flagged if post-fault transients cause line flows to exceed safety thresholds. The key contributions are: (1) Overload Indicator: a system-wide metric quantifying integrated N-1 dynamic risk from a given state; (2) Scalable Fault Evaluation Algorithm: a linear-scaling method to assess dynamic fault impacts without brute-force simulations; and (3) Risk Estimation: a Cross Entropy Adaptive Importance Sampling method estimating the likelihood of low probability by high risk events, e.g. associated with potential transformer over-current. We demonstrate the framework on the Israeli transmission power grid (IG).

math.DS↗

arXiv2025

Optimal Trajectory Planning for Space Object Tracking with Collision-Avoidance Constraints

A control optimization approach is presented for a chaser spacecraft tasked with maintaining proximity to a target space object while avoiding collisions. The target object trajectory is provided numerically to account for both passive debris and actively maneuvering spacecraft. Thrusting actions for the chaser object are modeled as discrete (on/off) variables to optimize resources (e.g., fuel) while satisfying spatial, dynamical, and collision-avoidance constraints. The nonlinear equation of motion is discretized directly using a fourth-order Runge-Kutta method without the need for linearized dynamics. The resulting mixed-integer nonlinear programming (MINLP) formulation is further enhanced with scaling techniques, valid constraints based on a perspective convex reformulation, and a combination of continuous relaxations of discrete actions with rounding heuristics to recover high-quality feasible solutions. This methodology enables efficient, collision-free trajectory planning over extended time horizons while reducing computational overhead. The effectiveness and practicality of the proposed approach is validated through a numerical case study.

math.OC↗

arXiv2025

LEVIS: Large Exact Verifiable Input Spaces for Neural Networks

The robustness of neural networks is crucial in safety-critical applications, where identifying a reliable input space is essential for effective model selection, robustness evaluation, and the development of reliable control strategies. Most existing robustness verification methods assess the worst-case output under the assumption that the input space is known. However, precisely identifying a verifiable input space $\mathcal{C}$, where no adversarial examples exist, is challenging due to the possible high dimensionality, discontinuity, and non-convex nature of the input space. To address this challenge, we propose a novel framework, **LEVIS**, consisting of **LEVIS-α** and **LEVIS-\b{eta}**. **LEVIS-α** identifies a single, large verifiable ball that intersects at least two boundaries of a bounded region $\mathcal{C}$, while **LEVIS-\b{eta}** systematically captures the entirety of the verifiable space by integrating multiple verifiable balls. Our contributions include: (1) introducing a verification framework that uses mixed-integer programming (MIP) to compute nearest and directional adversarial points, (2) integrating complementarity-constrained (CC) optimization with a reduced MIP formulation for scalability, achieving up to a 6 times runtime reduction, (3) theoretically characterizing the properties of the verifiable balls obtained by **LEVIS-α**, and (4) validating the approach across applications including electrical power flow regression and image classification, with demonstrated performance gains and geometric insights into the verifiable region.

cs.LG↗

arXiv2025

On Optimal Control of Hybrid Dynamical Systems using Complementarity Constraints

Optimal control for switch-based dynamical systems is a challenging problem in the process control literature. In this study, we model these systems as hybrid dynamical systems with finite number of unknown switching points and reformulate them using non-smooth and non-convex complementarity constraints as a mathematical program with complementarity constraints (MPCC). We utilize a moving finite element based strategy to discretize the differential equation system to accurately locate the unknown switching points at the finite element boundary and achieve high-order accuracy at intermediate non-collocation points. We propose a globalization approach to solve the discretized MPCC problem using a mixed NLP/MILP-based strategy to converge to a non-spurious first-order optimal solution. The method is tested on three dynamic optimization examples, including a gas-liquid tank model and an optimal control problem with a sliding mode solution.

math.OC↗

arXiv2024

Locational Marginal Pricing of Energy in Pipeline Transport of Natural Gas and Hydrogen with Carbon Offset Incentives

We propose an optimization formulation for locational pricing of energy transported through a pipeline network that carries mixtures of natural gas and hydrogen from distributed sources to consumers. The objective includes the economic value provided by the pipeline to consumers of energy and suppliers of natural gas and green hydrogen, as well as incentives to lower carbon emissions by consuming the latter instead of the former. The optimization is subject to the physics of gas flow and mixing in the pipeline network as well as engineering limits. In addition to formulating this mathematical program, we synthesize the Lagrangian and derive analytical expressions for the dual variables. We propose that the dual solution can be used to derive locational marginal prices of natural gas, hydrogen, and energy, as well as the decarbonization premium paid by consumers that receive hydrogen. We derive several properties of solutions obtained using the proposed market mechanism, and demonstrate them using case studies for standard 8-node and 40-node pipeline test networks. Finally, we show that optimization-based analysis of the type proposed here is critical for making sound decisions about economic policy and infrastructure expansion for blending green hydrogen into existing natural gas pipelines.

math.OC↗

arXiv2024

Stochastic Finite Volume Method for Uncertainty Management in Gas Pipeline Network Flows

Natural gas consumption by users of pipeline networks is subject to increasing uncertainty that originates from the intermittent nature of electric power loads serviced by gas-fired generators. To enable computationally efficient optimization of gas network flows subject to uncertainty, we develop a finite volume representation of stochastic solutions of hyperbolic partial differential equation (PDE) systems on graph-connected domains with nodal coupling and boundary conditions. The representation is used to express the physical constraints in stochastic optimization problems for gas flow allocation subject to uncertain parameters. The method is based on the stochastic finite volume approach that was recently developed for uncertainty quantification in transient flows represented by hyperbolic PDEs on graphs. In this study, we develop optimization formulations for steady-state gas flow over actuated transport networks subject to probabilistic constraints. In addition to the distributions for the physical solutions, we examine the dual variables that are produced by way of the optimization, and interpret them as price distributions that quantify the financial volatility that arises through demand uncertainty modeled in an optimization-driven gas market mechanism. We demonstrate the computation and distributional analysis using a single-pipe example and a small test network.

math.OC↗

arXiv2024

Dynamic Optimization and Optimal Control of Hydrogen Blending Operations in Natural Gas Networks

We present a dynamic model for the optimal control problem (OCP) of hydrogen blending into natural gas pipeline networks subject to inequality constraints. The dynamic model is derived using the first principles partial differential equations (PDEs) for the transport of heterogeneous gas mixtures through long distance pipes. Hydrogen concentration is tracked together with the pressure and mass flow dynamics within the pipelines, as well as mixing and compatibility conditions at nodes, actuation by compressors, and injection of hydrogen or natural gas into the system or withdrawal of the mixture from the network. We implement a lumped parameter approximation to reduce the full PDE model to a differential algebraic equation (DAE) system that can be easily discretized and solved using nonlinear optimization or programming (NLP) solvers. We examine a temporal discretization that is advantageous for time-periodic boundary conditions, parameters, and inequality constraint bound values. The method is applied to solve case studies for a single pipe and a multi-pipe network with time-varying parameters in order to explore how mixing of heterogeneous gases affects pipeline transient optimization.

math.OC↗

arXiv2023

Transitions from Monotonicity to Chaos in Gas Mixture Dynamics in Pipeline Networks

The blending of hydrogen generated using clean energy into natural gas pipeline networks is proposed in order to utilize existing energy systems for their planned lifetimes while reducing their reliance on fossil fuels. We formulate a system of partial differential equations (PDEs) that govern the flow dynamics of mixtures of gases in pipeline networks under the influence of time-varying compressor and regulator control actions. The formulation is derived for general gas networks that can inject or withdraw arbitrary time-varying mixtures of gases into or from the network at arbitrarily specified nodes. The PDE formulation is discretized in space to form a nonlinear control system that is used to prove that homogeneous mixtures are well-behaved and heterogeneous mixtures may be ill-behaved in the sense of monotone-ordering of solutions. We use numerical simulations to compute interfaces in the parameter region of sinusoidal boundary conditions that delimit monotonic, periodic, and chaotic system responses. The interfaces suggest that any solution in the monotonic response region is not chaotic and will eventually approach a periodic orbit. The results are demonstrated using examples for a single pipeline and a small test network.

math.DS↗

arXiv2023

Optimal Control of Transient Flows in Pipeline Networks with Heterogeneous Mixtures of Hydrogen and Natural Gas

We formulate a control system model for the distributed flow of mixtures of highly heterogeneous gases through large-scale pipeline networks with time-varying injections of constituents, withdrawals, and control actions of compressors. This study is motivated by the proposed blending of clean hydrogen into natural gas pipelines as an interim means to reducing end use carbon emissions while utilizing existing infrastructure for its planned lifetime. We reformulate the partial differential equations for gas dynamics on pipelines and balance conditions at junctions using lumped elements to a sparse nonlinear differential algebraic equation system. Our key advance is modeling the mixing of constituents in time throughout the network, which requires doubling the state space needed for a single gas and increases numerical ill-conditioning. The reduced model is shown to be a consistent approximation of the original system, which we use as the dynamic constraints in a model-predictive optimal control problem for minimizing the energy expended by applying time-varying compressor operating profiles to guarantee time-varying delivery profiles subject to system pressure limits. The optimal control problem is implemented after time discretization using a nonlinear program, with validation of the results done using a transient simulation. We demonstrate the methodology for a small test network, and discuss scalability and potential applications.

math.OC↗

arXiv2023

Optimization of Hydrogen Blending in Natural Gas Networks for Carbon Emissions Reduction

We present an economic optimization problem for allocating the flow of natural gas and hydrogen blends through a large-scale transportation pipeline network. Physical flow of the gas mixture is modeled using a steady-state relation between pressure decrease and flow rate, which depends on mass concentration of the constituents as it varies by location in the network. The objective reflects the economic value provided by the system, accounting for delivered energy in withdrawn flows, the cost of natural gas and hydrogen injections, and avoided carbon emissions. The problem is solved subject to physical flow equations, nodal balance and mixing laws, and engineering inequality constraints. The desired energy delivery rate and minimum hydrogen concentration can be specified as upper and lower bound values, respectively, of inequality constraints, and we examine the sensitivity of the physical pressure and flow solution to these parameters for two test networks. The results confirm that increasing hydrogen concentration requires greater energy expended for compression to deliver the same energy content, and the formulation could be used for valuation of the resulting mitigation of carbon emissions.

math.OC↗

arXiv2022

Modeling and Optimization of Steady Flow of Natural Gas and Hydrogen Mixtures in Pipeline Networks

We extend the canonical problems of simulation and optimization of steady-state gas flows in pipeline networks with compressors to the transport of mixtures of highly heterogeneous gases injected throughout a network. Our study is motivated by proposed projects to blend hydrogen generated using clean energy into existing natural gas pipeline systems as part of efforts to reduce the reliance of energy systems on fossil fuels. Flow in a pipe is related to endpoint pressures by a basic Weymouth equation model, with an ideal gas equation of state, where the wave speed depends on the hydrogen concentration. At vertices, in addition to mass balance, we also consider mixing of incoming flows of varying hydrogen concentrations. The problems of interest are the heterogeneous gas flow simulation (HGFS), which determines system pressures and flows given fixed boundary conditions and compressor settings, as well as the heterogeneous gas flow optimization (HGFO), which extremizes an objective by determining optimal boundary conditions and compressor settings. We examine conditions for uniqueness of solutions to the HGFS, as well as compare and contrast mixed-integer and continuous nonlinear programming formulations for the HGFO. We develop computational methods to solve both problems, and examine their performance using four test networks of increasing complexity.

math.OC↗