Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “nonlinear constraints”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Riemannian Optimization Applied to AC Optimal Power Flow: Preprint

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.

manifold optimization↗
DOE OSTI2026

Optimization and stabilization of Fermilab Booster using hybrid Bayesian/RL framework

PIPII project will raise Fermilab Booster intensity and ramp rate. Beam losses will limit average power and are hard to simulate. Presently, Booster uses operator-guided empirical tuning. This task is challenging due to high dimensionality, multiple objectives, critical safety constraints, and drifts. We developed a synergistic suite of Bayesian optimization (BO) and reinforcement learning (RL) tools to optimize and stabilize beam losses. First, active learning was used to build a rough model. Data was collected parasitically using two novel safety constraint types – nonlinear input space restrictions (based on optics model), and uncertainty constraints (to stop bad steps/beam aborts). We then applied online multi-objective BO with scalarized objectives and fitting to improve/rebalance losses, increasing safety margins by 25%. Using BO model as a safety veto, we tried several on/off-policy RL agents for long term stabilization; SAC had best performance. We found that adding contextual (state) information further improved performance, eventually integrating key knobs like linac phase and temperature into the parameter space. Long term testing is ongoing to enable operational use.

Kuklev, Nikita [Fermilab]↗
DOE OSTI2026

Nonlinear causality of Israel-Stewart theory with diffusion

We present the first fully nonlinear causality constraints in D = 3 + 1 dimensions for Israel-Stewart theory in the presence of energy and number diffusion in the Eckart and Landau hydrodynamic frames, respectively. These constraints are algebraic inequalities that make no assumption on the underlying geometry of the spacetime or the equation of state. In order to highlight the distinct physical and structural behavior of the two hydrodynamic frames, we discuss the special ultrarelativistic ideal gas equation of state considered in earlier literature in D = 1 + 1 dimensions, and show that our general D = 3 + 1 constraints reduce to their results upon an appropriate choice of angles. For this equation of state in both D = 1 + 1 and D = 3 + 1 dimensions one can show that: (i) there exists a region allowed by nonlinear causality in which the baryon current transitions into a spacelike vector in the Landau frame, and (ii) an analogous argument shows that the solutions of the Eckart frame equations of motion never violate the dominant energy condition, assuming nonlinear causality holds. Furthermore, we then compare our results with those from linearized Israel-Stewart theory and show that the linear causality bounds fail to capture the new physical constraints on energy and number diffusion that are successfully obtained through our nonlinear causality approach.

Quark-gluon plasma↗
DOE OSTI2026

Relaxations of the steady optimal gas flow problem for a non-Ideal gas

Natural gas ranks second in U.S. primary energy consumption. Because most production sites are remote, gas must be transported through pipeline networks equipped with compressors, valves, and other components. For both economic efficiency and system reliability, it is desirable to operate these networks optimally. The governing physics across pipeline components entails nonlinear, non-convex equality and inequality constraints, and the most general steady-flow operations problem is a Mixed-Integer Nonlinear Program (MINLP).This work focuses on one such steady-flow problem-the Optimal Gas Flow (OGF) for a natural gas pipeline network-which minimizes production cost subject to the steady-flow physics. For day-to-day operations, the ability to quickly compute a globally optimal solution and a strong lower bound for varying demand profiles is crucial. A promising strategy is to build tight relaxations of the OGF’s nonlinear constraints. However, many nonlinearities arising from non-ideal equations of state either lack relaxations or have relaxations that do not scale to realistic network sizes. We address this gap by combining recent advances in polyhedral relaxations for univariate functions to construct tight, computationally efficient relaxations of the OGF with a non-ideal equation of state. These relaxations solve within seconds on a standard laptop. In conclusion, we demonstrate their quality through extensive numerical experiments on very large-scale test networks from the literature and find that the proposed approach proves optimality in 92% of tested instances.

03 NATURAL GAS↗
DOE OSTI2026

Stochastic Microgrid Scheduling With Chance‐Constrained Resilience Consideration

