Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochastic optimizations”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

GW with hybrid functionals for large molecular systems

A low-cost approach for stochastically sampling static exchange during time-dependent Hartree–Fock-type propagation is presented. This enables the use of an excellent hybrid density functional theory (DFT) starting point for stochastic GW quasiparticle energy calculations. Generalized Kohn–Sham molecular orbitals and energies, rather than those of a local-DFT calculation, are used for building the Green function and effective Coulomb interaction. The use of an optimally tuned hybrid diminishes the starting point dependency in one-shot stochastic GW, effectively avoiding the need for self-consistent GW iterations.

Chemistry↗
DOE OSTI2021

Data-Driven Global Sensitivity Analysis of Three-Phase Distribution System with PVs

Global sensitivity analysis (GSA) of distribution system with respect to stochastic PV variations plays an important role in designing optimal voltage control schemes. This paper proposes a Kriging, i.e., Gaussian process modeling enabled data-driven GSA method. The key idea is to develop a surrogate model that captures the hidden global relationship between voltage and real and reactive power injections from the historical data. With the surrogate model, the Sobol index can be conveniently calculated to assess the global sensitivity of voltage to various power injection variations. Comparison results with other model-based GSA methods on the IEEE 37-bus feeder, such as the polynomial chaos expansion and the Monte Carlo approaches demonstrate that the proposed method can achieve accurate GSA outcomes while maintaining high computational efficiency.

distribution system analysis↗
DOE OSTI2026

Sparow-Examples

SAND2026-16701O SPAROW-Examples software provides a repository of stochastic programming examples designed to demonstrate Sandia's SPAROW optimization library. This resource helps users learn to develop complex applications with SPAROW by offering reference implementations that can be used to test and enhance new optimization solvers. The library offers a diverse range of simple and complex exemplars, including those related to power grid applications such as unit commitment and expansion planning. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Hart, William [Sandia National Lab. (SNL-CA), Live↗
NASA NTRS1986

A stopping theoretic approach to minimal time detection of system parameter change

The problem of minimal time detection of abrupt parameter changes in linear stochastic systems considered. The problem is posed as an optimal stopping problem for the detection in change of the induced probability measure. Under the assumption of a prior distribution for the time of change (or disruption) a stopping rule is given which minimizes the average detection delay when there is knowledge of the new measure after the change. When the new induced measure is unknown, a stopping rule is given, based only on the noisy observations and is shown to be better than the a priori knowlege of the disruption time.

Mazumdar, Ravi R.↗
NASA NTRS1994

Designing robust control laws using genetic algorithms

The purpose of this research is to create a method of finding practical, robust control laws. The robustness of a controller is judged by Stochastic Robustness metrics and the level of robustness is optimized by searching for design parameters that minimize a robustness cost function.

Marrison, Chris↗
NASA NTRS2020

Designing Trajectories Resilient to Missed Thrust Events Using Expected Thrust Fraction

With the adoption of efficient low-thrust propulsion methods, the probability of a missed thrust event occurring has become a significant concern for short and long- duration missions. If the missed thrust events take place during a critical portion of the trajectory, the mission can be compromised. Therefore, it is essential to de- velop trajectories that are resilient to missed thrust events. This paper investigates the use of expected thrust fraction, which embeds the stochastic nature of missed thrust events into a deterministic optimal control problem. The performance of trajectories designed using expected thrust fraction is compared with traditionally designed trajectories to measure changes in resiliency to missed thrust events. In this investigation, trajectories designed using expected thrust fraction arrive with a median lateness half that of traditionally designed trajectories. Using expected thrust fraction can help astrodynamicists mitigate risks posed by the use of low- thrust propulsion.

Laipert, Frank E.↗
NASA NTRS1976

Optimal ride control for the Twin Otter, STOL aircraft

An aircraft with low wing loading, such as the deHavilland, Twin Otter, exhibits a relatively large acceleration sensitivity to wind gusts. These undesirable aircraft motions can be reduced using an automatic ride control system. In this paper, the techniques of quadratic optimal control theory are utilized to investigate the capabilities of such a ride control system. The effects of the wind gusts on the aircraft can be modeled by a vector stochastic process containing seven states. The impact of this disturbance model on the optimal control system structure is assessed and comparison is made to a system without gust feedback.

Holley, W. E.↗
DOE OSTI2022

Machine-learning-assisted high-temperature reservoir thermal energy storage optimization

High-temperature reservoir thermal energy storage (HT-RTES) has the potential to become an indispensable component in achieving the goal of the net-zero carbon economy, given its capability to balance the intermittent nature of renewable energy generation. In this study, a machine-learning-assisted computational framework is presented to co-optimize the performance metrics of HT-RTES by combining physics-based simulation with stochastic hydrogeologic formation and thermal energy storage operation parameters, artificial neural network regression of the simulation data, and genetic algorithm-enabled multi-objective optimization. A doublet well configuration with a layered (aquitard-aquifer-aquitard) generic reservoir is simulated for cases of continuous operation and seasonal-cycle operation scenarios. Further, neural network-based surrogate models are developed for the two scenarios and applied to generate the Pareto fronts of the HT-RTES performance for four potential HT-RTES sites. The developed Pareto optimal solutions indicate the performance of HT-RTES is operation-scenario (i.e., fluid cycle) and reservoir-site dependent, and the performance metrics have competing effects for a given site and a given fluid cycle. The developed neural network models can be applied to identify suitable sites for HT-RTES, and the proposed framework sheds light on the design of resilient HT-RTES systems.

