Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrix inequality”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

A Vision–based Robust $\mathcal{H}$ ∞ Gain Scheduling Longitudinal and Lateral Following Controller for Autonomous Vehicles on Urban Curved Roads

Implementing advanced driver assistance systems (ADAS) in congested and intricate urban traffic scenarios poses significant challenges. To address the frequent stop–and–go motions exhibited by autonomous vehicles (AVs) navigating urban roads with changes in curvature, we propose a vision–based robust $\mathcal{H}$ ∞ adaptive cruise control system (ACC) for longitudinal control, plus a lane keeping assist system (LKAS) for lateral control. For the vision-based ACC, a weighted probability objective function for the vehicle following behavior is formulated. We incorporate $\mathcal{H}$ ∞ performance and gain scheduling techniques to mitigate the impact of uncertainty in visual sensor measurements. Furthermore, the optimal time headway is scheduled based on the velocity to ensure traffic flow efficiency and safety during the vehicle following process. For the LKAS, we introduce a road curvature estimation method that integrates lane and vehicle dynamics information to obtain the lateral and heading offsets. Next, the design criterion of the observer–based robust gain scheduling lateral motion controller is established by linear matrix inequality (LMI). Here, a series of experiments conducted within a camera–in–loop platform validate the proposed method.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2026

Hybrid Symbolic-Numerical Modeling and Parametric Stability Analysis of DC–AC Power Systems

Hybrid DC-AC power systems integrating diverse inverter-based resources (IBRs) and multi-terminal high-voltage direct current (MTDC) networks represent a promising architecture for future power grids, while introducing challenges for modeling, stability analysis, and control design. This paper develops a hybrid symbolic-numerical modeling framework and tool to characterize the parametric small-signal stability of DC-AC coupled power systems. The proposed approach constructs parametric state-space models to enable efficient representation of system dynamics under varying control parameters and network configurations, with target parameters retained as symbolic variables and the remainder treated numerically. The stability analysis framework covers eigenvalue, sensitivity, and stability boundary and region characterization. Enhanced linear matrix inequality (LMI) techniques are proposed to directly certify small-signal stability over regions of parameter space while also reducing the conservativeness and computational burden. The resulting tools and frameworks enable rapid parametric model construction across diverse grid conditions, thereby facilitating stability-informed control and operation in complex DC–AC power systems.

DC–AC power systems↗
DOE OSTI2026

Dual Representations and H ∞ -Optimal Control of Partial Differential Equations

We consider H ∞ -optimal state-feedback control of the class of linear Partial Differential Equations (PDEs) which admit a Partial Integral Equation (PIE) representation. While linear matrix inequalities are commonly used for optimal control of Ordinary Differential Equations (ODEs), the absence of a universal state-space representation and suitable dual form prevents such methods from being applied to optimal control of PDEs. Specifically, for ODEs, the controller synthesis problem is defined in state-space, and duality is used to resolve the bilinearity of that synthesis problem. Recently, the PIE representation was proposed as a universal state-space representation for linear PDE systems. In this paper, we show that any PDE system represented by a PIE admits a dual PIE with identical stability and I/O properties. This result allows us to reformulate the stabilizing and optimal state-feedback control problems as convex optimization over the cone of positive Partial Integral (PI) operators. Operator inversion formulae then allow us to construct feedback gains for the original PDE system. The results are verified through application to several canonical problems in optimal control of PDEs and indicate the resulting bounds on H ∞ norm are not conservative.

42 ENGINEERING↗
DOE OSTI2024

H ∞ Control for Energy Dispatch in Autonomous Nanogrid With Communication Delays

