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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Development of Multiresolution Capabilities for the Holistic Energy Resource Optimization Network (HERON) tool A progress update

INL researchers work on technoeconomic analyses for integrated energy systems (IES) using the Framework for Optimization of ResourCes and Economics (FORCE). Within FORCE, researchers use the Holistic Energy Resource Optimization Network (HERON) tool to conduct optimization of grid portfolios under uncertain market conditions. These optimizations determine optimal capacities for all IES components and strategies for resource dispatch which maximize some economic metric (e.g., net present value). Resource dispatch occurs on finer timescales (typically hours) and thus are asked to respond to a given time series (e.g. hourly load demand profiles for a grid, or pre-determined electricity prices). Volatile and complex bidding dynamics as well as poorly forecasted weather events within deregulated markets add uncertainty to the time series; FORCE can address this uncertainty by training a reduced order model on historical time series and generate unique synthetic time series which represent individual scenarios or realizations of the market. The IES configuration can be simulated under these different sampled realizations and a stochastic optimization is conducted which optimizes the expected value of the desired economic metric. The training of a synthetic time series generator is limited by the chosen time resolution; dynamics can occur on different time scales. Seasonal demand trends can dominate faster dynamical events (such as power outages from certain sectors or severe weather events) which might not get captured correctly by the trained model. In this report, we investigate different ways of addressing the training and generation of time series on multiple time scales using three main algorithms: wavelet decomposition, dynamic mode decomposition, and generative adversarial networks for time series. We demonstrate a time series analysis that yields information on not just the frequency space but also temporal space: where a fast Fourier transform can provide what frequencies dominate, the new algorithms can provide when the frequencies dominate as well. These analyses can help improve IES optimization by allowing researchers to couple simulations at different timescales when it is most needed - seasonal, day-ahead, and real time optimization - with greater computational efficiency. Future work will include implementation of a subset of the proposed algorithms into the FORCE toolset and application of these analyses into multiple timescale optimization.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Synthetic Electricity Market Data Generation and HERON Use Case Setup of Advanced Nuclear Reactors Coupled with Thermal Energy Storage Systems

This study evaluates and optimizes advanced nuclear reactors coupled with thermal energy storage (TES) systems in an Integrated Energy System (IES) architecture to enable advanced nuclear power plants (A NPP) to participate in multi-commodity markets, thus enhancing their economic competitiveness. Nuclear-TES coupling scenarios studied herein are designed attenuate the nuclear heat dynamics and defer energy delivery to a later time, enabling the nuclear reactor to continue operating at or near steady-state design conditions as usual while also enabling flexible generation. Three A-NPPs, namely, an advanced light-water reactor (A LWR), a high temperature gas-cooled reactor (HTGR) and a liquid-metal fast reactor (LMFR) were selected as the initial use cases for demonstrating the technoeconomic of thermally balanced energy storage coupling design for thermal power extraction. Each of the reactor technologies were evaluated in two different electricity markets. Stochastic optimization approach was adopted which included the evaluation of price signals from the Pennsylvania-New Jersey-Maryland (PJM) market, and Electric Reliability Council of Texas (ERCOT), using an autoregressive moving average (ARMA) model. Risk Analysis Virtual Environment (RAVEN) tool and its dispatch optimization plugin, the Holistic Energy Resource Optimization Network (HERON), were used to perform dispatch and capacity optimization, using the price data provided by the ARMA models. The results from the Nuclear-TES use cases will be used to design and characterize dynamic integrated system behavior and feedback.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2016

Optimal Control for Stochastic Delay Evolution Equations

In this paper, we investigate a class of infinite-dimensional optimal control problems, where the state equation is given by a stochastic delay evolution equation with random coefficients, and the corresponding adjoint equation is given by an anticipated backward stochastic evolution equation. We first prove the continuous dependence theorems for stochastic delay evolution equations and anticipated backward stochastic evolution equations, and show the existence and uniqueness of solutions to anticipated backward stochastic evolution equations. Then we establish necessary and sufficient conditions for optimality of the control problem in the form of Pontryagin’s maximum principles. To illustrate the theoretical results, we apply stochastic maximum principles to study two examples, an infinite-dimensional linear-quadratic control problem with delay and an optimal control of a Dirichlet problem for a stochastic partial differential equation with delay. Further applications of the two examples to a Cauchy problem for a controlled linear stochastic partial differential equation and an optimal harvesting problem are also considered.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Optimizing Microgrid Energy Delivery Under High Uncertainty