15 GEOTHERMAL ENERGY↗
DOE OSTI2021

Robust implementation of generative modeling with parametrized quantum circuits

Although the performance of hybrid quantum-classical algorithms is highly dependent on the selection of the classical optimizer and the circuit ansätze, a robust and thorough assessment on-hardware of such features has been missing to date. From the optimizer perspective, the primary challenge lies in the solver’s stochastic nature, and their significant variance over the random initialization. Therefore, a robust comparison requires one to perform several training curves for each solver before one can reach conclusions about their typical performance. Since each of the training curves requires the execution of thousands of quantum circuits in the quantum computer, such a robust study remained a steep challenge for most hybrid platforms available today. In this work, we leverage on Rigetti’s Quantum Cloud Services (QCS™) to overcome this implementation barrier, and we study the on-hardware performance of the data-driven quantum circuit learning (DDQCL) for three different state-of-the-art classical solvers, and on two-different circuit ansätze associated to different entangling connectivity graphs for the same task. Additionally, we assess the gains in performance from varying circuit depths. To evaluate the typical performance associated with each of these settings in this benchmark study, we use at least five independent runs of DDQCL towards the generation of quantum generative models capable of capturing the patterns of the canonical Bars and Stripes dataset. In this experimental benchmarking, the gradient-free optimization algorithms show an outstanding performance compared to the gradient-based solver. In particular, one of them had better performance when handling the unavoidable noisy objective function to be minimized under experimental conditions.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

A disturbance based control/structure design algorithm

Some authors take a classical approach to the simultaneous structure/control optimization by attempting to simultaneously minimize the weighted sum of the total mass and a quadratic form, subject to all of the structural and control constraints. Here, the optimization will be based on the dynamic response of a structure to an external unknown stochastic disturbance environment. Such a response to excitation approach is common to both the structural and control design phases, and hence represents a more natural control/structure optimization strategy than relying on artificial and vague control penalties. The design objective is to find the structure and controller of minimum mass such that all the prescribed constraints are satisfied. Two alternative solution algorithms are presented which have been applied to this problem. Each algorithm handles the optimization strategy and the imposition of the nonlinear constraints in a different manner. Two controller methodologies, and their effect on the solution algorithm, will be considered. These are full state feedback and direct output feedback, although the problem formulation is not restricted solely to these forms of controller. In fact, although full state feedback is a popular choice among researchers in this field (for reasons that will become apparent), its practical application is severely limited. The controller/structure interaction is inserted by the imposition of appropriate closed-loop constraints, such as closed-loop output response and control effort constraints. Numerical results will be obtained for a representative flexible structure model to illustrate the effectiveness of the solution algorithms.

Mclaren, Mark D.↗
DOE OSTI2021

Efficient prediction of concentrating solar power plant productivity using data clustering

Concentrating solar power (CSP) plants convert solar energy to electricity and can be deployed with a thermal storage capability to shift electricity generation from time periods with available solar resource to those with high electricity demand or electricity price. Rigorous optimization of plant design and operational strategies can improve the market-competitiveness and commercial viability; however, such optimization may require hundreds of annual performance simulations, each of which can be computationally expensive when including considerations such as optimization of dispatch scheduling, sub-hourly time resolution, and stochastic effects due to uncertain weather or electricity price forecasts. This paper proposes a methodology to reduce the computational burden associated with simulation of electricity yield and revenue for CSP plants over a single- or multi-year period. Data-clustering techniques are employed to select a small number of limited-duration time blocks for simulation that, when appropriately weighted, can reproduce generation and revenue over a single year or within each year of a multi-year period. After selection of appropriate data features and weighting factors defining similarity between time-series profiles, the methodology captured annual revenue within 2.3%, 1.7%, or 1.2% using simulation of 10, 30, or 50 three-day exemplar time blocks, respectively, for each of three single-year location/weather/market scenarios and five plant configurations ranging from low to high solar multiple and storage capacity. When applied to multi-year datasets, the proposed methodology can capture inter-year variability that is unavailable from typical meteorological year (TMY) datasets while simultaneously requiring simulation of less than a single year of data.

14 SOLAR ENERGY↗
DOE OSTI2022

A nonsmooth nonconvex optimization algorithm for two-stage optimization problems