Traditionally, it is assumed that microgrids transition seamlessly from grid‐connected operation to islanded mode in the event of sudden main grid outages. In reality, the islanding process, especially unintentional islanding, is rarely seamless. Instead, it is subject to voltage and frequency fluctuations caused by the instantaneous disconnection of the point of common coupling (PCC) switch, variations in loads and renewable generation output and even the protection tripping of distributed energy resources (DERs). To mitigate these fluctuations and facilitate a smooth islanding process, we propose a stochastic microgrid scheduling model that incorporates chance‐constrained resilience measures. Specifically, the resilience measure is defined as the probability of successful islanding (PSI), that is, the probability that a microgrid can mitigate the generation‐demand imbalance caused by the disconnection of the PCC switch, variations in load and renewable generation and DER tripping. This measure is modelled using chance constraints. Unlike existing reliability and resilience indices, which typically neglect the possibility of microgrid/DER failure under extreme events and assume their survival while primarily focussing on reducing impact duration or magnitude, the proposed PSI‐based framework explicitly addresses microgrid and DER survival during the islanding transition. The formulated nonlinear chance constraints are approximated using a multiinterval approach and equivalently represented as a mixed‐integer linear programming (MILP) formulation. Case study results validate the proposed method, showing that the PSI estimation error is reduced to less than 8%, compared to approximately 28% with existing methods. Various sensitivity analyses on the DER tripping rate and PSI settings were performed to validate the robustness of the proposed method. In particular, the necessity of accounting for DER tripping in the PSI calculation was demonstrated.

chance constrained optimization↗
DOE OSTI2024

Riemannian Optimization Applied to AC Optimal Power Flow

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. This is done by using the Julia programming language and the Julia packages PowerModels.jl and Manopt.jl.

AC optimal power flow↗
DOE OSTI2023

Vibro-impact analysis and characterization of pipeline conveying fluids with multi-segmented motion-limiting constraints

Previous studies of the cantilevered pipeline conveying fluid system have included motion-limiting constraints in the form of trilinear springs. While this is desirable in experimental scenarios, it may not be representative of real-world applications. Therefore, here, this study focuses on multi-segmented motion-limiting constraints. As this type of motion-limiting constraint has not been investigated with a cantilevered pipeline system, a wide variety of outer and inner constraint stiffness and constraint gap sizes are investigated in this study to gain a comprehensive understanding of how the multi-segmented constraints affect the dynamics of the cantilevered pipeline. In this effort, bifurcation diagrams, phase portraits, Poincare maps, time histories, and power spectra are used to investigate the dynamics of the system, and the fluid flow speeds where dynamic characteristics are considered. In general, it is found that critical flow speeds like when the pipe sticks in the constraints are reduced as the constraint stiffnesses are increased. Additionally, the sticking flow speed occurred at lower flow speeds as the gap sizes of the inner and outer constraints decrease, and a larger constraint offset results in a smaller inner gap size leading to critical behaviors occurring at earlier flow speeds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Hybrid model predictive control techniques for safety factor profile and stored energy regulation while incorporating NBI constraints

Abstract A novel hybrid Model Predictive Control (MPC) algorithm has been designed for simultaneous safety factor ( q ) profile and stored energy ( w ) control while incorporating the pulse-width-modulation constraints associated with the neutral beam injection (NBI) system. Regulation of the q -profile has been extensively shown to be a key factor for improved confinement as well as non-inductive sustainment of the plasma current. Simultaneous control of w is necessary to prevent the triggering of pressure-driven magnetohydrodynamic instabilities as the controller shapes the q profile. Conventional MPC schemes proposed for q -profile control have considered the NBI powers as continuous-time signals, ignoring the discrete-time nature of these actuators and leading in some cases to performance loss. The hybrid MPC scheme in this work has the capability of incorporating the discrete-time actuator dynamics as additional constraints. In nonlinear simulations, the proposed hybrid MPC scheme demonstrates improved q -profile+ w control performance for NSTX-U operating scenarios.

Physics↗
DOE OSTI2024

Polyhedral Relaxations for Optimal Pump Scheduling of Potable Water Distribution Networks