One of the largest transitions in the power system today is the shift to a more sustainable and resilient power system. This is being driven by public opinion, changes in regulatory policies, and advancements in smart grid technologies. The most noticeable changes taking place is the integration of distributed energy sources (DERs); this study uses the term DER in the most general way as a resource that can be manipulated to alter energy delivery and flow in the transmission and distribution networks. Also, here it is preferred to focus on energy as the true need while power is a function of the equipment rating. As such, wind and solar, demand that can be manipulated, electric vehicles, electric energy storage, thermal storage, and storage in water system are all considered DERs. These additions to the distribution system are evolving the operation of distribution feeders into microgrids- communication, computing, and control-enabled resources that produce, transport, and utilize energy in a manner that provides cost, reliability, and resilience benefits. As this evolution progresses, the planning and operational management (scheduling and control) must explicitly include the consideration of risk. The management of system risk is currently in the purview of the utility and will likely remain so in the future. However, as each microgrid, as well as federation of microgrids, sees autonomy in order to provide maximum benefits to their constituents, they must assume responsibility to manage their internal risk. The primary scope of this study is the scheduling of resources in a distribution feeder(s) operating as microgrids. The study explores a distribution algorithm to develop the transactive schedule for the DERs, to minimize cost and risk over a time horizon, and an initial laboratory-scale to conduct implementation on distributed hardware. Results from case studies are presented that show that solutions derived by the distributed algorithm are valid. This study also discusses the continuing work on the expansion of: 1) the distributed algorithm from a deterministic to stochastic optimization formulation, and 2) implementation of the distributed algorithm into real-time simulation within the Power System laboratory at New Mexico State University (NMSU) and expanding to the Southwest Technology Development Institute located at NMSU where actual solar, energy storage, and demand response resources are installed.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

A scalable planning framework of energy storage systems under frequency dynamics constraints

As the penetration of renewables increases in power systems, the declining system inertia can cause frequency stability issues. Battery energy storage systems (BESSs) respond fast and therefore can relieve the low inertia difficulty but need to be appropriately sized considering the associated cost. This paper presents a novel stochastic optimization model for economically planning BESS capacity while considering the spatial–temporal correlation of wind generation and generator outages under frequency stability constraints, which include the rate-of-change of frequency (RoCoF), frequency nadir (FN), and quasi-steady-state (QSS) frequency. A set of new FN constraints that can be easily linearized is developed. To account for renewable uncertainties, a realistic uncertainty modeling approach, Random Field, is adopted to generate wind generation scenarios by considering both spatial and temporal evolutions of wind speed profiles. The ESS sizing is formulated as a mixed-integer linear programming problem and solved by using a scalable decomposition-and-coordination approach, Surrogate Absolute Value Lagrangian Relaxation (SAVLR). To further improve the scalability and reduce computational burdens, a rolling-horizon-based update is developed and incorporated into SAVLR for providing a practical solution to the long-term planning of very large-scale power systems. Finally, a modified IEEE 118-bus system and the Polish system are used to validate the effectiveness and scalability of the model and solution methodology.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2017

Evaluation of a Machine-Learning Algorithm for Treatment Planning in Prostate Low-Dose-Rate Brachytherapy

Purpose: This work presents the application of a machine learning (ML) algorithm to automatically generate high-quality, prostate low-dose-rate (LDR) brachytherapy treatment plans. The ML algorithm can mimic characteristics of preoperative treatment plans deemed clinically acceptable by brachytherapists. The planning efficiency, dosimetry, and quality (as assessed by experts) of preoperative plans generated with an ML planning approach was retrospectively evaluated in this study. Methods and Materials: Preimplantation and postimplantation treatment plans were extracted from 100 high-quality LDR treatments and stored within a training database. The ML training algorithm matches similar features from a new LDR case to those within the training database to rapidly obtain an initial seed distribution; plans were then further fine-tuned using stochastic optimization. Preimplantation treatment plans generated by the ML algorithm were compared with brachytherapist (BT) treatment plans in terms of planning time (Wilcoxon rank sum, α = 0.05) and dosimetry (1-way analysis of variance, α = 0.05). Qualitative preimplantation plan quality was evaluated by expert LDR radiation oncologists using a Likert scale questionnaire. Results: The average planning time for the ML approach was 0.84 ± 0.57 minutes, compared with 17.88 ± 8.76 minutes for the expert planner (P=.020). Preimplantation plans were dosimetrically equivalent to the BT plans; the average prostate V150% was 4% lower for ML plans (P=.002), although the difference was not clinically significant. Respondents ranked the ML-generated plans as equivalent to expert BT treatment plans in terms of target coverage, normal tissue avoidance, implant confidence, and the need for plan modifications. Respondents had difficulty differentiating between plans generated by a human or those generated by the ML algorithm. Conclusions: Prostate LDR preimplantation treatment plans that have equivalent quality to plans created by brachytherapists can be rapidly generated using ML. The adoption of ML in the brachytherapy workflow is expected to improve LDR treatment plan uniformity while reducing planning time and resources.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2026

