Measuring and optimizing system reliability: a stochastic programming approach
Not provided.
Operations Research & Management Science↗
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.
Stochastic multi-period optimal dispatch of energy storage in unbalanced distribution feeders
This report presents a convex, multi-period, AC-feasible Optimal Power Flow (OPF) framework that robustly dispatches flexible demand-side resources in unbalanced distribution feeders against uncertainty in very-short timescale solar Photo-Voltaic (PV) forecasts. This is valuable for power systems with significant behind-the-meter solar PV generation as their operation is affected by uncertainty from forecasts of demand and solar PV generation. The aim of this work is then to ensure the feasibility and reliability of distribution system operation under high solar PV penetration. We develop and present a novel, robust OPF formulation that accounts for both the nonlinear power flow constraints and the uncertainty in forecasts. This is achieved by linearizing an optimal trajectory and using first-order methods to systematically tighten voltage bounds. Case studies on a realistic distribution feeder shows the effectiveness of a receding-horizon implementation.
25 ENERGY STORAGE↗
Scalable training of graph convolutional neural networks for fast and accurate predictions of HOMO-LUMO gap in molecules
Abstract Graph Convolutional Neural Network (GCNN) is a popular class of deep learning (DL) models in material science to predict material properties from the graph representation of molecular structures. Training an accurate and comprehensive GCNN surrogate for molecular design requires large-scale graph datasets and is usually a time-consuming process. Recent advances in GPUs and distributed computing open a path to reduce the computational cost for GCNN training effectively. However, efficient utilization of high performance computing (HPC) resources for training requires simultaneously optimizing large-scale data management and scalable stochastic batched optimization techniques. In this work, we focus on building GCNN models on HPC systems to predict material properties of millions of molecules. We use HydraGNN, our in-house library for large-scale GCNN training, leveraging distributed data parallelism in PyTorch. We use ADIOS, a high-performance data management framework for efficient storage and reading of large molecular graph data. We perform parallel training on two open-source large-scale graph datasets to build a GCNN predictor for an important quantum property known as the HOMO-LUMO gap. We measure the scalability, accuracy, and convergence of our approach on two DOE supercomputers: the Summit supercomputer at the Oak Ridge Leadership Computing Facility (OLCF) and the Perlmutter system at the National Energy Research Scientific Computing Center (NERSC). We present our experimental results with HydraGNN showing (i) reduction of data loading time up to 4.2 times compared with a conventional method and (ii) linear scaling performance for training up to 1024 GPUs on both Summit and Perlmutter.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
A large-scale benchmarking of deterministic and stochastic black-box optimization algorithms
The presentation summarizes part of our work on the PrOMMiS project. It describes a systematic benchmarking activity of data-driven optimization algorithms for self-driving laboratories in critical materials manufacturing.
97 MATHEMATICS AND COMPUTING↗
Performant Optimization Strategies for Multifidelity Stochastic Power Grid Models
This talk goes into the algorithmic work done under the Forest project in order to solve expensive power grid models. We explore multiple fidelities of models that balance accuracy and computational expense. We use bundling strategies and progressive hedging in order to parallelize large stochastic programs.
Alfant, Rachael May [Sandia National Laboratories ↗
A large-scale benchmarking of deterministic and stochastic derivative-free optimization algorithms
This presentation summarizes our work in the PrOMMiS project on benchmarking of data-driven optimization algorithms and their applications in self-driving laboratories. This work supports the broader project goal of accelerating the identification of promising separation methods and operating conditions for critical minerals separation processes. We present a systematic benchmarking study of 42 data-driven optimization algorithms on a broad collection of 502 test problems. The results identify BAM, GLCCLUSTER, and MULTIMIN as the most effective optimization solvers, with BAM showing the highest overall performance and solving more than 80% of the benchmark problems. The study also shows that no single solver consistently outperforms the others across all problem types, indicating that our future laboratory applications may benefit from using a small set of strong solvers rather than relying on a single method. The presentation also illustrates an in-silico chemical reactor case study showing that data-driven optimization methods can guide autonomous experimentation in a self-driving laboratory and identify optimal operating conditions within a small number of experiments. Overall, the results provide a basis for selecting efficient optimization methods and demonstrate the practical use of data-driven optimization in self-driving laboratory workflows.
36 MATERIALS SCIENCE↗
Assimilating partial observation to enhance feedback control of stochastic dynamical systems
Here, in this paper, we present a novel methodology to tackle feedback optimal control problems in scenarios where the exact state of the controlled process is unknown. It integrates data assimilation techniques and optimal control solvers to manage partial observation of the state process, a common occurrence in practical scenarios. Traditional stochastic optimal control methods assume full state observation, which is often not feasible in real-world fluid dynamics control problems. Our approach underscores the significance of utilizing observational data to inform control policy design. Specifically, we introduce a kernel learning backward stochastic differential equation (SDE) filter to enhance data assimilation efficiency and propose a sample-wise stochastic optimization method within the stochastic maximum principle framework. We demonstrate the efficacy and accuracy of our method in the control of advection-diffusion-reaction flow problem and the Dubins airplane maneuvering problem with model uncertainty.
data driven↗
A Technical and Economic Assessment of LWR Flexible Operation for Generation and Demand Balancing to Optimize Plant Revenue
With increased penetration of subsidized variable renewable energy (VRE) resources and competition from low natural gas prices, existing light water reactor (LWR) nuclear power plants (NPPs) are struggling to remain economically competitive. This work examines the potential economic competitiveness of various thermal energy storage (TES) technologies when coupled directly or indirectly with a NPP. To highlight their relative economic competitiveness, we contrast several energy storage solutions in stochastic dispatch optimization. We leverage data from recent work analyzing a range of TES technologies with varying capital costs, performance, and technology readiness level (TRL) to establish our case. We explore inserting these technologies into an electricity market with existing nuclear generation and large projected variable renewable energy (VRE) penetration. Although these technologies' projected capital costs may make them unlikely candidates in their current state, this analysis demonstrates a high-fidelity techno-economic analysis of energy storage. Furthermore, as the projected cost of energy storage technologies evolves, this analysis sets a precedent for similar future investigations. One region with projected trends that may be unfavorable for existing nuclear capacity is the New York Independent System Operator (NYISO) market. New York state’s baseload generation has been historically provided by fossil-fired and nuclear assets. However, amid economic pressures from subsidized VREs and low natural gas prices, the state has recently deactivated Indian Point nuclear power plant units 2 and 3. Furthermore, the state plans to meet its zero-emission generation target by 2040 by replacing fossil-fired capacity with significant investments in VRE resources like wind and solar photovoltaic (PV) and battery storage. Increased intermittent resource penetration lowers the baseload power requirement, adding further economic pressure to the state’s three remaining NPPs still in operation. With three NPPs still in operation in New York, this work analyzes potential economic benefits to NPPs on the New York grid when directly or indirectly coupled with various TES technologies. This work requires two modeling steps to analyze the potential economic benefits of various system configurations of the TES directly or indirectly coupled with nuclear. First, this analysis leverages capacity expansion modeling by experts at the Electric Power Research Institute (EPRI). Using their deterministic capacity expansion model, U.S. Regional Economy, Greenhouse Gas, and Energy (US-REGEN), EPRI analysts evaluated the capacity and generation evolution of the New York state energy market under four projection scenarios. These four projection scenarios were developed to represent the potential evolution of the capacity and generation in NYISO from 2015 to 2050 under various economic, technology, and policy constraints. The results from these capacity expansion models are then used as boundary conditions in the second modeling step. The second modeling step uses the Holistic Energy Resource Optimization Network (HERON) for a set of stochastic techno-economic analyses (STEAs) to investigate the potential increase in the economic viability of various configurations of the TES. With no current capacity expansion capabilities, HERON takes the data generated from US-REGEN for 2050 to generate synthetic load, solar, and wind data. Then HERON economically optimizes the capacity and dispatch of the various TES configurations. The potential economic benefit is the differential net present value (NPV) of the TES configurations from the no-TES baseline. As a stochastic techno-economic analysis package, HERON introduces uncertainty into the economic metrics, while US-REGEN trades resolution for reduced computational complexity. Using HERON also allows the modeling of direct thermal coupling, a feature not common in capacity and dispatch models. As expected, with high capital costs, the costs of introducing energy storage for all the technologies considered outweighed the potential economic benefit of this strategy for flexible plant operation. The benefit of this analysis is primarily in demonstrating a workflow that examines innovative solutions to increase NPP revenue via TES coupling. HERON’s stochastic capacity and dispatch optimization process used in this work has proven an effective tool in observing and evaluating the impact of introducing storage technologies in a grid energy system.
25 ENERGY STORAGE↗
Accelerating Optimization and Reinforcement Learning with Quasi Stochastic Approximation
The paper sets out to obtain precise convergence rates for quasi-stochastic approximation (QSA), with applications to optimization and reinforcement learning.
approximation algorithms↗
A Kaczmarz-inspired approach to accelerate the optimization of neural network wavefunctions
Neural network wavefunctions optimized using the variational Monte Carlo method have been shown to produce highly accurate results for the electronic structure of atoms and small molecules, but the high cost of optimizing such wavefunctions prevents their application to larger systems. We propose the Subsampled Projected-Increment Natural Gradient Descent (SPRING) optimizer to reduce this bottleneck. SPRING combines ideas from the recently introduced minimum-step stochastic reconfiguration optimizer (MinSR) and the classical randomized Kaczmarz method for solving linear least-squares problems. We demonstrate that SPRING outperforms both MinSR and the popular Kronecker-Factored Approximate Curvature method (KFAC) across a number of small atoms and molecules, given that the learning rates of all methods are optimally tuned. For example, on the oxygen atom, SPRING attains chemical accuracy after forty thousand training iterations, whereas both MinSR and KFAC fail to do so even after one hundred thousand iterations.
97 MATHEMATICS AND COMPUTING↗
Convergence Analysis of Fixed Point Chance Constrained Optimal Power Flow Problems
For optimal power flow problems with chance constraints, a particularly effective method is based on a fixed point iteration applied to a sequence of deterministic power flow problems. However, a priori, the convergence of such an approach is not necessarily guaranteed. Here this article analyses the convergence conditions for this fixed point approach, and reports numerical experiments including for large IEEE networks.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Surrogate optimization of variational quantum circuits
Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due to the need for optimization in the presence of noise. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal, we look to use modern approaches developed in circuit simulations and stochastic classical optimization, which can be combined to form a surrogate optimization approach to quantum circuits. Using an approximate (classical CPU/GPU) state vector simulator as a surrogate model, we efficiently calculate an approximate Hessian, passed as an input for a quantum processing unit or exact circuit simulator. This method will lend itself well to parallelization across quantum processing units. We demonstrate the capabilities of such an approach with and without sampling noise and a proof-of-principle demonstration on a quantum processing unit utilizing 40 qubits.
Gustafson, Erik J. [RIACS, Mtn. View] (ORCID:00000↗
Quantum Optimization: Potential, Challenges, and the Path Forward
Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of algorithmic approaches, often with little linkage. This is further complicated by the fragmented nature of the field of mathematical optimization, where major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions, have devoted communities. With these aspects in mind, this work draws on multiple approaches to study quantum optimization. Provably exact versus heuristic settings are first explained using computational complexity theory — highlighting where quantum advantage is possible in each context. Then, the core building blocks for quantum optimization algorithms are outlined to subsequently define prominent problem classes and identify key open questions that, if answered, will advance the field. The effects of scaling relevant problems on noisy quantum devices are also outlined in detail, alongside meaningful benchmarking problems. We underscore the importance of benchmarking by proposing clear metrics to conduct appropriate comparisons with classical optimization techniques. Lastly, we highlight two domains – finance and sustainability – as rich sources of optimization problems that could be used to benchmark, and eventually validate, the potential real-world impact of quantum optimization.
97 MATHEMATICS AND COMPUTING↗
Benchmarking Optimizers for Qumode State Preparation with Variational Quantum Algorithms
Quantum state preparation involves preparing a target state from an initial system, a process integral to applications such as quantum machine learning and solving systems of linear equations. Recently, there has been a growing interest in qumodes due to advancements in the field and their potential applications. However there is a notable gap in the literature specifically addressing this area. This paper aims to bridge this gap by providing performance benchmarks of various optimizers used in state preparation with Variational Quantum Algorithms. We conducted extensive testing across multiple scenarios, including different target states, both ideal and sampling simulations, and varying numbers of basis gate layers. Our evaluations offer insights into the complexity of learning each type of target state and demonstrate that some optimizers perform better than others in this context. Notably, the Powell optimizer was found to be exceptionally robust against sampling errors, making it a preferred choice in scenarios prone to such inaccuracies. Additionally, the Simultaneous Perturbation Stochastic Approximation optimizer was distinguished for its efficiency and ability to handle increased parameter dimensionality effectively.
Kan, Shuwen [Fordham University]↗
Soft Actor Critic Based Volt-VAR Co-optimization in Active Distribution Grids
Modern distribution networks are undergoing several technical challenges, such as voltage fluctuations, because of high penetration of distributed energy resources (DERs). This paper proposes a deep reinforcement learning (DRL)-based Volt VAR co-optimization technique for reducing voltage fluctuations as well as power loss under high penetration of DERs. In addition, the proposed approach minimizes the operational cost of the grid. A stochastic policy optimization based soft actor critic (SAC) agent is proposed to configure the optimal set-points of the reactive power outputs of the inverters. The performance of the proposed model is verified on the modified IEEE 34- and 123-bus systems and compared with a base case scenario with no reactive supply by inverters, and a local droop control approach. The results demonstrate that the proposed framework outperforms the conventional droop control method in improving the voltage profile, minimizing the network power loss, and reducing grid operational cost.
—Distribution grids, deep reinforcement learning, ↗
A Regularized Variance-Reduced Modified Extragradient Method for Stochastic Hierarchical Games
We consider an N -player hierarchical game in which the i th player’s objective comprises of an expectation-valued term, parametrized by rival decisions, and a hierarchical term. Such a framework allows for capturing a broad range of stochastic hierarchical optimization problems, Stackelberg equilibrium problems, and leader-follower games. We develop an iteratively regularized and smoothed variance-reduced modified extragradient framework for iteratively approaching hierarchical equilibria in a stochastic setting. We equip our analysis with rate statements, complexity guarantees, and almost-sure convergence results. We then extend these statements to settings where the lower-level problem is solved inexactly and provide the corresponding rate and complexity statements. Our model framework encompasses many game theoretic equilibrium problems studied in the context of power markets. We present a realistic application to the study of virtual power plants, emphasizing the role of hierarchical decision making and regularization. Preliminary numerics suggest that empirical behavior compares well with theoretical guarantees.
Tikhonov regularization↗
NSGA-PINN: A Multi-Objective Optimization Method for Physics-Informed Neural Network Training
This paper presents NSGA-PINN, a multi-objective optimization framework for the effective training of physics-informed neural networks (PINNs). The proposed framework uses the non-dominated sorting genetic algorithm (NSGA-II) to enable traditional stochastic gradient optimization algorithms (e.g., ADAM) to escape local minima effectively. Additionally, the NSGA-II algorithm enables satisfying the initial and boundary conditions encoded into the loss function during physics-informed training precisely. We demonstrate the effectiveness of our framework by applying NSGA-PINN to several ordinary and partial differential equation problems. In particular, we show that the proposed framework can handle challenging inverse problems with noisy data.
Lu, Binghang (ORCID:0009000160016632)↗
Bi-Level Adaptive Storage Expansion Strategy for Microgrids Using Deep Reinforcement Learning
Battery energy storage (BES) is a versatile resource for the secure and economic operation of microgrids (MGs). Prevailing stochastic optimization-based approaches for BES expansion planning for MGs are computationally complicated. This work proposes a data-driven bi-level multi-period BES expansion planning framework to determine the siting, sizing, and timing of BES installations. The proposed planning framework unifies deep reinforcement learning (DRL) and linear programming, thereby decoupling the determinations for the integer and continuous decision variables in two time scales, respectively. In the upper level, a rainbow DRL agent with quantile regression is trained to provide dynamic planning policies to accommodate stochastic renewable energy resources (RESs), load, and battery price changes efficiently. Further, the lower level computes the optimal operation of MGs with frequency constraints to hedge the islanding contingency. The two levels communicate with one another by exchanging storage configuration and operating expenses in order to accomplish the shared goal of minimizing investment and operation costs. Comparative case studies on an MG are carried out to demonstrate the superiority of the proposed DRL-based solution to the mixed-integer linear programming counterpart on efficiency, scalability, and adaptability.
24 POWER TRANSMISSION AND DISTRIBUTION↗