Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic optimization”

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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Acquire and Test IDAES Framework Components

The cooperation under the Grid Modernization Initiative and the Applied Energy Tri-Laboratory umbrellas requires mutual understanding of capabilities and a common effort to identify gaps existing in the available computational modeling and analysis tools. In this work, we report acquisition and testing of the National Energy Technology Laboratory’s Institute for the Design of Advanced Energy Systems (IDAES) framework, particularly including both electric power systems production cost model simulator Prescient as well as system optimization IDAES itself. Further, we consider the methods in which developments in Prescient and IDAES for grid-energy simulation and optimization may be included in the Framework for Optimization of ResourCes and Economics (FORCE) ecosystem that has been under collaborative development by Idaho National Laboratory, Argonne National Laboratory, and Oak Ridge National Laboratory. We propose two integration methods to introduce Prescient and IDAES into existing FORCE automated workflows. One integration involves using Prescient as a market reduced-order model and IDAES models similar to how existing Modelica models are used. The other integration involves wrapping the Prescient-IDAES dispatch optimization process with the stochastic capacity optimization workflow in FORCE.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2016

Stochastic derivative-free optimization using a trust region framework

This study presents a trust region algorithm to minimize a function f when one has access only to noise-corrupted function values f¯. The model-based algorithm dynamically adjusts its step length, taking larger steps when the model and function agree and smaller steps when the model is less accurate. The method does not require the user to specify a fixed pattern of points used to build local models and does not repeatedly sample points. If f is sufficiently smooth and the noise is independent and identically distributed with mean zero and finite variance, we prove that our algorithm produces iterates such that the corresponding function gradients converge in probability to zero. As a result, we present a prototype of our algorithm that, while simplistic in its management of previously evaluated points, solves benchmark problems in fewer function evaluations than do existing stochastic approximation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

maestro

MÆSTRO stands for Multi-fidelity Adaptive Ensemble Stochastic Trust Region Optimization and it is a plug n play derivate fee stochastic optimization solver. The problem being considered in MÆSTRO involves fitting Monte Carlo simulations that describe complex phenomena to experiments. This is done by finding parameters of the resource intensive and noisy simulation that yield the least squares objective function value to the noisy experimental data. This problem is solved using a stochastic trust-region optimization algorithm where in each iteration, a local approximation of the simulation signal and of the simulation noise is constructed over data, which is obtained by running the simulation at strategically placed design points within the trust-region around the current iterate. Then the simulation components of the objective are replaced by their approximations and this analytical and closed-form optimization problem is solved to find the next iterate within the trust-region. Then the trust region is moved and the iterations continue until a satisfactory convergence criteria is met.

KRISHNAMOORTHY, MOHAN↗
DOE OSTI2023

Stochastic gradient descent for optimization for nuclear systems

The use of gradient descent methods for optimizing k-eigenvalue nuclear systems has been shown to be useful in the past, but the use of k-eigenvalue gradients have proved computationally challenging due to their stochastic nature. ADAM is a gradient descent method that accounts for gradients with a stochastic nature. This analysis uses challenge problems constructed to verify if ADAM is a suitable tool to optimize k-eigenvalue nuclear systems. ADAM is able to successfully optimize nuclear systems using the gradients of k-eigenvalue problems despite their stochastic nature and uncertainty. Furthermore, it is clearly demonstrated that low-compute time, high-variance estimates of the gradient lead to better performance in the optimization challenge problems tested here.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2015

Constant-complexity stochastic simulation algorithm with optimal binning