The classic pump scheduling or optimal water flow (OWF) problem for water distribution networks (WDNs) minimizes the cost of power consumption for a given WDN over a fixed time horizon. In its exact form, the OWF is a computationally challenging mixed-integer nonlinear program (MINLP). It is complicated by nonlinear equality constraints that model network physics, discrete variables that model operational controls, and intertemporal constraints that model changes to storage devices. To address the computational challenges of the OWF, this paper develops tight polyhedral relaxations of the original MINLP, derives novel valid inequalities (or cuts) using duality theory, and implements novel optimization-based bound tightening and cut generation procedures. The efficacy of each new method is rigorously evaluated by measuring empirical improvements in OWF primal and dual bounds over 45 literature instances. The evaluation suggests that our relaxation improvements, model strengthening techniques, and a thoughtfully selected polyhedral relaxation partitioning scheme can substantially improve OWF primal and dual bounds, especially when compared with similar relaxation-based techniques that do not leverage these new methods.

bound tightening↗
DOE OSTI2021

Numerical Codes for the DESC-LSST Analysis Pipeline: Core Cosmology Library Standard Modules and Beyond wCDM Modules (Final Technical Report)

The overall objective of the project is to investigate and develop specific software modules and analysis components for the software pipeline of LSST Dark Energy Science Collaboration (DESC). Following the key projects of DESC Science Roadmap (SRM), we will write and test computer codes for the Core Cosmology Library (CCL) in order to complete its modules, functionalities, and interface to work with the analysis pipelines from the five science probes of DESC (parts of SRM deliverables CX4.2TJP, CX6.2CS). We will also code modules for CCL to test models beyond w-Cold-Dark-Matter (wCDM) and modification to gravity (MG). Interfaces for MG models will also be developed for the TJPCOSMO software which is the main pipeline of the Theory and Joint Probe (TJP) working group (deliverable TJP2.3). In order to use the full power of LSST data to constrain MG models, we will also work on constraints from nonlinear regime by running and analyzing MG N-Body simulations using a Parameterized-Post-Friedmann framework into the Gadget-2 simulation package (deliverable TJP2.2). Preliminary results for the simulations were obtained in the past. In collaboration with other DESC groups, we plan to make these simulations feedable to cosmic emulators that are practical for likelihood analyzes (deliverable TJP2.2, parts of CX6.2CS). We will also modify and integrate our current codes for consistency tests between data sets and probes into the pipeline (parts of deliverables CX8.2TJP, TJP2.3). We understand that other groups will contribute to some of these objectives but our team will focus and collaborate with others on the particular part of testing MG and models beyond wCDM and refine the DESC pipeline for this purpose. PI has been coordinating his work with the TJP and CS working groups and the DESC management team. PI is a full member of DESC since June 2013. He and his students have been contributing to LSST-DESC activities and work including TJP telecons, collaboration meetings, hack-weeks, and workshops. PI chaired or co-chaired sessions at collaboration meetings and hack-weeks about testing gravity and models beyond wCDM using LSST. He is coordinating the TJP2 projects for testing models beyond wCDM including the writing of DESC-research-note, development of code for pipeline, and N-Body simulations for MG and beyond wCDM models testable with LSST analyses. As stressed in the DESC white paper, SRM, and P5 report, one of the important questions in understanding cosmic acceleration and dark energy is to be able to distinguish whether the acceleration is due to a dark energy component in the universe or a modification to gravity. Answering these questions will have a significant impact on the question of cosmic acceleration and dark energy. The methods that we will use include analytical work, numerical code, and N-Body simulations. A first approach that that we will use consists of using growth rate parameters that enter the perturbed dynamics equations. These parameters take distinctive values for distinct gravity theories and have potential to distinguish between Dark Energy and Modified Gravity. The second method is to look for inconsistencies in Dark Energy parameter spaces using specific combinations of cosmological data sets. Our investigation addresses the Dark Energy problem that is relevant to the mission of the HEP program to understand how our universe works at its most fundamental level. It will allow us to make progress on the HEP mission to explore the nature of Dark Energy and the basic nature of space and time using future surveys such as LSST. The investigation supports the DOE HEP program Cosmic Frontier as it will contribute to the study and understanding of dark energy and fundamental properties of the universe. The investigation contributes directly to LSST-DESC key projects and their deliverables as described in the Science Road-map document to build analysis pipeline and to test dark energy and beyond wCDM models using LSST.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

