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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Stochastic Strategic Participation of Active Distribution Networks With High-Penetration DERs in Wholesale Electricity Markets

With the increasing penetration of distributed energy resources (DERs), traditional distribution networks as load-serving entities in wholesale electricity markets, now evolve towards active distribution networks (ADNs) which can proactively participate in wholesale markets by optimally controlling the DERs in their networks. A stochastic bilevel optimization model is proposed in this paper for the strategic participation of ADNs and DERs to provide energy and grid services in wholesale electricity markets. The bilevel optimization model can capture the interactions between the ADN and the wholesale energy and ancillary service markets, considering the uncertainties of DERs in the ADN. In the upper-level model, the ADN makes optimal decisions on energy and reserve bidding considering the availability, uncertainties, and flexibility of DERs. The joint energy and reserve market-clearing of the independent system operator (ISO) is modeled as the lower-level problem. Using strong duality theory and Karush-Kuhn Tucker (KKT) conditions, the proposed bilevel optimization problem is reformulated as mathematical programming with equilibrium constraints (MPEC) problem and further converted into a computationally-solvable mixed-integer second-order-cone programming (MISOCP) model. The simulation results demonstrate the effectiveness of the model and the interactions between an ADN and wholesale electricity markets.

active distribution network↗
DOE OSTI2025

Robust A-Optimal Experimental Design for Sensor Placement in Bayesian Linear Inverse Problems

Optimal design of experiments for Bayesian inverse problems has recently gained wide popularity and attracted much attention, especially in the computational science and Bayesian inversion communities. An optimal design maximizes a predefined utility function that is formulated in terms of the elements of an inverse problem, an example being optimal sensor placement for parameter identification. The state-of-the-art algorithmic approaches following this simple formulation generally overlook misspecification of the elements of the inverse problem, such as the prior or the measurement uncertainties. This work presents an efficient algorithmic approach for designing optimal experimental design schemes for Bayesian linear inverse problems such that the optimal design is robust to misspecification of elements of the inverse problem. Specifically, we consider a worst-case scenario approach for the uncertain or misspecified parameters, formulate robust objectives, and propose an algorithmic approach for optimizing such objectives. Furthermore, both relaxation and stochastic solution approaches are discussed with detailed analysis and insight into the interpretation of the problem and the proposed algorithmic approach. Extensive numerical experiments to validate and analyze the proposed approach are carried out for sensor placement in a parameter identification problem.

Bayesian inverse problems↗
DOE OSTI2023

Microgrid energy scheduling under uncertain extreme weather: Adaptation from parallelized reinforcement learning agents

Microgrids are useful solutions for integrating renewable energy resources and providing seamless green electricity to minimize carbon footprint. In recent years, extreme weather events happened often worldwide and caused significant economic and societal losses. Such events bring uncertainties to the microgrid energy scheduling problems and increase the challenges of microgrid operation. Traditional optimization approaches suffer from the inaccuracy of the uncertain microgrid model and the unseen events. Existing reinforcement learning (RL) - based approaches are also hampered by the limited generalization and the increasing computational burden when stochastic formulations are required to accommodate the uncertainties. This paper proposes a new parallelized reinforcement learning (PRL) method based on the probabilistic events to handle the microgrid energy uncertainties. Specifically, several local learning agents are employed to interact with pertinent microgrid environments in a distributed manner and report outcomes to the global agent, which will optimize microgrid energy resources online during extreme events. The stochastic microgrid energy optimization problem is reformulated to include all possible scenarios with probabilities. The advantage estimate functions of learning agents are designed with a backward sweep to transfer the outcomes to the value function updating process. Two simulation studies, stochastic optimization and online testing, are performed to compare with several existing RL approaches. Results substantiate that the proposed PRL method can achieve up to 20% optimization performance improvement with 4 and 28 times less computation cost than Q-learning with experience replay and multi-agent Q-learning approaches, respectively.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Unraveling Adsorbate-Induced Structural Evolution of Iron Carbide Nanoparticles

Iron carbide (Fe x C y ) nanoparticles (NPs) are promising candidates for replacing platinum group metals in industrial applications, such as high-temperature Fischer–Tropsch synthesis. However, due to their amorphous nature, characterization of the active sites has been challenging experimentally and computationally. Here, using a combined density functional theory (DFT), neural network interatomic potential-assisted global optimization, and ensemble learning study, we evaluate dynamic surface changes associated with syngas (H and CO) interactions. For this purpose, we have developed a general procedure that we use to model an experimentally relevant 270-atom Fe 182 C 88 NP using the neural network-assisted stochastic surface walk global optimization algorithm (SSW-NN). Once generated, the Fe 182 C 88 NP active sites and particle morphology are thoroughly characterized before the effects of syngas adsorbate interactions are explored by using DFT and molecular dynamics simulations. Lastly, we explore correlations between geometric and electronic features of the active sites and the adsorption of H (H ads ), using a regularized random forest machine learning algorithm. In doing so, we identified the Fe–C coordination number and p orbital occupancy as the most important descriptors affecting H ads . Furthermore, using a combined ML and quantum chemistry approach, our work demonstrates a general and efficient procedure for generating and probing complex surface phenomena on binary nanoparticles.

