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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
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↗
NASA NTRS1994

Magnetotail dynamics under isobaric constraints

Using linear theory and nonlinear MHD simulations, we investigate the resistive and ideal MHD stability of two-dimensional plasma configurations under the isobaric constraint dP/dt = 0, which in ideal MHD is equivalent to conserving the pressure function P = P(A), where A denotes the magnetic flux. This constraint is satisfied for incompressible modes, such as Alfven waves, and for systems undergoing energy losses. The linear stability analysis leads to a Schroedinger equation, which can be investigated by standard quantum mechanics procedures. We present an application to a typical stretched magnetotail configuration. For a one-dimensional sheet equilibrium characteristic properties of tearing instability are rediscovered. However, the maximum growth rate scales with the 1/7 power of the resistivity, which implies much faster growth than for the standard tearing mode (assuming that the resistivity is small). The same basic eigen-mode is found also for weakly two-dimensional equilibria, even in the ideal MHD limit. In this case the growth rate scales with the 1/4 power of the normal magnetic field. The results of the linear stability analysis are confirmed qualitatively by nonlinear dynamic MHD simulations. These results suggest the interesting possibility that substorm onset, or the thinning in the late growth phase, is caused by the release of a thermodynamic constraint without the (immediate) necessity of releasing the ideal MHD constraint. In the nonlinear regime the resistive and ideal developments differ in that the ideal mode does not lead to neutral line formation without the further release of the ideal MHD constraint; instead a thin current sheet forms. The isobaric constraint is critically discussed. Under perhaps more realistic adiabatic conditions the ideal mode appears to be stable but could be driven by external perturbations and thus generate the thin current sheet in the late growth phase, before a nonideal instability sets in.

Birn, Joachim↗
NASA NTRS1985

Geomagnetic main field modeling using magnetohydrodynamic constraints

The influence of physical constraints are investigated which may be approximately satisfied by the Earth's liquid core on models of the geomagnetic main field and its secular variation. A previous report describes the methodology used to incorporate nonlinear equations of constraint into the main field model. The application of that methodology to the GSFC 12/83 field model to test the frozen-flux hypothesis and the usefulness of incorporating magnetohydrodynamic constraints for obtaining improved geomagnetic field models is described.

Estes, R. H.↗
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↗
DOE OSTI2025

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Method to account for natural fracture induced elastic anisotropy in geomechanical characterization of shale gas reservoirs

Shale has been usually recognized as a transverse isotropic (TI) medium in conventional geomechanical log interpretation due to its laminated nature. However, when natural fractures exist in the shale rock, additional elastic anisotropy is introduced, converting laminated Shale to an orthorhombic (OB) medium. Previous studies illustrate that neglecting the natural fracture induced anisotropy in shale geomechanical log interpretation could lead to inaccurate evaluations of elastic moduli and in-situ stresses. In this paper, a new method is developed to account for the natural fracture induced anisotropy in geomechanical log interpretation based upon the TI acoustic model developed by the author and a characterization technique of elastic wave anisotropy (Sayers, 1991). The new OB model incorporates the four acoustic log data inputs and five modeling constraints in a nonlinear optimization algorithm to solve for the nine independent stiffness coefficients of an OB rock, and further to solve for the geomechanical properties and in-situ stress profiles in an OB formation. The new method was validated with a Marcellus Gas Shale field case. Both the new OB model and the conventional TI model were applied to interpret the minimum horizontal stress profile for the same formation. By comparing the results, the OB model is more robust than the TI from two aspects. First, the average stress magnitude predicted by the OB model is closer to the one measured by the Diagnostic Fracture Injection Test (DFIT). Second, the OB model predicts a more obvious stress barrier between the lower Marcellus and upper Onondaga Limestone than the TI model does. Finally, the predicted stress barrier is consistent with the observation of the microseismic events of a horizontal well drilled and completed nearby, which reveals that no hydraulic fracture propagates downward through the bottom boundary of Marcellus Shale into the underlying Onondaga Limestone.

03 NATURAL GAS↗
DOE OSTI2026

Data-based filtered dissipation rate modelling for multi-modal turbulent combustion: evaluating a priori model generalizability

Manifold-based models offer a computationally efficient alternative to directly transporting the thermochemical state in computational simulations of turbulent reacting flows, projecting the high-dimensional thermochemical state-space onto a low-dimensional manifold. Recent efforts have yielded a manifold-based model applicable to multi-modal combustion, enabling reconstruction of the thermochemical state from solutions to two-dimensional manifold equations in mixture fraction and generalized progress variable that are parameterised by three scalar dissipation rates. In coarse-grained simulations such as Large Eddy Simulation (LES), closure of the multi-modal manifold equations and subfilter variances/covariance requires closure of three filtered scalar dissipation rates. Here, the present work adopts a data-based approach, providing closure for the three filtered scalar dissipation rates via deep neural networks (DNNs). High-fidelity datasets corresponding to an autoigniting n-dodecane jet flame and a bluff body swirl-stabilized confined lifted spray flame of two aviation fuels (Jet-A and C1) with different ignition propensities are leveraged to generate training data that spans a diverse range of thermodynamic conditions and combustion modes, including low- and high-temperature ignition regimes in addition to premixed and nonpremixed behaviour. A final DNN model is trained to enforce inherent physical constraints by learning nonlinear functional transformations of the three filtered scalar dissipation rates. The generalizability of this constrained DNN model is demonstrated a priori via conditional statistics evaluated on the lifted spray flame with C1–a configuration that had not been included in the training data. Excellent DNN agreement with conditional DNS statistics is observed, and integrated gradients are computed to identify the most sensitive input variables. The similarity of the marginal PDFs of the most informative input variables and outputs across configurations are quantified via the Wasserstein metric, demonstrating that data-based models may successfully generalize to unseen parametric conditions so long as the most informative input variables share similar distributions across training and testing datasets.