Near-Optimal Performance of Stochastic Model Predictive Control

Here, this article presents a regret analysis for stochastic model predictive control (SMPC) in linear systems with quadratic performance index and additive and multiplicative uncertainties. Under a finite support assumption, the problem can be cast as a finite-dimensional quadratic program, but the problem becomes quickly intractable as the problem size grows exponentially in the horizon length. SMPC aims to compute approximate solutions by solving a sequence of problems with truncated prediction horizons and committing the solution in a receding-horizon fashion. Although this approach is widely used in practice, its performance relative to the optimal solution is not well understood. This article reports for the first time a rigorous near-optimal performance guarantee of SMPC: under stabilizability and detectability conditions, the regret of SMPC is exponentially small in the prediction horizon length, allowing SMPC to achieve near-optimal performance at a substantially reduced computational expense.

93E20, 93B45↗
DOE OSTI2012

Subsolutions That Are Close in the Uniform Norm Are Close in the Sobolev Norm as Well

A new type weighted reverse Poincare inequality is established for a difference of two continuous weak subsolutions of a linear second order uniformly elliptic partial differential equation in the ball.This result is the key to deriving the error estimate for the gradient of the analytically unknown value function of the optimal stochastic control problem from the uniform error of the value function itself in the related numerical approximation problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A primal–dual algorithm for risk minimization

In this paper, we develop an algorithm to efficiently solve risk-averse optimization problems posed in reflexive Banach space. Such problems often arise in many practical applications as, e.g., optimization problems constrained by partial differential equations with uncertain inputs. Unfortunately, for many popular risk models including the coherent risk measures, the resulting risk-averse objective function is nonsmooth. Here, this lack of differentiability complicates the numerical approximation of the objective function as well as the numerical solution of the optimization problem. To address these challenges, we propose a primal–dual algorithm for solving large-scale nonsmooth risk-averse optimization problems. This algorithm is motivated by the classical method of multipliers and by epigraphical regularization of risk measures. As a result, the algorithm solves a sequence of smooth optimization problems using derivative-based methods. We prove convergence of the algorithm even when the subproblems are solved inexactly and conclude with numerical examples demonstrating the efficiency of our method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Approximate Bayesian Model Inversion for PDEs with Heterogeneous and State-Dependent Coefficients

We present two approximate Bayesian inference methods for parameter estimation in partial differential equation (PDE) models with space-dependent and state-dependent parameters. We demonstrate that these methods provide accurate and cost-effective alternatives to Markov Chain Monte Carlo simulation. We assume a parameterized Gaussian prior on the unknown functions, and approximate the posterior density by a parameterized multivariate Gaussian density. The parameters of the prior and posterior are estimated from sparse observations of the PDE model's states and the unknown functions themselves by maximizing the evidence lower bound (ELBO), a lower bound on the log marginal likelihood of the observations. The first method, Laplace-EM, employs the expectation maximization algorithm to maximize the ELBO, with a Laplace approximation of the posterior on the E-step, and minimization of a Kullback-Leibler divergence on the M-step. The second method, DSVI-EB, employs the doubly stochastic variational inference (DSVI) algorithm, in which the ELBO is maximized via gradient-based stochastic optimization, with nosiy gradients computed via simple Monte Carlo sampling and Gaussian backpropagation. We apply these methods to identifying diffusion coefficients in linear and nonlinear diffusion equations, and we find that both methods provide accurate estimates of posterior densities and the hyperparameters of Gaussian priors. While the Laplace-EM method is more accurate, it requires computing Hessians of the physics model. The DSVI-EB method is found to be less accurate but only requires gradients of the physics model.