An optimization algorithm for a group of nonsmooth nonconvex problems inspired by two-stage stochastic programming problems is proposed. The main challenges for these problems include (1) the problems lack the popular lower-type properties such as prox-regularity assumed in many nonsmooth nonconvex optimization algorithms, (2) the objective can not be analytically expressed and (3) the evaluation of function values and subgradients are computationally expensive. To address these challenges, this report first examines the properties that exist in many two-stage problems, specifically upper-C 2 objectives. Then, we show that quadratic penalty method for securityconstrained alternating current optimal power flow (SCACOPF) contingency problems can make the contingency solution functions upper-C 2 . Based on these observations, a simplified bundle algorithm that bears similarity to sequential quadratic programming (SQP) method is proposed. It is more efficient in implementation and computation compared to conventional bundle methods. Global convergence analysis of the algorithm is presented under novel and reasonable assumptions. The proposed algorithm therefore fills the gap of theoretical convergence for smoothed SCACOPF problems. The inconsistency that might arise in our treatment of the constraints are addressed through a penalty algorithm whose convergence analysis is also provided. Finally, theoretical capabilities and numerical performance of the algorithm are demonstrated through numerical examples.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1999

Multi-Parent Clustering Algorithms from Stochastic Grammar Data Models

We introduce a statistical data model and an associated optimization-based clustering algorithm which allows data vectors to belong to zero, one or several "parent" clusters. For each data vector the algorithm makes a discrete decision among these alternatives. Thus, a recursive version of this algorithm would place data clusters in a Directed Acyclic Graph rather than a tree. We test the algorithm with synthetic data generated according to the statistical data model. We also illustrate the algorithm using real data from large-scale gene expression assays.

Mjoisness, Eric↗
DOE OSTI2021

Enhanced mechanical property evaluation using innovative data analytics capability

This report focuses on efforts to improve Multiphysics Object-Oriented Simulation Environ-ment (MOOSE) for mechanical property evaluation using data analytics. These efforts involveimprovements to the stochastic tools module (STM) for stochastic simulations of MOOSE mul-tiphysics model and the development of inverse optimization capabilities. The report gives anoverview of the STM and describes recent updates to its core capabilities and theory on itsreduced-order model (ROM) schemes. Examples are also provided showing the impact of theseupdates and exhibits the usefulness of ROMs. An overview of the gradient based inverse opti-mziation algorithms are given along with examples of their application to source identification.Inverse optimization will provide a new methodology in STM for fitting model parameters toexperimental data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Dynamic Transmission Line Switching Amid Wildfire-Prone Weather Under Decision-Dependent Uncertainty

During dry and windy seasons, environmental conditions significantly increase the risk of wildfires, exposing power grids to disruptions caused by transmission line failures. Wildfire propagation exacerbates grid vulnerability, potentially leading to prolonged power outages. To address this challenge, we propose a multistage optimization model that dynamically adjusts transmission grid topology in response to wildfire propagation, aiming to develop an optimal response policy. By accounting for decision-dependent uncertainty, where line survival probabilities depend on usage, we employ distributionally robust optimization to model uncertainty in line survival distributions. We adapt the stochastic nested decomposition algorithm and derive a deterministic upper bound for its finite convergence. To enhance computational efficiency, we exploit the Lagrangian dual problem structure for a faster generation of Lagrangian cuts. Using realistic data from the California transmission grid, we demonstrate the superior performance of dynamic response policies against two-stage alternatives through a comprehensive case study. In addition, after solving the multistage formulation, we construct easy-to-implement policies that significantly reduce computational burden while maintaining good performance in real-time deployment. History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms and Applications. Funding: This work was supported by the U.S. Department of Energy, Office of Electricity [Grant DE-AC02-05CH11231]. The work of R. Jiang was supported in part by the U.S. National Science Foundation, Division of Electrical, Communications and Cyber Systems [Grant ECCS-1845980] and the U.S. Air Force Office of Scientific Research [Grant FA9550-23-1-0323]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2025.1210 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2025.1210 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Estrada-Garcia, Juan-Alberto↗
DOE OSTI2024

Phenalenyl growth reactions and implications for prenucleation chemistry of aromatics in flames

The energetics and kinetics of phenalene and phenalenyl growth reactions were studied theoretically. Rate constants of phenalene and phenalenyl H-abstraction and C 2 H 2 addition to the formed radicals were evaluated through quantum-chemical and rate-theory calculations. The obtained values, assigned to all π radicals, were tested in deterministic and kinetic Monte Carlo simulations of aromatics growth under conditions of laminar premixed flames. Kekulé and non-Kekulé structures of the polycyclic aromatic hydrocarbons (PAHs) evolving in the stochastic simulations were identified by on-the-fly constrained optimization. The numerical results demonstrated an increased PAH growth and qualitatively reproduced experimental observations of Homann and co-workers of non-decaying PAH concentrations with nearly equal abundances of even and odd carbon-atom PAHs. The analysis revealed that the PAH growth proceeds via alternating and sterically diverse acetylene and methyl HACA additions. Furthermore, the rapid and diverse spreading in the PAH population supports a nucleation model as PAH dimerization, assisted by the non-equilibrium phenomena, forming planar aromatics first and then transitioning to the PAH–PAH stacking with size.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