This paper proposes an optimal controller and estimator for energy dispatch to balance the power supply and demand considering communication delays. The proposed algorithm involves modeling an autonomous nanogrid (ANG) consisting of distributed energy resources, energy storage systems, loads, an $H$ ∞ controller with a reference power modulation technique, and a state estimator. The ANG was developed to express the dynamic supply-demand energy balance of a nanogird system. Reference power modulation was designed to generate the desired ESS power based on the imbalanced energy. Random communication delays were modeled using a stochastic variable satisfying the Bernoulli random binary distribution. The optimal $H$ ∞ controller and estimator were developed using a linear matrix inequality approach to exponentially stabilize the closed-loop system. Simulations were performed using real daily demand forecasts obtained from the Korea Meteorological Administration to demonstrate the effectiveness of the proposed real-time optimization algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Resilient Operating Constraints for Power Distribution Systems under Setpoint Attacks

Integration and operation of distributed generation (DG) and energy storage (ES) in power distribution systems are enabled by communication networks and embedded sensor and control devices that increase the vulnerability of the systems to cyber-threats, broadening the attack surface and making adversary actions more unpredictable. This paper proposes a methodology that uses ellipsoidal approximations to quantify the potential damage caused by successful attacks that affect, directly or indirectly, the desired operation setpoints and may drive the power distribution operation to unsafe states by violating the limits of voltage or line flows. More specifically, a new methodology is introduced to find the optimal non-symmetric operating constraints that can be imposed to each DG and ES in order to guarantee that the power distribution system is resilient to any malicious setpoints. The proposed method takes as inputs the system topology, DG and ES capabilities, and load limits to solve a convex optimization problem formulated using linear matrix inequalities (LMIs) and the power flow equations. The proposed solution is agnostic to the attacker's action or load profile and it does not require any assumption about the location or means of the attack. The numerical results on a test distribution feeder with several DG and ES illustrate how the proposed resilient operating constraints guarantee the security of the power distribution system under setpoint attacks.

Giraldo, Jairo↗
DOE OSTI2024

On the Stability of Power Transmission Systems Under Persistent Inverter Attacks: A Bi-Linear Matrix Approach

We investigate the stability and robustness properties of a power transmission system under persistent deceiving attacks on inverter-interfaced energy resources. The attacks can corrupt the damping coefficients in the inverters' controllers and measurements of the frequency at the points of coupling. Leveraging tools from hybrid dynamical systems theory, we characterize a broad family of persistent (and not necessarily periodic) attacks acting on the inverters, under which the stability properties of the transmission system can be shown to not be compromised. To address potentially conservative conditions identified through conventional bounding techniques, sufficient conditions on the average activation time of the attacks are identified via Lyapunov theory, as well as the formulation and solution of a class of bilinear matrix inequalities (BMI). The results are obtained for constant and slowly time-varying loads via input-to-state stability (ISS) tools. Numerical simulations on the IEEE 39-bus test system are also presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Data-Conforming Data-Driven Control: Avoiding Premature Generalizations Beyond Data

Data-driven and adaptive control approaches face the problem of introducing sudden distributional shifts beyond the distribution of data encountered during learning. Therefore, they are prone to invalidating the very assumptions used in their own construction. This is due to the linearity of the underlying system, inherently assumed and formulated in most data-driven control approaches, which may falsely generalize the behavior of the system beyond the behavior experienced in the data. This article seeks to mitigate these problems by enforcing consistency of the newly designed closed-loop systems with data and slowing down any distributional shifts in the joint state-input space. This is achieved through incorporating affine regularization terms and linear matrix inequality constraints to data-driven approaches, resulting in convex semi-definite programs that can be efficiently solved by standard software packages. We discuss the optimality conditions of these programs and then conclude this article with a numerical example that further highlights the problem of premature generalization beyond data and shows the effectiveness of our proposed approaches in enhancing the safety of data-driven control methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Fault isolation and fault-tolerant control for Takagi-Sugeno fuzzy time-varying delay stochastic distribution systems