approximate Bayesian inference, model inversion, v↗
DOE OSTI2017

Solving geosteering inverse problems by stochastic Hybrid Monte Carlo method

The inverse problems arise in almost all fields of science where the real-world parameters are extracted from a set of measured data. The geosteering inversion plays an essential role in the accurate prediction of oncoming strata as well as a reliable guidance to adjust the borehole position on the fly to reach one or more geological targets. This mathematical treatment is not easy to solve, which requires finding an optimum solution among a large solution space, especially when the problem is non-linear and non-convex. Nowadays, a new generation of logging-while-drilling (LWD) tools has emerged on the market. The so-called azimuthal resistivity LWD tools have azimuthal sensitivity and a large depth of investigation. Hence, the associated inverse problems become much more difficult since the earth model to be inverted will have more detailed structures. The conventional deterministic methods are incapable to solve such a complicated inverse problem, where they suffer from the local minimum trap. Alternatively, stochastic optimizations are in general better at finding global optimal solutions and handling uncertainty quantification. In this article, we investigate the Hybrid Monte Carlo (HMC) based statistical inversion approach and suggest that HMC based inference is more efficient in dealing with the increased complexity and uncertainty faced by the geosteering problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A review on the integration of probabilistic solar forecasting in power systems

As one of the fastest growing renewable energy sources, the integration of solar power poses great challenges to power systems due to its variable and uncertain nature. As an effective approach to promote the integration of solar power in power systems, the value of probabilistic forecasts is being increasingly recognized in the recent decade. While the current use of probabilistic forecasts in power systems is limited, enormous amount of research has been conducted to promote the adoption of probabilistic forecasts and many methods have been proposed. This paper gives a comprehensive review on how probabilistic solar forecasts are utilized in power systems to address the challenges. Potential methods to deal with uncertainties in power systems are summarized, such as probabilistic load flow models, stochastic optimization, robust optimization, and chance constraints. Additionally, specific areas where these methods can be applied are discussed and state-of-the-art studies are summarized.

14 SOLAR ENERGY↗
DOE OSTI2014

Breathing dynamics based parameter sensitivity analysis of hetero-polymeric DNA

We study the parameter sensitivity of hetero-polymeric DNA within the purview of DNA breathing dynamics. The degree of correlation between the mean bubble size and the model parameters is estimated for this purpose for three different DNA sequences. The analysis leads us to a better understanding of the sequence dependent nature of the breathing dynamics of hetero-polymeric DNA. Out of the 14 model parameters for DNA stability in the statistical Poland-Scheraga approach, the hydrogen bond interaction ε{sub hb}(AT) for an AT base pair and the ring factor ξ turn out to be the most sensitive parameters. In addition, the stacking interaction ε{sub st}(TA-TA) for an TA-TA nearest neighbor pair of base-pairs is found to be the most sensitive one among all stacking interactions. Moreover, we also establish that the nature of stacking interaction has a deciding effect on the DNA breathing dynamics, not the number of times a particular stacking interaction appears in a sequence. We show that the sensitivity analysis can be used as an effective measure to guide a stochastic optimization technique to find the kinetic rate constants related to the dynamics as opposed to the case where the rate constants are measured using the conventional unbiased way of optimization.

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

Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures

Here, we investigate how to port the standard interior-point method to new exascale architectures for block-structured nonlinear programs with state equations. Computationally, we decompose the interior-point algorithm into two successive operations: the evaluation of the derivatives and the solution of the associated Karush-Kuhn-Tucker (KKT) linear system. Our method accelerates both operations using two levels of parallelism. First, we distribute the computations on multiple processes using coarse parallelism. Second, each process uses SIMD/GPU accelerators locally to accelerate the operations using fine-grained parallelism. The KKT system is reduced by eliminating the inequalities and the state variables from the corresponding equations. We demonstrate our method's capability on the supercomputer Polaris, a testbed for the future exascale Aurora system. Each node is equipped with four GPUs, a setup amenable to our two-level approach. Our experiments on the stochastic optimal power flow problem show that the reduction method is 50x faster than the sparse linear solver HSL MA57 running in serial on the CPU, and 6x faster than Pardiso running in parallel on CPU on the same number of processes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Thermal transport properties of MoS 2 and MoSe 2 monolayers