Data-based modelling↗
DOE OSTI2023

Semidefinite programming algorithm for the quantum mechanical bootstrap

Here, we present a semidefinite programming algorithm to find eigenvalues of Schrödinger operators within the bootstrap approach to quantum mechanics. The bootstrap approach involves two ingredients: a nonlinear set of constraints on the variables (expectation values of operators in an energy eigenstate), plus positivity constraints (unitarity) that need to be satisfied. By fixing the energy we linearize all the constraints and show that the feasibility problem can be presented as an optimization problem for the variables that are not fixed by the constraints and one additional slack variable that measures the failure of positivity. To illustrate the method we are able to obtain high-precision, sharp bounds on eigenenergies for arbitrary confining polynomial potentials in one dimension.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

On the Diffusivity of Moist Static Energy and Implications for the Polar Amplification Response to Climate Warming

Energy balance models (EBMs) have been widely used in a range of climate problems, but the assumption of constant diffusivity in the parameterization of the moist static energy (MSE) flux can be hardly justified. We demonstrate in this study that the diffusive MSE flux can be derived from the basic energy balance equation with a few tolerable assumptions. The estimated diffusivity is both spatially and seasonally dependent, and its midlatitude average is then tested against several scaling theories for the midlatitude eddy diffusivity. The result supports the diffusivity theory of Held and Larichev (1996) modified for the moist atmosphere, affording a dynamics-based parameterization of MSE diffusivity. The implementation of the parameterization in an EBM leads to an interactive MSE diffusivity that accounts for the midlatitude eddy response to climate forcing perturbations. Under a uniform radiative forcing, the EBM with a diffusivity so parameterized produces a weakening of the midlatitude diffusivity and a modestly polar-amplified surface temperature response as an inevitable outcome under the dual constraints of the nonlinear Clausius-Clapeyron relation and the temperature gradient-dependent diffusivity, even in the absence of any poleward amplifying radiative feedbacks. As the consequence of more isothermal temperature and reduced diffusivity, the variance of the midlatitude surface temperature also decreases with warming.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1983

Extrapolation of optimum design based on sensitivity derivatives

In many applications, it is useful to have information regarding the effect of the perturbations of the design problem constants (parameters) on the optimum solution of the problem. Sobieszczanski-Sobieski et al. (1981) have, therefore, proposed to utilize an optimum sensitivity analysis as a structural design tool to assess the parameter perturbation effects by extrapolations based on optimum sensitivity derivatives. The present investigation is concerned with an example of optimum sensitivity analysis involving a composite panel. The case was selected in connection with the nonlinearity of the constraints and, the tendency for a set of active constraints to change when the parameters are disturbed. Under these adverse conditions, sensitivity derivatives are used in linear extrapolations to extend optimization information over a limited range of variation for a typical parameter.

Barthelemy, J.-F. M.↗
NASA NTRS1988

GaussFit - A system for least squares and robust estimation

GaussFit is a new computer program for solving least-squares and robust estimation problems. It has a number of unique features, including a complete programming language designed especially to formulate estimation problems, a built-in compiler and interpreter to support the programming language, and a built-in algebraic manipulator for calculating the required partial derivatives analytically. These features make GaussFit very easy to use, so that even complex problems can be set up and solved with minimal effort. GaussFit can correctly handle many cases of practical interest: nonlinear models, exact constraints, correlated observations, and models where the equations of condition contain more than one observed quantity. An experimental robust estimation capability is built into GaussFit so that data sets contaminated by outliers can be handled simply and efficiently.

Jefferys, W. H.↗
NASA NTRS1992

Robust intelligent flight control for hypersonic vehicles

Intelligent optimization methods are applied to the problem of real-time flight control for a class of airbreathing hypersonic vehicles (AHSV). The extreme flight conditions that will be encountered by single-stage-to-orbit vehicles, such as the National Aerospace Plane, present a tremendous challenge to the entire spectrum of aerospace technologies. Flight control for these vehicles is particularly difficult due to the combination of nonlinear dynamics, complex constraints, and parametric uncertainty. An approach that utilizes all available a priori and in-flight information to perform robust, real time, short-term trajectory planning is presented.

Chamitoff, Gregory Errol↗
NASA NTRS1991

Path planning algorithms for assembly sequence planning

Planning for manipulation in complex environments often requires reasoning about the geometric and mechanical constraints which are posed by the task. In planning assembly operations, the automatic generation of operations sequences depends on the geometric feasibility of paths which permit parts to be joined into subassemblies. Feasible locations and collision-free paths must be present for part motions, robot and grasping motions, and fixtures. This paper describes an approach to reasoning about the feasibility of straight-line paths among three-dimensional polyhedral parts using an algebra of polyhedral cones. A second method recasts the feasibility conditions as constraints in a nonlinear optimization framework. Both algorithms have been implemented and results are presented.

Krishnan, S. S.↗