A fault isolation, estimation, and fault-tolerant control (FTC) scheme for nonlinear time-varying delay stochastic distribution control systems was presented in this paper. The Takagi-Sugeno fuzzy model was adopted to approach the nonlinear dynamics of time-varying delay systems. According to the output equivalence principle and Laplace transformation, an augmented state vector was given to solve the time-varying delay problem. When multiple actuator faults and interference occur simultaneously, fault detection, isolation and fault estimation was designed to obtained the fault information. To decouple faults and obtain the value and location information of the fault, the system was separated into two parts through the designed multiple conversion matrices, in which one subsystem was only affected by one actuator fault. This has simplified the design of fault isolation and estimation. A adaptive observer for fault estimation was given. Then, fault information such as the time, location, and size was determined. The observer gain matrices were calculated using linear matrix inequality (LMI). When a fault was detected and diagnosed, a FTC algorithm was devised using the proportional-integral control scheme to compensate the fault as much as possible. It has been shown that even if multiple faults actuator occurred simultaneously, the FTC controller still ensured the output probability density function of the system traced the desired probability density function when a fault occurred. Finally, the expected results were obtained through the simulation example, which confirmed the effectiveness of the method.

42 ENGINEERING↗
DOE OSTI2022

Cyber-Resilient Frequency Control of Power Grids with Energy Storage Systems

The integration of synchronous generators and energy storage systems operated through communication networks introduces new challenges and vulnerabilities to the electric grid, where cyber attacks can corrupt sensor measurements or control inputs and interrupt functions such as frequency regulation. This paper proposes a defense methodology for the design of resilient operating constraints imposed on each generation and storage unit in order to prevent any attack sequence from driving the system's frequency to unsafe conditions. The resilient operating constraints are found by using ellipsoidal approximations of the reachable set of the power system, leading to a convex optimization problem with linear matrix inequalities. Numerical results in a single-area power system with synchronous generation and energy storage demonstrate how the resilient constraints provide security guarantees against any type of attack affecting frequency measurements or controller setpoints.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Necessary and sufficient conditions for quadratic stabilizability of switched systems on non-uniform time domains

In this paper, we consider the quadratic stabilizability via state feedback for a particular class of switched systems that evolve on a non-uniform time domain by introducing time scales theory. The system considered switches between a continuous-time subsystem with variable lengths and a discrete-time subsystem with variable discrete step sizes. Necessary and sufficient conditions are derived to guarantee the quadratic stability of this class of switched systems via a switching state feedback law based on the existence of a common positive definite matrix satisfying the quadratic stabilizability condition by considering that the two subsystems are unstable. By state feedback, we mean that the switching among subsystems depends on the system states. Current results for this kind of state switching feedback control are derived only for switched systems evolving on a continuous time domain or a discrete time domain with fixed step’s size. These results are not applicable for the particular class of switched systems where there is a mixing between the continuous and discrete dynamics. This motivates the derivation of a new and more general state feedback control law for switched systems in this work. Here, a numerical example illustrating the results is presented.

42 ENGINEERING↗
DOE OSTI2021

Sparse Control Synthesis for Uncertain Responsive Loads With Stochastic Stability Guarantees

In this report, recent studies have demonstrated the potential of flexible loads in providing frequency response services, predominantly due to their availability and cost-effectiveness. However, uncertainty and variability in various weather-related and end-use behavioral factors often impact the reliability of demand-side control performance. This work addresses this problem with the design of a demand-side control to achieve frequency response under load uncertainties. Our approach involves modeling the load uncertainties via stochastic processes that appear as both multiplicative and additive in the power system dynamics. Recently developed mean square exponential stability (MSES) results for continuous-time linear stochastic systems are applied to pose the control synthesis problem which results in an LMI-based optimization problem. Additional costs and constraints are added to the LMI-based controller synthesis to ensure MSES, improve closed-loop transient performance, maximize tolerable uncertainties, and promote sparsity in the controller. Additionally, the fundamental limitations between the tolerable uncertainties and control efforts while ensuring MSES are discussed. Further, the control synthesis problem for the case of the full-state measurement is generalized to the case of partial-state measurements. The proposed control synthesis is illustrated on an IEEE 39 bus system with rigorous studies to demonstrate the role of sparsity, closed-loop transient performance, tolerable uncertainties, and control efforts while ensuring MSES and achieving frequency response.

