Effectiveness of Warm-Start PPO for Guidance with Highly Constrained Nonlinear Fixed-Wing Dynamics
Explore the source record for details and available documents.
Coletti, Christian↗
SEARCH · Search NASA
Results for “Warm Start”
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.
Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation
In several areas of economics and engineering, it is often necessary to fit discrete data points or approximate nonlinear functions with continuous functions. Piecewise linear (PWL) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables. Moreover, there is a computational benefit in using PWL functions that have the least possible number of segments. This work proposes a novel hierarchical mixed integer linear programming (MILP) formulation that identifies a continuous PWL approximation with minimum number of linear segments for a given target maximum error. The proposed MILP formulation also identifies the solution with the least maximum error among the solutions with minimum number of segments. Then, this work proposes a fast iterative algorithm that identifies non necessarily continuous PWL approximations by solving O(S log N) linear programming (LP) problems, where N is the number of data points and S is the minimum number of segments in the non necessarily continuous case. This work demonstrates that tight bounds for the MILP problem can be derived from these approximations. Next, a fast algorithm is introduced to transform a non necessarily continuous PWL approximation into a continuous one. Finally, the tight bounds and the continuous PWL approximations are used to tighten and warm start the MILP problem. The tightened formulation is shown in experimental results to be more efficient, especially for large data sets, with a solution time that is up to two orders of magnitude less than the existing literature.
97 MATHEMATICS AND COMPUTING↗
Realistic operation of two residential cordwood-fired outdoor hydronic heater appliances—Part 3: Optical properties of black and brown carbon emissions
Residential biomass combustion is a source of carbonaceous aerosol. Inefficient combustion, particularly of solid fuels produces large quantities of black and brown carbon (BC and BrC). These particle types are important as they have noted effects on climate forcing and human health. One method of measuring these quantities is by measurement of aerosol light-absorption and scattering, which can be performed using an aethalometer and nephelometer, respectively. These instruments are widely deployed in the study of ambient air and are frequently used in air quality modeling and source apportionment studies. In this study, we will describe (1) a method for measuring primary BC and BrC emissions from two residential log-fired wood hydronic heaters and (2) the BC and BrC emission from these devices over a wide range of operating conditions, such as cold-starts, warm-starts, four different levels of output ranging from 15% to 100% maximum rated output, and periods of repeated cycling. The range in flue-gas BC concentrations, measured using an aethalometer at the 880 nanometer (nm) wavelength, were between 5.09 × 10 2 and 2.24 × 10 4 micrograms per cubic meter (µg/m 3 ) while the scattering coefficient of the flue-gas, measured by a nephelometer at 880 nm, ranged between 2.20 × 10 3 and 8.56 × 10 5 inverse megameters (Mm –1 ). The BrC concentrations, measured using the 370 nm wavelength of an aethalometer, were between 9.10 × 10 1 and 3.56 × 10 4 µg/m 3 . The calculated Angstrom Absorption Exponent (AAE) of the flue-gas aerosol ranged between 1.54 and 3.63. Performing a comparison between the measured BC concentration and an external particulate matter (PM) concentration showed that overall BC makes up roughly a quarter of the PM emitted by either of the two appliances. Further for both appliances, the cold-start and the test phase immediately following it had the highest BC and BrC concentrations, the highest measured scattering coefficient, as well as a low AAE.
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
Structure-aware Initialization via Numerical Continuation and Informed Priors
Scientific machine learning (SciML) often operates in ill-conditioned, weakly identifiable regimes due to limited data or indirect observations. In such settings, optimization and inference are highly sensitive to the starting point, making initialization--often under-reported--a consequential degree of freedom. Random initialization is not a neutral default as it induces an implicit prior over candidate solutions and can systematically bias the result, producing large run-to-run variability. Here, we formalize this view by treating initialization as a hidden confounder in SciML and develop a unifying theory for structure-aware initialization via numerical continuation, constructing warm starts from related problem instances. Across representative tasks, including physics-informed neural networks, maximum likelihood estimation, and variational inference, warm starts have been shown to consistently reduce optimization effort and improve reliability.
Data integrity↗
A fast two-stage algorithm for non-negative matrix factorization in smoothly varying data
This article reports the study of algorithms for non-negative matrix factorization (NMF) in various applications involving smoothly varying data such as time or temperature series diffraction data on a dense grid of points. Utilizing the continual nature of the data, a fast two-stage algorithm is developed for highly efficient and accurate NMF. In the first stage, an alternating non-negative least-squares framework is used in combination with the active set method with a warm-start strategy for the solution of subproblems. In the second stage, an interior point method is adopted to accelerate the local convergence. The convergence of the proposed algorithm is proved. The new algorithm is compared with some existing algorithms in benchmark tests using both real-world data and synthetic data. Furthermore, the results demonstrate the advantage of the algorithm in finding high-precision solutions.
interior point method↗
Stochastic Approximation for Multi-period Simulation Optimization with Streaming Input Data
We consider a continuous-valued simulation optimization (SO) problem, where a simulator is built to optimize an expected performance measure of a real-world system while parameters of the simulator are estimated from streaming data collected periodically from the system. At each period, a new batch of data is combined with the cumulative data and the parameters are re-estimated with higher precision. The system requires the decision variable to be selected in all periods. Therefore, it is sensible for the decision-maker to update the decision variable at each period by solving a more precise SO problem with the updated parameter estimate to reduce the performance loss with respect to the target system. We define this decision-making process as the multi-period SO problem and introduce a multi-period stochastic approximation (SA) framework that generates a sequence of solutions. Two algorithms are proposed: Re-start SA (ReSA) reinitializes the stepsize sequence in each period, whereas Warm-start SA (WaSA) carefully tunes the stepsizes, taking both fewer and shorter gradient-descent steps in later periods as parameter estimates become increasingly more precise. We show that under suitable strong convexity and regularity conditions, ReSA and WaSA achieve the best possible convergence rate in expected sub-optimality either when an unbiased or a simultaneous perturbation gradient estimator is employed, while WaSA accrues significantly lower computational cost as the number of periods increases. In addition, we present the regularized ReSA, which obviates the need to know the strong convexity constant and achieves the same convergence rate at the expense of additional computation.
Computer Science↗
Combined Cycle Integrated Thermal Energy Storage “CiTES” (Final Scientific/Technical Report)
The Phase I of this project confirmed the technical feasibility of a Combined Cycle integrated Thermal Energy Storage “CiTES” system, calculated the key performance parameters like power efficiency and costs, and proved its commercial value with full-year simulations for several US electricity markets with high degree of variable renewable generation and volatile hourly electricity prices. The core element of this project is the Electro Thermal Energy Storage (ETES) technology from Siemens Gamesa Renewable Energy GmbH, using thermally stable and inexpensive volcanic rocks as storage material and air as heat transfer medium. This technology is backed by more than 10 years of experience and a 440MMBTU (130MWh-th) pilot plant in Hamburg, Germany, which is in operation since 2019. The integration of this thermal storage in an existing combined cycle power plant (CCPP) is typical power plant technology without any major technology risks. It allows the storage of inexpensive renewable energy during times of surplus renewable generation and the discharge of this energy in times of high energy demand when the fossil plant is in operation. This supplements the fossil power generation with CO2-emission-free energy. The secondary effect of the CiTES system is that a small part of the stored thermal energy is used to keep the heat recovery steam generator (HRSG) and steam turbine (ST) of the combined cycle power plant in hot and ready-to-start condition. This enables the plant to start rapidly when fossil generation is required to satisfy demand as soon variable generation drops off in the evenings or during cloud cover and calm wind periods. Without pre-warming of the HRSG and ST, the CCPP would need several hours for a cold or warm start, burn a lot of gas and release high NOx emissions during start and wouldn’t be able to use the short times of high energy prices in an efficient or economical manner. The economic parameters of CiTES were determined by a full year “8760” simulation using a data set calculation for each of the hours of the year, and historical electricity and gas prices. For consistency, the simulations were focused on the pre-COVID year 2019. The financially most attractive markets were in the Energy Reliability Council of Texas (ERCOT) region, which allowed substantial value generation with arbitrage (charge with cheap energy during renewable surplus times and discharge when energy is needed and expensive). The improvement of flexibility with the CiTES system by pre-heating and warm-keeping of the CCPP allowed for additional power generation during short time periods when demand is high but renewable generation is down; when the hourly energy prices are highest in these markets. The simulations are based on 2019 data, when ERCOT had 27GW of installed photovoltaic (PV) and wind generation. They showed that the created revenue with the prototypically sized CiTES system of 1,000MMBTU (300MWh-th) falls a little bit short of what is expected from a commercially viable investment. The system has optimization opportunities for cost reduction and increased effectiveness which will be realized during a potential Phase II Pre-FEED study following this project. Furthermore, it is safe to assume that a lot of renewable generation capacity will be added all over the US in the coming years. As an example, ERCOT is predicting to more than double its renewable generation from 27GW in 2019 to a forecasted 63GW in 2023. This will increase the amount of renewable overproduction exponentially. This rapid increase of local overproduction and the need to curtail renewable generation is well documented by the California ISO (www.CAISO.com / managing oversupply). However, the simulations also revealed a weakness in the structure of the electricity markets in the US. More specifically, when electricity prices are very low and approaching negative levels, the owners of Variable Renewable Energy (VRE) will curtail a part of their facility to stabilize the price by reducing supply. This results in a situation in which storage facilities, which are integrated in existing fossil assets and don’t have the behind-the-meter benefit of a VRE, won’t be able to purchase low cost – otherwise curtailed – renewable energy off the grid. A special tariff, which motivates VRE owners to sell otherwise curtailed renewable energy to storage facilities (Hydrogen, thermal, pumped hydro, etc.) can solve this issue. The implementation of such a regulating tariff by Independent System Operators, thus avoiding renewable curtailment, is a pre condition for successful commercialization for renewable energy storage technologies. With this advancement of design and technology and improvements in the market environment, it can be expected that the Combined Cycle integrated Thermal Energy Storage proves itself as an important innovation to keep highly efficient, natural gas-based power generation economically successful and relevant for the power industry in the United States of America.
Wolf, Thorsten↗
Efficient learning of power grid voltage control strategies via model-based deep reinforcement learning
Here this article proposes a model-based deep reinforcement learning (DRL) method to design emergency control strategies for short-term voltage stability problems in power systems. Recent advances show promising results for model-free DRL-based methods in power systems control problems. But in power systems applications, these model-free methods have certain issues related to training time (clock time) and sample efficiency; both are critical for making state-of-the-art DRL algorithms practically applicable. DRL-agent learns an optimal policy via a trial-and-error method while interacting with the real-world environment. It is also desirable to minimize the direct interaction of the DRL agent with the real-world power grid due to its safety-critical nature. Additionally, the state-of-the-art DRL-based policies are mostly trained using a physics-based grid simulator where dynamic simulation is computationally intensive, lowering the training efficiency. We propose a novel model-based DRL framework where a deep neural network (DNN)-based dynamic surrogate model (SM), instead of a real-world power grid or physics-based simulation, is utilized within the policy learning framework, making the process faster and more sample efficient. However, having stable training in model-based DRL is challenging because of the complex system dynamics of large-scale power systems. We addressed these issues by incorporating imitation learning to have a warm start in policy learning, reward-shaping, and multi-step loss in surrogate model training. Finally, we achieved 97.5% reduction in samples and 87.7% reduction in training time for an application to the IEEE 300-bus test system.
24 POWER TRANSMISSION AND DISTRIBUTION↗
A phase transition for finding needles in nonlinear haystacks with LASSO artificial neural networks
To fit sparse linear associations, a LASSO sparsity inducing penalty with a single hyperparameter provably allows to recover the important features (needles) with high probability in certain regimes even if the sample size is smaller than the dimension of the input vector (haystack). More recently learners known as artificial neural networks (ANN) have shown great successes in many machine learning tasks, in particular fitting nonlinear associations. Small learning rate, stochastic gradient descent algorithm and large training set help to cope with the explosion in the number of parameters present in deep neural networks. Yet few ANN learners have been developed and studied to find needles in nonlinear haystacks. Driven by a single hyperparameter, our ANN learner, like for sparse linear associations, exhibits a phase transition in the probability of retrieving the needles, which we do not observe with other ANN learners. To select our penalty parameter, we generalize the universal threshold of Donoho and Johnstone (Biometrika 81(3):425–455, 1994) which is a better rule than the conservative (too many false detections) and expensive cross-validation. In the spirit of simulated annealing, we propose a warm-start sparsity inducing algorithm to solve the high-dimensional, non-convex and non-differentiable optimization problem. We perform simulated and real data Monte Carlo experiments to quantify the effectiveness of our approach.
97 MATHEMATICS AND COMPUTING↗
Artificial intelligence driven laser parameter search: Inverse design of photonic surfaces using greedy surrogate-based optimization
Photonic surfaces designed with specific optical characteristics are becoming increasingly crucial for novel energy harvesting and storage systems. The design of these surfaces can be achieved by texturing materials using lasers. The optimal adjustment of laser fabrication parameters to achieve target surface optical properties is an open challenge. Thus, we develop a surrogate-based optimization approach. Our framework employs the Random Forest algorithm to model the forward relationship between the laser fabrication parameters and the resulting optical characteristics. During the optimization process, we use a greedy, prediction-based exploration strategy that iteratively selects batches of laser parameters to be used in experimentation by minimizing the predicted discrepancy between the surrogate model’s outputs and the user-defined target optical characteristics. This strategy allows for efficient identification of optimal fabrication parameters without the need to model the error landscape directly. We demonstrate the efficiency and effectiveness of our approach on two synthetic benchmarks and two specific experimental applications of photonic surface inverse design targets. By calculating the average performance of our algorithm compared to other state of the art optimization methods, we show that our algorithm performs, on average, twice as well across all benchmarks. Additionally, a warm starting inverse design technique for changed target optical characteristics enhances the performance of the introduced approach.
97 MATHEMATICS AND COMPUTING↗
Robust scalable initialization for Bayesian variational inference with multi-modal Laplace approximations
Predictive modeling typically relies on Bayesian model calibration to provide uncertainty quantification. Variational inference utilizing fully independent (“mean-field”) Gaussian distributions are often used as approximate probability density functions. This simplification is attractive since the number of variational parameters grows only linearly with the number of unknown model parameters. However, the resulting diagonal covariance structure and unimodal behavior can be too restrictive to provide useful approximations of intractable Bayesian posteriors that exhibit highly non-Gaussian behavior, including multimodality. High-fidelity surrogate posteriors for these problems can be obtained by considering the family of Gaussian mixtures. Gaussian mixtures are capable of capturing multiple modes and approximating any distribution to an arbitrary degree of accuracy, while maintaining some analytical tractability. Unfortunately, variational inference using Gaussian mixtures with full-covariance structures suffers from a quadratic growth in variational parameters with the number of model parameters. The existence of multiple local minima due to strong nonconvex trends in the loss functions often associated with variational inference present additional complications, These challenges motivate the need for robust initialization procedures to improve the performance and computational scalability of variational inference with mixture models. In this work, we propose a method for constructing an initial Gaussian mixture model approximation that can be used to warm-start the iterative solvers for variational inference. The procedure begins with a global optimization stage in model parameter space. In this step, local gradient-based optimization, globalized through multistart, is used to determine a set of local maxima, which we take to approximate the mixture component centers. Around each mode, a local Gaussian approximation is constructed via the Laplace approximation. Finally, the mixture weights are determined through constrained least squares regression. The robustness and scalability of the proposed methodology is demonstrated through application to an ensemble of synthetic tests using high-dimensional, multimodal probability density functions. Here, the practical aspects of the approach are demonstrated with inversion problems in structural dynamics.
97 MATHEMATICS AND COMPUTING↗
Comparing quantum annealing and spiking neuromorphic computing for sampling binary sparse coding QUBO problems
We consider the problem of computing a sparse binary representation of an image. Given an image and an overcomplete, non-orthonormal basis, we aim to find a sparse binary vector indicating the minimal set of basis vectors that when added together best reconstruct the given input. We formulate this problem with an L 2 loss on the reconstruction error, and an L 0 loss on the binary vector enforcing sparsity. First, we solve the sparse representation QUBOs by solving them both on a D-Wave quantum annealer with Pegasus chip connectivity, as well as on the Intel Loihi 2 spiking neuromorphic processor using a stochastic Non-equilibrium Boltzmann Machine (NEBM). Second, using Quantum Evolution Monte Carlo with Reverse Annealing and iterated warm starting on Loihi 2 to evolve the solution quality from the respective machines. We demonstrate that both quantum annealing and neuromorphic computing are suitable for solving binary sparse coding QUBOs.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Enhancing Distribution System Resilience: A First-Order Meta-RL Algorithm for Critical Load Restoration
The increasing frequency of extreme events and the integration of distributed energy resources (DERs) into modern grids have elevated the need for resilient and efficient critical load restoration strategies in distribution systems. However, the stochastic nature of renewable DERs, limited energy resource availability and the intricate nonlinearities inherent in complex grid control problem make the problem challenging. Although reinforcement learning (RL) and warm-start RL methods have shown promising results, their performance often falls short in rapidly adapting to new, unseen situations and typically requires exhaustive problem-specific tuning. To address these gaps, we propose a First-Order Meta-based RL (FOM-RL) algorithm within an online framework for adaptive and robust critical load restoration. By harnessing local DERs as the enabling technology, FOM-RL allows the RL agent to swiftly adapt to new unseen scenarios by leveraging previously acquired knowledge of different tasks. Experimental results provide evidence that proposed algorithm learns more efficiently and showcases generalization capabilities across diverse set of operational scenarios. Moreover, a rigorous theoretical analysis yields a tight sublinear regret bound, sensitive to temporal variability, with a task-averaged optimality gap bounded by O(VM+D*/(Tsquare root(M))). These results suggest that optimality improves with task similarity and an increased number of tasks M, reaffirming the efficacy and scalability of the proposed approach in addressing the complexities of critical load restoration in distribution systems.
complexity theory↗
matsim-agents v1.0
matsim-agents is a multi-agent AI framework for atomistic materials simulation and discovery. It orchestrates large language models (LLMs), machine-learned interatomic potentials (MLIPs), and DFT codes into a single agentic loop running on laptops and DOE leadership-class supercomputers. MULTI-AGENT ORCHESTRATION A LangGraph state machine with three nodes: a Planner that converts a natural-language research objective into structured tasks; an Executor that dispatches atomistic tools and loops until the queue is empty; and an Analyst that summarizes results into a human-readable report. State is checkpointed after every step and human-in-the-loop gates can be inserted at any edge. HYPOTHESIS-DRIVEN DISCOVERY CHAT An interactive REPL (matsim-agents chat) that couples LLM dialogue with atomistic simulation. Chemical formulas are automatically detected in conversation turns and trigger a full crystal-phase exploration: structure generation → relaxation → stability scoring → result injection back into the conversation, creating a closed hypothesis-refinement loop. CRYSTAL PHASE ENUMERATION Given a composition, the phase explorer enumerates prototypes by stoichiometry: elemental (fcc/bcc/hcp/sc/diamond), binary 1:1 (rocksalt/CsCl/zincblende/ wurtzite/fluorite/rutile), ternary 1:1:3 (cubic perovskite), ternary 1:2:4 (perovskite + spinel), quaternary 1:1:2:6 (Fm-3m double perovskite). 2-D prototypes (graphene, h-BN, MoS2 2H/1T) and multilayer stacking are also supported via --include-2d and --num-layers. SUPERCELL GENERATION AND SITE DECORATION Auto-tiling to a minimum atom count (--min-atoms), explicit NxNxN tiling (--supercell), symmetry-distinct site decorations (--n-orderings), and isotropic lattice-scale sweeps (--lattice-scales) for volume bracketing. MLFF RELAXATION AND STABILITY SCORING HydraGNN (multi-headed GNN) drives structure relaxation via ASE with FIRE, BFGS, or BFGSLineSearch. Stability output: delta-E/atom ranking across phases and a max-residual-force dynamical-stability proxy. Other MLIPs (MACE, NequIP, Orb) can be plugged in through the same interface. DFT BACKENDS Quantum ESPRESSO pw.x and VASP 6.6 are first-class labellers. Both have validated GPU builds and SLURM/PBS launchers for three DOE platforms: Frontier (AMD MI250X, ROCm), Aurora (Intel PVC, oneAPI), Perlmutter (NVIDIA A100, CUDA). QE produces ~100 binaries (pw.x, ph.x, epw.x, ...). VASP supports scf, relax, vc-relax, and vc-relax-shape run types. ACTIVE-LEARNING LOOP matsim-agents al run CONFIG.yaml drives an iterative HydraGNN-DFT loop: MD generates candidates → ensemble/MC-dropout uncertainty selects the most informative → DFT labels them in parallel inside one allocation → dataset grows → HydraGNN retrains → repeat. DFT backend is a single YAML toggle (dft.backend: vasp | qe). LLM-generated seed structures are supported (no curated POSCAR library needed). Config uses ${VAR}, ${VAR:-default}, ${VAR:?msg} shell-style substitution for cross-user/cross-site portability. LLM BACKENDS Ollama (local, default), vLLM (HPC multi-GPU serving), OpenAI, Anthropic, HuggingFace Transformers+Accelerate. Selected at runtime via flag or env var with no code changes. HPC PORTABILITY Same Python entry points run on Frontier (ROCm 7.2), Aurora (oneAPI), and Perlmutter (CUDA 12). DFT and ML stacks are never co-loaded in the same shell; they couple through the scheduler and filesystem. Advanced multi-node launchers (serve, discovery-chat, single-relaxation, active-learning, QE warm-start) are provided for all three platforms. CODABENCH COMPETITION BUNDLE A self-contained benchmark: 159 atomistic test structures across 11 material classes, 5 tasks (formation energy, forces, ML relaxation, AI-DFT relaxation, phase stability ranking), public/private leaderboard split (30/70), and four ready-to-run baselines: MACE-MP-0, HydraGNN, UMA, AllScAIP.
Lupo Pasini, Massimiliano [Oak Ridge National Labo↗
A Surrogate-Based Asynchronous Decomposition Technique for Realistic Security-Constrained Optimal Power Flow Problems
Here we present a decomposition approach for obtaining good feasible solutions for the security-constrained, alternating-current, optimal power flow (SC-AC-OPF) problem at an industrial scale and under real-world time and computational limits. The approach was designed while preparing and participating in ARPA-E’s Grid Optimization Competition (GOC) Challenge 1. The challenge focused on a near-real-time version of the SC-AC-OPF problem, where a base operating point is optimized, taking into account possible single-element contingencies, after which the system adapts its operating point following the response of automatic frequency droop controllers and voltage regulators. Our solution approach for this problem relies on state-of-the-art nonlinear programming algorithms, and it employs nonconvex relaxations for complementarity constraints, a specialized two-stage decomposition technique with sparse approximations of recourse terms and contingency ranking and prescreening. The paper describes and justifies our approach and outlines the features of its implementation, including functions and derivatives evaluation, warm-starting strategies, and asynchronous parallelism. We discuss the results of the independent benchmark of our approach by ARPA-E’s GOC team in Challenge 1, where it was found to consistently produce high-quality solutions across a wide range of network sizes and difficulty, and conclude by outlining future extensions of the approach.
97 MATHEMATICS AND COMPUTING↗
Distributed Quantum-Enhanced Optimization: A Topographical Preconditioning Approach for High-Dimensional Search
Optimization problems become fundamentally challenging as the number of variables increases. Because the volume of the search space grows exponentially, classical algorithms frequently fail to locate the global minimum of non-convex functions. While quantum optimization offers a potential alternative, mapping continuous problems onto near-term quantum hardware introduces severe scaling limits and barren plateaus. To bridge this gap, we propose the Distributed Quantum-Enhanced Optimization (D-QEO) framework. Instead of forcing the quantum processor to find the exact minimum, we use it simply as a topographical preconditioner. The QPU maps the landscape to locate the most promising basin of attraction, generating high-quality seed points for a classical GPU-accelerated solver to refine. To make this approach viable for utility-scale problems, we exploit the mathematical structure of separable functions. This allows us to cut a 50-qubit (i.e., $2^{50}$) global search space into independent and manageable sub-spaces using 5-qubit subcircuits. By executing these fragments concurrently with CUDA-Q, we completely bypass the overhead of cross-register entanglement and classical tensor knitting for separable functions. Benchmarks on the 10-dimensional Rastrigin and Ackley functions show that D-QEO prevents the exponential failure rates observed in purely classical algorithms. Furthermore, this quantum warm-start significantly reduces the number of classical BFGS iterations required to converge, providing a highly practical blueprint for utilizing near-term quantum resources in complex global search.
Soos, Dominik [Old Dominion U.]↗
Surrogates for Valve-Controlled Pipe Flow: Accelerating Nuclear Reactor Design
Neural surrogate models are developed to replace expensive steady-state RANS CFD simulations for valve-controlled pipe flow in nuclear reactor design. Using parametric CFD data generated with MOOSE Pronghorn across a range of valve geometry and flow conditions, three approaches are compared: a POD-based reduced-order model, a structured UNet on a cylindrical grid, and unstructured models (DeepONet and BiStride MeshGraphNet) on nondimensionalized point clouds. POD achieves the highest accuracy (99%) with fast inference but requires storing all solution snapshots, while the DeepONet and BSMS-GNN both achieve ~89% accuracy at sub-second inference, with the BSMS-GNN offering superior geometric generalizability. These surrogates enable rapid ranking of candidate valve designs and can warm-start CFD solvers to accelerate convergence, supporting agentic design iteration on the Prometheus platform.
42 - ENGINEERING↗
Improving Unit Flexibility Utilizing Plasma Ignitors
Coal fired steam generation operators face increasing market challenges, including competition from low cost generation, renewables, and regulatory pressure. These market conditions are forcing utilities to operate their coal assets in a more flexible mode, including more frequent starts and stops, faster ramp rates, frequent cycling, and extended operation at the lowest possible loads. Without upgrades to firing and control systems, pressure parts, and auxiliary systems, CAPEX and OPEX costs will increase significantly. Typically, expensive support fuels (Oil or Gas) are required to maintain safe, stable coal ignition when operating below 25% to 35% MCR (Maximum Continuous Rating). The exact minimum load without support fuel differs depending upon unit design specifications and fuel being burned. Frequent starts also increase the use of support fuels. The firing and burner control systems must be designed to allow for proper operation over the unit’s load range, ensuring that all mechanical components operate properly, and proper control of air and fuel streams can be maintained. To address the need for frequent starts and the need for stable low load operation on coal fired steam generators, this paper discusses options available, including, Firing Systems upgrades, Digital solutions, and pressure part upgrades. Several case studies are included that highlight options available allowing units to stay in operation and reduce CAPEX and OPEX costs.
01 COAL, LIGNITE, AND PEAT↗