At the molecular level, biochemical processes are governed by random interactions between reactant molecules, and the dynamics of such systems are inherently stochastic. When the copy numbers of reactants are large, a deterministic description is adequate, but when they are small, such systems are often modeled as continuous-time Markov jump processes that can be described by the chemical master equation. Gillespie’s Stochastic Simulation Algorithm (SSA) generates exact trajectories of these systems, but the amount of computational work required for each step of the original SSA is proportional to the number of reaction channels, leading to computational complexity that scales linearly with the problem size. The original SSA is therefore inefficient for large problems, which has prompted the development of several alternative formulations with improved scaling properties. We describe an exact SSA that uses a table data structure with event time binning to achieve constant computational complexity with respect to the number of reaction channels for weakly coupled reaction networks. We present a novel adaptive binning strategy and discuss optimal algorithm parameters. We compare the computational efficiency of the algorithm to existing methods and demonstrate excellent scaling for large problems. This method is well suited for generating exact trajectories of large weakly coupled models, including those that can be described by the reaction-diffusion master equation that arises from spatially discretized reaction-diffusion processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2015

Optimization of a dry, mixed nuclear fuel storage array for nuclear criticality safety - 14339

A dry storage array of used nuclear fuel at the Idaho National Laboratory contains a mixture of more than twenty different types of research and test reactor fuels. Significant neutronic interaction occurs between fuel canisters within this large storage arrangement of 636 fuel storage canisters. Nuclear criticality safety is maintained primarily by moderation control and through control of neutron interaction and leakage provided by the credited geometry. Over the nearly forty years of operation the collected fuels are now arranged in a configuration that does not minimize the system neutron multiplication factor (k{sub eff}). This creates a concern since the entire remaining facility storage capacity cannot be utilized without exceeding the system minimum subcritical state (k{sub safe}) for ensuring nuclear criticality safety. This work determines a more optimal arrangement for the stored fuels with a goal to minimize the system k{sub eff}, but also with a minimum of potential fuel canister relocation movements. The ultimate goal is to establish a solution for this multiple-objective optimization problem by finding the Pareto Front for maximum k{sub eff} reduction versus the number of canister relocations. The process first required additional analysis of the array by Monte-Carlo neutron transport codes (specifically, MCNP) to gain a greater understanding of the interaction characteristics of the disparate fuel types. Some stored fuels are composed of primarily metallic and oxide components that provide very little inherent moderation, while other fuel types contain graphite or zirconium-hydride which can contribute a significant amount of moderation. These factors cause a complex relationship within a fuel arrangement with respect to thermal utilization and axial leakage probability. The new MCNP analysis was utilized to develop a simplified spreadsheet-based empirical model which simulates the array k{sub eff} result. This empirical model was benchmarked against additional MCNP calculations for various arrangements and then employed in the optimization analysis. A Tabu metaheuristic and stochastic approximation optimization was applied to the empirical model with the optimization function to minimize the array k{sub eff}. The optimization algorithm interrogated the empirical model to determine the optimal rearrangement for up to sixty canister movements. The Pareto Front was found, which shows that a limited number of canister relocation movements could allow the existing thirty-one empty array positions to be filled with common research reactor fuels while also yielding a reduction in the overall array k{sub eff} relative to the current arrangement. This will impart an improvement in the facility utilization while also offering an enhancement in the safety margin. The reduction in array reactivity has been confirmed by a final set of MCNP calculations with the proposed new arrangements. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2023

Robust Parameter Design on Dual Stochastic Response Models With Constrained Bayesian Optimization

In engineering system design, minimizing the variations of the quality measurements while guaranteeing their overall quality up to certain levels, namely the robust parameter design (RPD), is crucial. Recent works have dealt with the design of a system whose response-control variables relationship is a deterministic function with a complex shape and function evaluation is expensive. In this work, we propose a Bayesian optimization method for the RPD of stochastic functions. Dual stochastic response models are carefully designed for stochastic functions. The heterogeneous variance of the sample mean is addressed by the predictive mean of the log variance surrogate model in a two-step approach. We establish an acquisition function that favors exploration across the feasible and optimality-improvable regions to effectively and efficiently solve the stochastic constrained optimization problem. Further, the performance of our proposed method is demonstrated by the extensive numerical and case studies. Note to Practitioners-Many manufacturing processes involve undesirable variations, which create variations in the final products. For example, many emerging manufacturing processes, such as nanomanufacturing, involve complex physical and chemical dynamics and transformation, creating variations in the manufacturing output. In such processes, it is crucial to design the manufacturing processes or products so that they have minimum variations in their quality. Meanwhile, it is also important to maintain the overall quality of the designed processes or products. Furthermore, acquiring data from many advanced manufacturing processes is often very costly, especially in the designing stage. In this work, we propose a data-driven method that automatically finds the best setting of manufacturing processes or products with the minimum variations of quality and a given constraint on the average quality satisfied. Our proposed method is used before conducting every experiment; It analyzes the historical data from previous experiments and provides a setting to be used in the next experiment. Our proposed method efficiently utilizes the historical data, and thus finds the best robust setting by conducting only a small number of experiments.