Isolation of single to few layer transition metal dichalgogenides open alternate venues in application of 2 dimensional materials to nanoelectronics. Either for general overheating issues or specific application in thermoelectric devices, the characterization of the thermal transport in these new low dimensional materials is needed for their efficient implementation. In this study, lattice thermal conductivities of single layer MoS 2 and MoSe 2 are evaluated using classical molecular dynamics method. The interactions between atoms are defined by Stillinger-Weber type empirical potentials that are developed to represent structural, mechanical, and vibrational properties of the given materials. In parameterization of the potentials, a stochastic optimization algorithm, namely particle swarm optimization is utilized. The final parameter sets produce quite consistent results with DFT in terms of lattice parameters, bond distances, elastic constants and vibrational properties of both single layer MoS 2 and MoSe 2 . The predicted thermal properties of both materials are in very good agreement with earlier first principles calculations. The discrepancies between calculations and experimental measurements are most likely to be caused by pristine nature of the structures in our simulations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

On unifying randomized methods for inverse problems

This work unifies the analysis of various randomized methods for solving linear and nonlinear inverse problems with Gaussian priors by framing the problem in a stochastic optimization setting. By doing so, we show that many randomized methods are variants of a sample average approximation (SAA). More importantly, we are able to prove a single theoretical result that guarantees the asymptotic convergence for a variety of randomized methods. Additionally, viewing randomized methods as an SAA enables us to prove, for the first time, a single non-asymptotic error result that holds for randomized methods under consideration. Another important consequence of our unified framework is that it allows us to discover new randomization methods. Here, we present various numerical results for linear, nonlinear, algebraic, and PDE-constrained inverse problems that verify the theoretical convergence results and provide a discussion on the apparently different convergence rates and the behavior for various randomized methods.

42 ENGINEERING↗
DOE OSTI2025

Exact block encoding of imaginary time evolution with universal quantum neural networks

We develop a constructive approach to generate quantum neural networks capable of representing the exact thermal states of all many-body qubit Hamiltonians. The Trotter expansion of the imaginary time propagator is implemented through an exact block encoding by means of a unitary, restricted Boltzmann machine architecture. Marginalization over the hidden-layer neurons (auxiliary qubits) creates the nonunitary action on the visible layer. Then, we introduce a unitary deep Boltzmann machine architecture in which the hidden-layer qubits are allowed to couple laterally to other hidden qubits. We prove that this wave-function is closed under the action of the imaginary time propagator and, more generally, can represent the action of a universal set of quantum gate operations. We provide analytic expressions for the coefficients for both architectures, thus enabling exact network representations of thermal states without stochastic optimization of the network parameters. In the limit of large imaginary time, the yields the ground state of the system. The number of qubits grows linearly with the number of interactions and total imaginary time for a fixed interaction order. Both networks can be readily implemented on quantum hardware via midcircuit measurements of auxiliary qubits. If only one auxiliary qubit is measured and reset, the circuit depth scales linearly with imaginary time and number of interactions, while the width is constant. Alternatively, one can employ a number of auxiliary qubits linearly proportional to the number of interactions, and circuit depth grows linearly with imaginary time only. Every midcircuit measurement has a postselection success probability, and the overall success probability is equal to the product of the probabilities of the midcircuit measurements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Q-Learning-Based Approach for Distributed Beam Scheduling in mmWave Networks

We consider the problem of distributed downlink beam scheduling and power allocation for millimeter-Wave (mmWave) cellular networks where multiple base stations (BSs) belonging to different service operators share the same unlicensed spectrum with no centralized control or explicit coordination among them. Our goal is to design efficient distributed beam scheduling and power allocation schemes such that the network-level payoff, defined as the weighted sum of the total throughput and a power penalization term, can be maximized. To this end, we propose a distributed scheduling approach to power allocation and adaptation for efficient interference management over the shared spectrum by modeling each BS as an independent Q-learning agent. As a baseline, we compare the proposed approach to the state-of-the-art non-cooperative game-based approach which was previously developed for the same problem. We conduct extensive experiments under various scenarios to verify the effect of multiple factors on the performance of both approaches. Experiment results show that the proposed approach adapts well to different interference conditions by learning from experience and thus can achieve higher payoff than the game-based approach. The proposed approach can also be integrated into our previously developed Lyapunov stochastic optimization framework for the purpose of network utility maximization with optimality guarantee. As a result, the weights in the payoff function can be automatically and optimally determined by the virtual queue values from the sub-problems derived from the Lyapunov optimization framework.

99 GENERAL AND MISCELLANEOUS↗