A note on higher-order and nonlinear limiting approaches for continuously bounds-preserving discontinuous Galerkin methods

In Dzanic (2024), a limiting approach for high-order discontinuous Galerkin schemes was introduced which allowed for imposing constraints on the solution continuously (i.e., everywhere within the element). While exact for linear constraint functionals, this approach only imposed a sufficient (but not the minimum necessary) amount of limiting for nonlinear constraint functionals. This short note shows how this limiting approach can be extended to allow exactness for general nonlinear quasiconcave constraint functionals through a nonlinear limiting procedure, reducing unnecessary numerical dissipation. Finally, some examples are shown for nonlinear pressure and entropy constraints in the compressible gas dynamics equations, where both analytic and iterative approaches are used.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Lyapunov-based nonlinear control of nonautonomous systems with individual input constraints

A control algorithm that can locally stabilize a specific class of multi-input multi-output nonautonomous nonlinear dynamical systems while satisfying individual input constraints is developed. The proposed Lyapunov-based state-feedback control law inherently accounts for the actuator amplitude saturation limits without the need for computationally expensive real-time optimization techniques. In addition to the control law, a formal definition for the local “controllable region” within which the controller can asymptotically drive the system states to the origin and satisfy the input saturation limits is also presented. The nonautonomous nature of the system dynamics implies that the “controllable region” continuously evolves with time. Therefore, a sufficient condition to maintain the system states within the “controllable region” is proposed in this work to make practical implementation feasible. The effectiveness of the controller is tested for a specific control problem arising in tokamaks, which are toroidal devices that use strong magnetic fields to confine a plasma (hot ionized gas). Here, the primary emphasis of tokamak research is to regulate the plasma properties around predetermined values to achieve stable plasma confinement. Nonlinear simulations show that the proposed controller can achieve the desired plasma control objectives in a DIII-D tokamak scenario.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Noise Constraints on Sensitivity Scaling in Quantum Nonlinear Metrology

Quantum-enhanced metrology surpasses classical metrology by improving estimation precision scaling with a resource 𝑁 (e.g., particle number or energy) from 1/√𝑁 to 1/𝑁. Through the use of nonlinear effects, Roy and Braunstein [Exponentially enhanced quantum metrology, Phys. Rev. Lett. 100, 220501 (2008)] derived a 1/𝑁 2 scaling. However, later works argued this exponential improvement is unphysical and that even modest gains, like 1/𝑁 2 , may vanish under noise. We show that, in the presence of small errors, the nonlinear interactions enabling metrological enhancement induce emergent errors. Here, the errors propagate through the sensing protocol and are magnified proportional to any intended nonlinear enhancement. We identify a critical value of the parameter to be estimated, for a fixed error, below which the emergent errors can be avoided.

Quantum Fisher information↗
DOE OSTI2020

Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching

This paper studies mixed-integer nonlinear programs featuring disjunctive constraints and trigonometric functions and presents a strengthened version of the convex quadratic relaxation of the optimal transmission switching problem. We first characterize the convex hull of univariate quadratic on/off constraints in the space of original variables using perspective functions. Next, we introduce new tight quadratic relaxations for trigonometric functions featuring variables with asymmetrical bounds. These results are used to further tighten recent convex relaxations introduced for the optimal transmission switching problem in power systems. Using the proposed improvements, along with bound propagation, on 23 medium-sized test cases in the PGLib benchmark library with a relaxation gap of more than 1%, we reduce the gap to less than 1% on five instances. The tightened model has promising computational results when compared with state-of-the-art formulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints

Here we present a new algorithm for infinite-dimensional optimization with general constraints, called ALESQP. In short, ALESQP is an augmented Lagrangian method that penalizes inequality constraints and solves equality-constrained nonlinear optimization subproblems at every iteration. The subproblems are solved using a matrix-free trust-region sequential quadratic programming (SQP) method that takes advantage of iterative, i.e., inexact linear solvers, and is suitable for large-scale applications. A key feature of ALESQP is a constraint decomposition strategy that allows it to exploit problem-specific variable scalings and inner products. We analyze convergence of ALESQP under different assumptions. We show that strong accumulation points are stationary. Consequently, in finite dimensions ALESQP converges to a stationary point. In infinite dimensions we establish that weak accumulation points are feasible in many practical situations. Under additional assumptions we show that weak accumulation points are stationary. We present several infinite-dimensional examples where ALESQP shows remarkable discretization-independent performance in all of its iterative components, requiring a modest number of iterations to meet constraint tolerances at the level of machine precision. Also, we demonstrate a fully matrix-free solution of an infinite-dimensional problem with nonlinear inequality constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Modeling the AC Power Flow Equations with Optimally Compact Neural Networks: Application to Unit Commitment

Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using neural networks. These neural networks can be exactly transformed into mixed integer linear programs and embedded inside challenging optimization problems, thus replacing nonlinearities that are intractable for many applications with tractable piecewise linear approximations. Such approaches, though, suffer from an explosion of the number of binary variables needed to represent the neural network. Accordingly, this paper develops a technique for training an "optimally compact'' neural network, i.e., one that can represent the power flow equations with a sufficiently high degree of accuracy while still maintaining a tractable number of binary variables. We demonstrate the use of this neural network as an approximator of the nonlinear power flow equations by embedding it in the AC unit commitment problem, transforming the problem from a mixed integer nonlinear program into a more manageable mixed integer linear program. We use the 14-, 57-, and 89-bus networks as test cases and compare the AC-feasibility of commitment decisions resulting from the neural network, DC, and linearized power flow approximations. Our results show that the neural network model outperforms both the DC and linearized power flow approximations when embedded in the unit commitment problem. The neural network formulation most often selects a feasible unit commitment schedule, and furthermore, it only s

AC power flow↗
DOE OSTI2021

A fast reduced model for a shell-and-tube based latent heat thermal energy storage heat exchanger and its application for cost optimal design by nonlinear programming

Numerical simulation of latent heat thermal energy storage (LHTES) systems plays a fundamental role in studying the physical process and guiding the engineering design. Discretization of the PDEs describing the nonlinear solidification/melting process of phase change materials (PCMs) leads to a large-scale complex dynamics system, where the system behavior depends on a set of parameters. In a design setting, repeated model evaluations are required over the set of parameters results in significant computational burden. In this paper, an explicit analytic solution was built for the propagation of the solidification front in a cylindrical coordinate. The analytic solution approach is further employed to develop a low computational reduced model (RM) as a module for a shell-and-tube based LHTES heat exchanger. The levelized Cost of Energy (LCOE) is used as a design metric and the RM model is used to apply system-level constraints in the nonlinear programming formulation that facilitates efficient global optimal design of the PCM properties, flow conditions and tube geometries. The use of LCOE as the design metric prevents over design of the heat transfer rate and also establishes a fair ground for evaluation of different thermal storage technologies and their integrated applications with other systems. Optimal results showed that a higher effectiveness results in a higher LCOE; the velocity of the HTF and the length of the channel are highly correlated with each other; both larger PCM latent energy and conductivity result in lower LCOE.

25 ENERGY STORAGE↗
DOE OSTI2020

Stochastic multi-period optimal dispatch of energy storage in unbalanced distribution feeders

This report presents a convex, multi-period, AC-feasible Optimal Power Flow (OPF) framework that robustly dispatches flexible demand-side resources in unbalanced distribution feeders against uncertainty in very-short timescale solar Photo-Voltaic (PV) forecasts. This is valuable for power systems with significant behind-the-meter solar PV generation as their operation is affected by uncertainty from forecasts of demand and solar PV generation. The aim of this work is then to ensure the feasibility and reliability of distribution system operation under high solar PV penetration. We develop and present a novel, robust OPF formulation that accounts for both the nonlinear power flow constraints and the uncertainty in forecasts. This is achieved by linearizing an optimal trajectory and using first-order methods to systematically tighten voltage bounds. Case studies on a realistic distribution feeder shows the effectiveness of a receding-horizon implementation.

25 ENERGY STORAGE↗