42 ENGINEERING↗
DOE OSTI2023

Optimized attenuated interaction: Enabling stochastic Bethe–Salpeter spectra for large systems

We develop an improved stochastic formalism for the Bethe–Salpeter equation (BSE), based on an exact separation of the effective-interaction W into two parts, W = (W – vW) + vW, where the latter is formally any translationally invariant interaction, vW(r – r'). When optimizing the fit of the exchange kernel vW to W, using a stochastic sampling W, the difference W – vW becomes quite small. Then, in the main BSE routine, this small difference is stochastically sampled. Furthermore, the number of stochastic samples needed for an accurate spectrum is then largely independent of system size. While the method is formally cubic in scaling, the scaling prefactor is small due to the constant number of stochastic orbitals needed for sampling W.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Incorporate day-ahead robustness and real-time incentives for electricity market design

In this paper, we propose a two-stage electricity market framework to explore the participation of distributed energy resources (DERs) in a day-ahead (DA) market and a real-time (RT) market. The objective is to determine the optimal bidding strategies of the aggregated DERs in the DA market and generate online incentive signals for DER-owners to optimize the social-welfare taking into account network operational constraints. Distributionally robust optimization is used to explicitly incorporate data-based statistical information of renewable forecasts into the supply/demand decisions in the DA market. We evaluate the conservativeness of bidding strategies distinguished by different risk aversion settings. In the RT market, a bi-level time-varying optimization problem is proposed to design the online incentive signals to tradeoff the RT imbalance penalty for distribution system operators (DSOs) and the costs of individual DER-owners. This enables tracking their optimal dispatch to provide fast balancing services, in the presence of time-varying network states while satisfying the voltage regulation requirement. Simulation results on both DA wholesale market and RT balancing market demonstrate the necessity of this two-stage design, and its robustness to uncertainties, the performance of convergence, the tracking ability and the feasibility of the resulting network operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Multistage economic MPC for systems with a cyclic steady state: A gas network case study

Multistage model predictive control (MPC) provides a robust control strategy for dynamic systems with uncertainties and a setpoint tracking objective. Moreover, extending MPC to minimize an economic cost instead of tracking a pre-calculated optimal setpoint improves controller performance. This paper presents a novel multistage economic nonlinear model predictive control (E-NMPC) framework for dynamic systems operating under uncertainty, with specific application to natural gas transmission networks. A key innovation lies in the integration of cyclic steady-state (CSS) constraints within the multistage MPC formulation, enabling the controller to manage periodic operating conditions commonly observed in energy systems. A Lyapunov-based descent condition is enforced to ensure robust stability of the controller. The multistage economic MPC framework is validated on two gas pipeline case studies, where it successfully minimizes net energy consumption, respects operational constraints under uncertain demand profiles, and guides the network to optimal cyclic operation. The Lyapunov function remains bounded in both case studies, validating the robust stability of multistage E-NMPC.

03 NATURAL GAS↗
DOE OSTI2017

Stochastic Models for an Optimal Blending of Biomass under Cost, Quality and Uncertainty Considerations

Blending biomass materials of different physical or chemical properties provides an opportunity to passively adjust the quality of the feedstock to meet the specifications of the conversion platform. We propose a model which identifies the right mix of biomass to optimize the performance of the Thermochemical conversion process at the minimum cost. This is a chance-constraint programming (CCP) model which takes into account the stochastic nature of biomass availability and quality. The proposed CCP model takes as inputs the physical and chemical properties, and biomass availability. We use the sample average approximation (SAA) method to solve the problem. We develop a case study for South Carolina by using data provided by the Billion Ton Study. We conduct extensive numerical analysis to evaluate the quality of the solutions obtained.

09 BIOMASS FUELS↗
DOE OSTI2024

Stochastic Trust-Region Algorithm in Random Subspaces with Convergence and Expected Complexity Analyses

Here, this work proposes a framework for large-scale stochastic derivative-free optimization (DFO) by introducing STARS, a trust-region method based on iterative minimization in random subspaces. This framework is both an algorithmic and theoretical extension of a random subspace derivative-free optimization (RSDFO) framework, and an algorithm for stochastic optimization with random models (STORM). Moreover, like RSDFO, STARS achieves scalability by minimizing interpolation models that approximate the objective in low-dimensional affine subspaces, thus significantly reducing per-iteration costs in terms of function evaluations and yielding strong performance on largescale stochastic DFO problems. The user-determined dimension of these subspaces, when the latter are defined, for example, by the columns of so-called Johnson-Lindenstrauss transforms, turns out to be independent of the dimension of the problem. For convergence purposes, inspired by the analyses of RSDFO and STORM, both a particular quality of the subspace and the accuracies of random function estimates and models are required to hold with sufficiently high, but fixed, probabilities. Using martingale theory under the latter assumptions, an almost sure global convergence of STARS to a first-order stationary point is shown, and the expected number of iterations required to reach a desired first-order accuracy is proved to be similar to that of STORM and other stochastic DFO algorithms, up to constants.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Stochastic Look-Ahead Commitment: A Case Study in MISO

This paper introduces the Stochastic Look Ahead Commitment (SLAC) software prototyped and tested for the Midcontinent Independent System Operator (MISO) look ahead commitment process. SLAC can incorporate hundreds of wind, load, and net scheduled interchange (NSI) uncertainty scenarios. It uses a progressive hedging method to solve a novel two-stage stochastic unit commitment. The first stage commitment decisions, made only for those generators whose decision to commit or not in each time period cannot be deferred, can cover the uncertainties within the next three hours. The second stage includes both the dispatch for each of the scenarios and the commitment decisions that can be deferred. Study results on 15 MISO production days show that SLAC may bring economic and reliability benefits under uncertainty.

MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Optimal white-noise stochastic forcing for linear models of turbulent channel flow

In the present study an optimisation problem is formulated to determine the forcing of an eddy-viscosity-based linearised Navier–Stokes model in channel flow at $Re_\tau \approx 5200$ ( $Re_\tau$ is the friction Reynolds number), where the forcing is white-in-time and spatially decorrelated. The objective functional is prescribed such that the forcing drives a response to best match a set of velocity spectra from direct numerical simulation (DNS), as well as remaining sufficiently smooth. Strong quantitative agreement is obtained between the velocity spectra from the linear model with optimal forcing and from DNS, but only qualitative agreement between the Reynolds shear stress co-spectra from the model and DNS. The forcing spectra exhibit a level of self-similarity, associated with the primary peak in the velocity spectra, but they also reveal a non-negligible amount of energy spent in phenomenologically mimicking the non-self-similar part of the velocity spectra associated with energy cascade. By exploiting linearity, the effect of the individual forcing components is assessed and the contributions from the Orr mechanism and the lift-up effect are also identified. Finally, the effect of the strength of the eddy viscosity on the optimisation performance is investigated. The inclusion of the eddy viscosity diffusion operator is shown to be essential in modelling of the near-wall features, while still allowing the forcing of the self-similar primary peak. In particular, reducing the strength of the eddy viscosity results in a considerable increase in the near-wall forcing of wall-parallel components.

Mechanics↗