Adsorption↗
DOE OSTI2023

Improving Deep Neural Networks’ Training for Image Classification With Nonlinear Conjugate Gradient-Style Adaptive Momentum

Momentum is crucial in stochastic gradient-based optimization algorithms for accelerating or improving training deep neural networks (DNNs). In deep learning practice, the momentum is usually weighted by a well-calibrated constant. However, tuning the hyperparameter for momentum can be a significant computational burden. In this article, we propose a novel adaptive momentum for improving DNNs training; this adaptive momentum, with no momentum-related hyperparame- ter required, is motivated by the nonlinear conjugate gradient (NCG) method. Stochastic gradient descent (SGD) with this new adaptive momentum eliminates the need for the momentum hyperparameter calibration, allows using a significantly larger learning rate, accelerates DNN training, and improves the final accuracy and robustness of the trained DNNs. For example, SGD with this adaptive momentum reduces classification errors for training ResNet110 for CIFAR10 and CIFAR100 from 5.25% to 4.64% and 23.75% to 20.03%, respectively. Furthermore, SGD, with the new adaptive momentum, also benefits adversarial training and, hence, improves the adversarial robustness of the trained DNNs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Incorporation of market signals for the optimal design of post combustion carbon capture systems

Recent studies have shown that fossil generators equipped with post-combustion carbon capture (PCC) systems are needed to reduce the cost of deep decarbonization. Such generators need to be flexible and responsive to grid conditions, particularly in a high variable renewable energy (VRE) environment. In this work, we evaluate the net present value (NPV) of retrofitting an existing natural gas combined cycle (NGCC) unit with a flexible PCC system while incorporating market signals from a high VRE grid. We use our industrial partner’s NGCC configuration as representative of existing NGCC units and Svante’s rapid-temperature swing adsorption (TSA) for PCC. Because of its ability to rapidly startup/shutdown and ramp-up/ramp-down, the chosen capture technology is very attractive for load-following operations. For a given set of market signals, we formulate a two-stage stochastic multi-period optimization problem, under the price-taker assumption, to simultaneously optimize the design of the capture system and operation of the entire plant. Rigorous models for the NGCC unit, PCC system, and compression system are developed using commercial process simulators and validated with either plant or vendor data. For computational tractability, we develop surrogate/reduced-order models for use in the optimization problem. The surrogate model for the NGCC plant is constructed by linearizing the rigorous dynamic model at 75% load, while data-driven nonlinear surrogate models for the capture and compression systems are constructed using simulation data from the rigorous models. The optimization problem, formulated as a mixed integer bilinear program, is implemented in the IDAES® integrated platform and solved to global optimality using Gurobi 9.5. Using this formulation, we determine the profitability of retrofitting an existing NGCC unit with the chosen capture system for multiple regions in the U.S. under two scenarios with different carbon prices. Importantly, the results show that the optimal decision strongly depends on the region and on the carbon price, thereby demonstrating the importance of the inclusion of market signals in the design process.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

A game-theoretic approach to nuclear fuel cycle transition analysis under uncertainty

We present a novel methodology for optimizing nuclear fuel cycle transitions that incorporates a game-theoretic approach and captures interactions among multiple decision makers. The methodology is demonstrated using a two-person sequential game with uncertainty, where the two players represent a policy maker and an electric utility company, though the method generalizes to any number and type of individual decision making entities. Coupled with a sophisticated nuclear fuel cycle simulator, rich transition scenarios may be analyzed to identify robust transition strategies. These strategies explicitly treat uncertainties using a stochastic programming approach, devising optimal near-term hedging strategies that simultaneously consider all possible states of the world, maintaining flexibility to allow for intelligent recourse decisions once uncertainties are resolved. In the demonstration game, reactor technology and fuel cycle scheme adopted by the electric utility are shown to depend on both the policy maker’s decisions and the distributions over uncertain technological and economic outcomes.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Optimization using pathwise algorithmic derivatives of electromagnetic shower simulations