42 ENGINEERING↗
DOE OSTI2025

Thermal bootstrap of matrix quantum mechanics

We implement a bootstrap method that combines stationary state conditions, thermal inequalities, and semidefinite relaxations of matrix logarithm in the ungauged one-matrix quantum mechanics, at finite rank N as well as in the large N limit, and determine finite temperature observables that interpolate between available analytic results in the low and high temperature limits respectively. We also obtain bootstrap bounds on thermal phase transition as well as preliminary results in the ungauged two-matrix quantum mechanics.

1/N Expansion↗
DOE OSTI2023

On the convexity of phase-field fracture formulations: Analytical study and comparison of various degradation functions

Efficient and accurate fracture modeling is of great importance in applications where catastrophic outcomes under extreme scenarios are possible. The phase-field (PF) approach to fracture received significant attention over the past decade, due to its capability to capture complicated fracture patterns (e.g., crack merging and branching). Specifically, crack initiation and propagation are modeled via minimization of the total energy functional, which is regularized with the aid of a phase field. Despite the promising results and modeling capabilities of the PF method in many applications, the solution of fracture problems remains computationally challenging mainly due to the non-convexity of the total energy functional with respect to the combined unknown (phase field and displacement) fields. Understanding the effects of their coupling on convexity is crucial in order to address frequently encountered hurdles in fracture modeling (e.g., inefficient solvers and non-physical crack nucleation). In this paper, we develop convexity criteria for a wide class of PF fracture formulations. For this class of formulations, the second variation of the total energy functional is expressed in terms of Hessian matrices (evaluated at individual material points). Depending on the choice of geometric crack functions and degradation functions, we classify the formulations into three categories and analytically study each one separately. To study the sign of the second variation, we derive inequalities which are satisfied at material points when the Hessian matrix is locally positive semi-definite. These inequalities provide objective criteria for comparing degradation functions. Finally, the applicability of the proposed convexity criteria is demonstrated in the context of a one-dimensional problem, solved using a conventional monolithic solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Physics-constrained Deep Recurrent Neural Models of Building Thermal Dynamics

We develop physics-constrained and control-oriented predictive deep learning models for the thermal dynamics of a real-world commercial office building. The proposed method is based on the systematic encoding of physics-based prior knowledge into a structured recurrent neural architecture. Specifically, our model mimics the structure of the building thermal dynamics model and leverages penalty methods to model inequality constraints. Additionally, we use constrained matrix parameterization based on the Perron-Frobenius theorem to bound the eigenvalues of the learned network weights. We interpret the stable eigenvalues as dissipativeness of the learned building thermal model. We demonstrate the effectiveness of the proposed approach on a dataset obtained from an office building with $20$ thermal zones.

Building Energy, structured neural networks↗
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 OSTI2025

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗
DOE OSTI2023

Parallel Memory-Independent Communication Bounds for SYRK

In this paper, we focus on the parallel communication cost of multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK). SYRK requires half the computation of general matrix multiplication because of the symmetry of the output matrix. Recent work (Beaumont et al., SPAA '22) has demonstrated that the sequential I/O complexity of SYRK is also a constant factor smaller than that of general matrix multiplication. Inspired by this progress, we establish memory-independent parallel communication lower bounds for SYRK with smaller constants than general matrix multiplication, and we show that these constants are tight by presenting communication-optimal algorithms. The crux of the lower bound proof relies on extending a key geometric inequality to symmetric computations and analytically solving a constrained nonlinear optimization problem. Here, the optimal algorithms use a triangular blocking scheme for parallel distribution of the symmetric output matrix and corresponding computation.

Communication costs↗