Among the well-known methods to approximate derivatives of expectancies computed by Monte-Carlo simulations, averages of pathwise derivatives are often the easiest one to apply. Computing them via algorithmic differentiation typically does not require major manual analysis and rewriting of the code, even for very complex programs like simulations of particle-detector interactions in high-energy physics. However, the pathwise derivative estimator can be biased if there are discontinuities in the program, which may diminish its value for applications. This work integrates algorithmic differentiation into the electromagnetic shower simulation code HepEmShow based on G4HepEm, allowing us to study how well pathwise derivatives approximate derivatives of energy depositions in a sampling calorimeter with respect to parameters of the beam and geometry. We found that when multiple scattering is disabled in the simulation, means of pathwise derivatives converge quickly to their expected values, and these are close to the actual derivatives of the energy deposition. Additionally, we demonstrate the applicability of this novel gradient estimator for stochastic gradient-based optimization in a model example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Optimal control of coupled quantum systems based on the first-order Magnus expansion: Application to multiple dipole-dipole-coupled molecular rotors

This paper presents a method for performing approximate optimal control simulations for quantum systems with multiple coupled degrees of freedom. In this work, the time evolution is simulated using the first-order Magnus expansion in the interaction picture, where the couplings between different degrees of freedom are treated as the perturbation. A numerical implementation procedure is presented that leverages upon pairwise couplings and the separability of the zeroth-order time evolution operator to achieve a reduced computational cost, which is analyzed with respect to the number of degrees of freedom. The formulation is compatible with gradient-free methods to optimize the control field, and a stochastic hill climbing algorithm is adopted for this purpose. As illustrations, optimal control simulations are performed for systems of two and three dipole-dipole-coupled molecular rotors under the influence of a control field. For the two-rotor system, the field is optimized to achieve either orientation or entanglement objectives. For the three-rotor system, the field is optimized either to orient all three rotors in the same direction or to orient one rotor in a particular direction while the other two rotors point in the opposite direction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Stochastic Unit Commitment: Model Reduction via Learning

As weather-dependent renewable generation increases its share in the generation mix of most electric energy systems, a stochastic unit commitment becomes the natural day-ahead scheduling tool. However, such a tool is generally computationally intractable if a detailed uncertainty description is considered. Taking this into account, we proposed a learning method to make the stochastic unit commitment problem tractable. Here, recent advances in statistical learning and machine learning to address optimization problems can be advantageously applied to the rather intractable stochastic unit commitment problem. Considering these advances, we explore simple learning techniques to drastically reduce the size of a stochastic unit commitment problem without significantly altering its optimal solution. The considered stochastic unit commitment problem is formulated as a two-stage stochastic programming problem. The first stage represents commitment decisions, while the second one represents the operation conditions under different scenarios. Taking into account historical solved instances (or proxies for them), we reduce the size (measured by numbers of constraints and variables) of the stochastic unit commitment problem by (i) fixing unchanged binary variables and by (ii) eliminating inactive inequality constraints. Our numerical results show that the reduced problem generally requires significantly less time to solve while obtaining high-quality solutions, which are very close to or indistinguishable from the one obtained by solving the original problem. We use an Illinois 200-bus system to illustrate and characterize the performance of the proposed problem-reduction method.

42 ENGINEERING↗
DOE OSTI2022

Partner with a Third-Party Delivery Service or Not? A Prediction-and-Decision Tool for Restaurants Facing Takeout Demand Surges During a Pandemic

Amidst the COVID-19 pandemic, restaurants become more reliant on no-contact pick-up or delivery ways for serving customers. As a result, they need to make tactical planning decisions such as whether to partner with online platforms, to form their own delivery team, or both. In this paper, we develop an integrated prediction-decision model to analyze the profit of combining the two approaches and to decide the needed number of drivers under stochastic demand. We first use the susceptible-infected-recovered (SIR) model to forecast future infected cases in a given region and then construct an autoregressive-moving-average (ARMA) regression model to predict food-ordering demand. Using predicted demand samples, we formulate a stochastic integer program to optimize food delivery plans. We conduct numerical studies using COVID-19 data and food-ordering demand data collected from local restaurants in Nuevo Leon, Mexico, from April to October 2020, to show results for helping restaurants build contingency plans under rapid market changes. Our method can be used under unexpected demand surges, various infection/vaccination status, and demand patterns. Here, our results show that a restaurant can benefit from partnering with third-party delivery platforms when (i) the subscription fee is low, (ii) customers can flexibly decide whether to order from platforms or from restaurants directly, (iii) customers require more efficient delivery, (iv) average delivery distance is long, or (v) demand variance is high.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A light weight regularization for wave function parameter gradients in quantum Monte Carlo

The parameter derivative of the expectation value of the energy, ∂E/∂p, is a key ingredient in variational Monte Carlo (VMC) wave function optimization methods. In some cases, a naïve estimate of this derivative suffers from an infinite variance, which inhibits the efficiency of optimization methods that rely on a stable estimate of the derivative. In this work, we derive a simple regularization of the naïve estimator, which is trivial to implement in existing VMC codes, has finite variance, and a negligible bias, which can be extrapolated to zero bias with no extra cost. We use this estimator to construct an unbiased, finite variance estimation of ∂E/∂p for a multi-Slater–Jastrow trial wave function on the LiH molecule and in the optimization of a multi-Slater–Jastrow trial wave function on the CuO molecule. This regularized estimator is a simple and efficient estimator of ∂E/∂p for VMC optimization techniques.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Excited states in variational Monte Carlo using a penalty method

Here, in this article, the authors present a technique using variational Monte Carlo to solve for excited states of electronic systems. This technique is based on enforcing orthogonality to lower energy states, which results in a simple variational principle for the excited states. Energy optimization is then used to solve for the excited states. This technique is applied to the well-characterized benzene molecule, in which ~10 000 parameters are optimized for the first 12 excited states. Agreement within ~0.2 eV is obtained with higher scaling coupled cluster methods; small disagreements with experiment are likely due to vibrational effects.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Learning efficient erasure protocols for an underdamped memory

Here we apply evolutionary reinforcement learning to a simulation model to identify efficient time-dependent erasure protocols for a physical realization of a 1-bit memory using an underdamped mechanical cantilever. We show that these protocols, when applied to the cantilever in the laboratory, are considerably more efficient than our best hand-designed protocols. The learned protocols allow reliable high-speed erasure by minimizing the heating of the memory during its operation. More generally, the combination of methods used here opens the door to the rational design of efficient protocols for various physics applications.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2025

Efficient Training of Deep Neural Operator Networks via Randomized Sampling

Neural operators (NOs) employ deep neural networks to learn the mappings between infinitedimensional function spaces. Deep operator network (DeepONet), a popular NO architecture, has demonstrated success in the real-time prediction of complex dynamics across various scientific and engineering applications. In this work, we introduce a random sampling technique to be adopted during the training of DeepONet, aimed at improving the generalization ability of the model, while significantly reducing the computational time. The proposed approach targets the trunk network of the DeepONet model that outputs the basis functions corresponding to the spatiotemporal locations of the bounded domain on which the physical system is defined. While constructing the loss function, DeepONet training traditionally considers a uniform grid of spatiotemporal points at which all the output functions are evaluated for each iteration. This approach leads to a larger batch size, resulting in poor generalization and increased memory demands, due to the limitations of the stochastic gradient descent (SGD) optimizer. The proposed random sampling over the inputs of the trunk net mitigates these challenges, improving generalization and reducing the memory requirements during training, resulting in significant computational gains. We validate our hypothesis through three benchmark examples, demonstrating substantial reductions in training time while achieving comparable or lower overall test errors relative to the traditional training approach. Our results indicate that incorporating randomization in the trunk network inputs during training enhances the efficiency and robustness of DeepONet, offering a promising avenue for improving the framework’s performance in modeling complex physical systems.

Karumuri, Sharmila [Department of Civil & Systems ↗
DOE OSTI2022

Wavefront shaping with a Hadamard basis for scattering soil imaging

Here, soil is a scattering medium that inhibits imaging of plant-microbial-mineral interactions that are essential to plant health and soil carbon sequestration. However, optical imaging in the complex medium of soil has been stymied by the seemingly intractable problems of scattering and contrast. Here, we develop a wavefront shaping method based on adaptive stochastic parallel gradient descent optimization with a Hadamard basis to focus light through soil mineral samples. Our approach allows a sparse representation of the wavefront with reduced dimensionality for the optimization. We further divide the used Hadamard basis set into subsets and optimize a certain subset at once. Simulation and experimental optimization results demonstrate our method has an approximately seven times higher convergence rate and overall better performance compared to that with optimizing all pixels at once. The proposed method can benefit other high-dimensional optimization problems in adaptive optics and wavefront shaping.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Imaging extended single crystal lattice distortion fields with multi-peak Bragg ptychography

Recent advances in phase-retrieval-based x-ray imaging methods have demonstrated the ability to reconstruct 3D distortion vector fields within a nanocrystal by using coherent diffraction information from multiple crystal Bragg reflections. However, these works do not provide a solution to the challenges encountered in imaging lattice distortions in crystals with significant defect content that result in phase wrapping. Moreover, these methods only apply to isolated crystals smaller than the x-ray illumination, and therefore cannot be used for imaging of distortions in extended crystals. We introduce multi-peak Bragg ptychography which addresses both challenges via an optimization framework that combines stochastic gradient descent and phase unwrapping methods for robust image reconstruction of lattice distortions and defects in extended crystals. Our work uses modern automatic differentiation toolsets so that the method is easy to extend to other settings and easy to implement in high-performance computers. This work is particularly timely given the broad interest in using the increased coherent flux in fourth-generation synchrotrons for innovative material research.

36 MATERIALS SCIENCE↗