Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization methods”

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 541 records · Page 30

Stability analysis of the Eulerian–Lagrangian finite volume methods for nonlinear hyperbolic equations in one space dimension

In this paper, we construct a novel Eulerian–Lagrangian finite volume (ELFV) method for nonlinear scalar hyperbolic equations in one space dimension. It is well known that the exact solutions to such problems may contain shocks though the initial conditions are smooth, and direct numerical methods may suffer from restricted time step sizes. To relieve the restriction, we propose an ELFV method, where the space-time domain was separated by the partition lines originated from the cell interfaces whose slopes are obtained following the Rakine–Hugoniot junmp condition. Unfortunately, to avoid the intersection of the partition lines, the time step sizes are still limited. To fix this gap, we detect effective troubled cells (ETCs) and carefully design the influence region of each ETC, within which the partitioned space-time regions are merged together to form a new one. Then with the new partition of the space-time domain, we theoretically prove that the proposed first-order scheme with Euler forward time discretization is total-variation-diminishing and maximum-principle-preserving with at least twice larger time step constraints than the classical first order Eulerian method for Burgers’ equation. Numerical experiments verify the optimality of the designed time step sizes.

97 MATHEMATICS AND COMPUTING↗

Accessible, uniform protein property prediction with a scikit-learn based toolset AIDE

Summary Protein property prediction via machine learning with and without labeled data is becoming increasingly powerful, yet methods are disparate and capabilities vary widely over applications. The software presented here, “Artificial Intelligence Driven protein Estimation (AIDE)”, enables instantiating, optimizing, and testing many zero-shot and supervised property prediction methods for variants and variable length homologs in a single, reproducible notebook or script by defining a modular, standardized application programming interface (API), i.e. drop-in compatible with scikit-learn transformers and pipelines. Availability and implementation AIDE is an installable, importable python package inheriting from scikit-learn classes and API and is installable on Windows, Mac, and Linux. Many of the wrapped models internal to AIDE will be effectively inaccessible without a GPU, and some assume CUDA. The newest stable, tested version can be found at https://github.com/beckham-lab/aide_predict and a full user guide and API reference can be found at https://beckham-lab.github.io/aide_predict/. Static versions of both at the time of writing can be found on Zenodo.

36 MATERIALS SCIENCE↗

Ion-chain sympathetic cooling and gate dynamics

Sympathetic cooling is a technique often employed to mitigate motional heating in trapped-ion quantum computers. However, choosing system parameters such as number of coolants and cooling duty cycle for optimal gate performance requires evaluating trade-offs between motional errors and other slower errors such as qubit dephasing. The optimal parameters depend on cooling power, heating rate, and ion spacing in a particular system. In this study, we aim to analyze best practices for sympathetic cooling of long chains of trapped ions using analytical and computational methods. We use a case study to show that optimal cooling performance is achieved when coolants are placed at the center of the chain and provide a perturbative upper bound on the cooling limit of a mode given a particular set of cooling parameters. In addition, using computational tools, we analyze the trade-off between the number of coolant ions in a chain and the center-of-mass mode heating rate. We also show that cooling as often as possible when running a circuit is optimal when the qubit coherence time is otherwise long. These results provide a roadmap for how to choose sympathetic cooling parameters to maximize circuit performance in trapped-ion quantum computers using long chains of ions.

Cooling & trapping↗

Machine Learning Enabled Position Detection for 6.78 MHz UAV Wireless Power Transfer System

This paper presents a novel supervised machine learning (SML) approach for accurate position detection of the receiver coil in wireless power transfer (WPT) systems using only secondary-side electrical measurements, with applications in autonomous unmanned aerial vehicle (UAV) charging. The proposed method trains a supervised learning model to map measured secondary-side voltage and current features to the receiver’s spatial position with high precision. This enables an autonomous UAV to determine its location relative to the primary coil center, the optimal position for maximizing wireless charging efficiency. The sensing method is fully integrated into a standard WPT system, utilizing the same primary and secondary coils for both power transfer and position detection, thereby eliminating additional sensing hardware. The use of a 6.78 MHz operating frequency enhances positional sensitivity, as high-frequency near-field electromagnetic fields respond strongly to small spatial variations. Experimental validation is performed on a 30 W scaled prototype featuring a 210 mm × 140 mm primary coil, a 50 mm × 80 mm receiver coil, and a 15 mm air gap. Results demonstrate reliable position estimation and a strong correlation between predicted position and optimal coil alignment. This integrated framework unifying position detection and wireless charging offers a promising foundation for future autonomous electric vertical takeoff and landing (eVTOL) systems, enabling compact, hardware-efficient, and high-accuracy charging solutions.

Colak, Kerim [New York University]↗

Multi-scale Simulation, Calibration, and Optimization of Calcium Carbonate Precipitation in Microbial Communities

Ensuring the efficient engineering of microbially induced calcium carbonate precipitation (MICP) is crucial for a variety of environmental and civil engineering applications, such as soil stabilization and carbon sequestration. Addressing this need, we present a comprehensive multi-scale workflow that begins with the isolation of calcium carbonate-producing microbes from soil samples, followed by metagenomic sequencing and metabolic reconstruction. We then characterize microbial growth phenotypes under diverse nutrient conditions, compare observed growth with metabolic model predictions, and apply the Consistent Reproduction of Phenotype (CROP) algorithm to refine these models. Furthermore, we analyze metabolite consumption and production, and develop a consumer-resource model that is calibrated using time-series measurements of growth rates, pH levels, and calcium carbonate precipitation. The primary benefit of our approach lies in its ability to predict and control MICP outcomes, facilitated by a Bayesian methodology that incorporates priors on initial conditions and parameters. This allows us to compute posteriors by integrating experimental data, and to solve a risk optimization problem under uncertainty to identify nutrient conditions that maximize calcium carbonate production. In contrast to non-Bayesian methods, which fail to quantify uncertainty accurately, our approach provides a more reliable pathway to optimizing nutrient conditions, enhancing the likelihood of achieving desired MICP outcomes. This positions our method as a superior alternative in the quest to improve MICP through engineered microbial consortia.

54 ENVIRONMENTAL SCIENCES↗

Solid State Additive Manufacturing of Oxide Dispersion Strengthened-FeCrAl Alloy Components for High-Temperature Supercritical CO2 Power Cycle Applications

In this research, material extrusion additive manufacturing (MEAM) has been explored as an SSAM method for fabrication of 3-D components using ODS-FeCrAl alloy. MEAM-printed 3-D parts go through a series of process steps, e.g., chemical treatment, thermal treatment etc. in order to create a high density fully metallic part. Final 3-D part quality is associated with various process steps, e.g., filament fabrication, print design, and thermal treatment optimization. In MEAM, a metal powder loaded filament is used for printing 3-D shapes. Composition of the filament is very important since it provides shape retention at low-to-medium temperature. There are a few commercially available metallic alloy filaments. However, FeCrAl alloy filaments are not commercially available. In this project, we came up with a method to fabricate high quality composite FeCrAl filaments that could be used for MEAM printing. Subsequently, we have optimized MEAM print methods to fabricate samples that are larger than 10 mm, by using a modular print design approach. Finally, we have been able to optimize the chemical and high temperature heat treatment steps to achieve very high density (>98%) in sintered MEAM-printed products.

36 MATERIALS SCIENCE↗

Comparative study of machine learning techniques for post-combustion carbon capture systems

Computational analysis of countercurrent flows in packed absorption columns, often used in solvent-based post-combustion carbon capture systems (CCSs), is challenging. Typically, computational fluid dynamics (CFD) approaches are used to simulate the interactions between a solvent, gas, and column's packing geometry while accounting for the thermodynamics, kinetics, heat, and mass transfer effects of the absorption process. These simulations can then be used explain a column's hydrodynamic characteristics and evaluate its CO 2 -capture efficiency. However, these approaches are computationally expensive, making it difficult to evaluate numerous designs and operating conditions to improve efficiency at industrial scales. In this work, we comprehensively explore the application of statistical ML methods, convolutional neural networks (CNNs), and graph neural networks (GNNs) to aid and accelerate the scale-up and design optimization of solvent-based post-combustion CCSs. We apply these methods to CFD datasets of countercurrent flows in absorption columns with structured packings characterized by several geometric parameters. We train models to use these parameters, inlet velocity conditions, and other model-specific representations of the column to estimate key determinants of CO 2 -capture efficiency without having to simulate additional CFD datasets. We also evaluate the impact of different input types on the accuracy and generalizability of each model. We discuss the strengths and limitations of each approach to further elucidate the role of CNNs, GNNs, and other machine learning approaches for CO 2 -capture property prediction and design optimization.

97 MATHEMATICS AND COMPUTING↗

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING↗

Tools And Methods to Analyze Plant Outage Schedule and Assist Schedulers in Improving Outage Resilience

Refueling outages of nuclear power plants (NPPs) are considered one of the most critical phases throughout the plant lifetime. In such instances, tens of thousands of activities (e.g., maintenance, surveillance) are performed in a short amount of time (typically 2-3 weeks unless major backfitting or modernization projects are carried out) by a large number of crews (e.g., electricians, mechanics) that are hired as contractors. As a consequence, a plant outage can be expensive not only in terms of costs (e.g., contractor labor, material), but also in terms of loss generation since the plant is taken off the grid during the full outage duration (an indicative metric is about 1.2M$/day of loss of revenue). Thus, there is a continuous need to decrease the economic impact of outages on plant finances. This can be done by: decreasing the frequency of plant outages (e.g., from 18 to 24 months), reducing the time to complete the outage, and reducing the risk of outage delays. The Optimization of Outage Activities project under the Risk Informed Systems Analysis Pathway (RISA) sponsored by Department of Energy (DOE) Light Water Reactor Sustainability (LWRS) Program focuses on developing tools and methods to support NPPs with outage schedule optimization. The developed tools and methods are designed to analyze plant outage schedule with the goal of identify critical elements in the schedule that might pose a high risk of delays. These methods and tools can be considered resource-centric in the sense that they address outage challenges as a resource optimization problem. In this context, resources are either time and crews; outage delays occurs when either (or both) resources are insufficient to complete the set of tasks assigned at a specific time instant of the outage. This report provides details on how plant resources (time and crews) can be allocated in such a way that delays are minimized. In this respect, two classes of methods have been developed: the first one focuses on the time resource and how variability of the time to complete outage tasks may impact outage delays. The second one integrates available resources to assess when dailies activities should be performed such that the risk of outage delays are minimized.

97 MATHEMATICS AND COMPUTING↗

Identifying Bayesian optimal experiments for uncertain biochemical pathway models

Abstract Pharmacodynamic (PD) models are mathematical models of cellular reaction networks that include drug mechanisms of action. These models are useful for studying predictive therapeutic outcomes of novel drug therapies in silico. However, PD models are known to possess significant uncertainty with respect to constituent parameter data, leading to uncertainty in the model predictions. Furthermore, experimental data to calibrate these models is often limited or unavailable for novel pathways. In this study, we present a Bayesian optimal experimental design approach for improving PD model prediction accuracy. We then apply our method using simulated experimental data to account for uncertainty in hypothetical laboratory measurements. This leads to a probabilistic prediction of drug performance and a quantitative measure of which prospective laboratory experiment will optimally reduce prediction uncertainty in the PD model. The methods proposed here provide a way forward for uncertainty quantification and guided experimental design for models of novel biological pathways.

97 MATHEMATICS AND COMPUTING↗

Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing

We analyze the convergence of a nonlocal gradient descent method for minimizing a class of high-dimensional non-convex functions, where a directional Gaussian smoothing (DGS) is proposed to define the nonlocal gradient (also referred to as the DGS gradient). The method was first proposed in [Zhang et al., Enabling long-range exploration in minimization of multimodal functions, UAI 2021], in which multiple numerical experiments showed that replacing the traditional local gradient with the DGS gradient can help the optimizers escape local minima more easily and significantly improve their performance. However, a rigorous theory for the efficiency of the method on nonconvex landscape is lacking. In this work, we investigate the scenario where the objective function is composed of a convex function, perturbed by deterministic oscillating noise. We provide a convergence theory under which the iterates exponentially converge to a tightened neighborhood of the solution, whose size is characterized by the noise wavelength. Here, we also establish a correlation between the optimal values of the Gaussian smoothing radius and the noise wavelength, thus justifying the advantage of using moderate or large smoothing radii with the method. Furthermore, if the noise level decays to zero when approaching the global minimum, we prove that DGS-based optimization converges to the exact global minimum with linear rates, similarly to standard gradient-based methods in optimizing convex functions. Several numerical experiments are provided to confirm our theory and illustrate the superiority of the approach over those based on the local gradient.

Tran, Hoang [Oak Ridge National Laboratory (ORNL),↗

Improved 140 Nd Production for the 140 Nd/ 140 Pr In Vivo Generator through Target Recycling and Radiochemical Optimization

Theranostic strategies that utilize f-block therapeutic radionuclides, including 161 Tb, 177 Lu, 225 Ac, and 227 Th, suffer from a shortage of positron emission tomography (PET) imaging counterparts in the same chemical space and often rely on 68 Ga as a surrogate. The 140 Nd/ 140 Pr in vivo PET generator, which belongs to the f-block, may address this issue and can be produced via the 141 Pr(p,2n) 140 Nd production route by using medium-energy cyclotrons. However, impurities in the target material, including stable Nd, and the inherent difficulty of adjacent lanthanide separations limit the achievable radionuclidic and chemical purity of 140 Nd. In this work, we address these challenges through the purification and recycling of praseodymium target material and optimization of Nd/Pr separation. The resulting purified 140Nd was evaluated using DOTA and Macropa chelators via radiolabeling and in vitro stability studies. A target material purification and recycling method was developed for the monoisotopic 141 Pr starting material to remove stable Nd impurities, yielding 90.3 ± 4.7% (n = 3) recovery. The purified 141 Pr was isolated as Pr 6 O 11 and irradiated with 24 MeV protons (20.07 MeV at the target surface) at 20 μA for 4 h, which produced 1417.0 ± 83.4 MBq (38.3 ± 2.2 mCi) of 140 Nd at the end of bombardment (EOB). The produced 140 Nd was purified through an optimized DGA normal method to recover 71.6 ± 6.3% pure 140 Nd. The amount of stable Nd reduced progressively in each target purification cycle from >340 ppm without purification to <250 ppb after three cycles, while other measured metallic impurities were below 30 ppb. This improvement in target purity was reflected in the direct increase of apparent molar activity (AMA), when purified 140 Nd was evaluated with DOTA and Macropa chelators. AMA of [ 140 Nd]Nd-DOTA and [ 140 Nd]Nd-Macropa increased from 70.3 MBq/μmol (1.9 mCi/μmol) and 74 MBq/μmol (2.0 mCi/μmol) to 8025.3 MBq/μmol (216.9 mCi/μmol) and 8473.0 MBq/μmol (229.0 mCi/μmol), respectively, after the third target purification cycle. Further evaluation of chelator-labeled 140 Nd showed that [ 140 Nd]Nd-DOTA was stable in phosphate-buffered saline (PBS), saline, human serum, and mouse serum, whereas [140Nd]Nd-Macropa was stable in all except human serum. This work established a practical methodological advance for the production of 140 Nd/ 140 Pr in vivo PET generators, combining optimized target recycling and radiochemical separation to enable scaled-up and high-molar activity 140 Nd suitable for preclinical imaging. These advances support broader development of 140 Nd/ 140 Pr as a robust PET analogue, especially for f-block therapeutics.

Irradiation↗

Sensitivity analysis of design parameters in RowWise borehole layout for ground heat exchangers

Ground source heat pump systems offer a promising pathway toward energy-efficient building heating and cooling. The performance and cost-effectiveness of these systems heavily depend on the design of the ground heat exchanger (GHE), particularly the spatial placement of boreholes used in large commercial buildings. Among various borefield layout strategies, the RowWise approach generates and optimizes borehole configurations within irregular polygonal land boundaries, providing land-use efficiency and installation flexibility. While multiple geometric design parameters constrain the RowWise layout, their influence on the system thermal performance and total drilling requirements remains unclear. Thus, this study presents a sensitivity analysis of key design parameters influencing the RowWise layout of vertical borehole GHEs, including the perimeter spacing ratio, borehole spacing, borehole field rotation angle, and borehole length. GHEDesigner and Ray Tune are employed to generate and assess different RowWise configurations. A series of parametric simulations was conducted to quantify the impact of each parameter on geometric distribution, economic cost, and computational speed. The results provide critical insights into the sensitivity and relative importance of different design parameters of RowWise method, offering practical guidance for designers aiming to optimize GHE layouts by balancing thermal efficiency, land constraints, and economic feasibility.

Xu, Dikai [Purdue University]↗

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Ramôa, Mafalda (ORCID:0000000302187801)↗

Bayesian optimization algorithms for accelerator physics

Accelerator physics relies on numerical algorithms to solve optimization problems in online accelerator control and tasks such as experimental design and model calibration in simulations. The effectiveness of optimization algorithms in discovering ideal solutions for complex challenges with limited resources often determines the problem complexity these methods can address. The accelerator physics community has recognized the advantages of Bayesian optimization algorithms, which leverage statistical surrogate models of objective functions to effectively address complex optimization challenges, especially in the presence of noise during accelerator operation and in resource-intensive physics simulations. In this review article, we offer a conceptual overview of applying Bayesian optimization techniques toward solving optimization problems in accelerator physics. We begin by providing a straightforward explanation of the essential components that make up Bayesian optimization techniques. We then give an overview of current and previous work applying and modifying these techniques to solve accelerator physics challenges. Finally, we explore practical implementation strategies for Bayesian optimization algorithms to maximize their performance, enabling users to effectively address complex optimization challenges in real-time beam control and accelerator design. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗

SODAs: sparse optimization for the discovery of differential and algebraic equations

Differential-algebraic equations (DAEs) integrate ordinary differential equations (ODEs) with algebraic constraints, providing a fundamental framework for developing models of dynamical systems characterized by time-scale separation, conservation laws and physical constraints. While sparse optimization has revolutionized model development by allowing data-driven discovery of parsimonious models from a library of possible equations, existing approaches for dynamical systems assume DAEs can be reduced to ODEs by eliminating variables before model discovery. This assumption limits the applicability of such methods for DAE systems with unknown constraints and time scales. We introduce sparse optimization for differential-algebraic systems (SODAs), a data-driven method for the identification of DAEs in their explicit form. By discovering the algebraic and dynamic components sequentially without prior identification of the algebraic variables, this approach leads to a sequence of convex optimization problems. It has the advantage of discovering interpretable models that preserve the structure of the underlying physical system. To this end, SODAs improves since SODAs is singular numerical stability when handling high correlations between library terms, caused by near-perfect algebraic relationships, by iteratively refining the conditioning of the candidate library. We demonstrate the performance of our method on biological, mechanical and electrical systems, showcasing its robustness to noise in both simulated time series and real-time experimental data.

DAE↗

Scoping Analysis of Pebble-Bed Reactors for the Destruction of the Transuranic Inventory of LWR Spent Nuclear Fuel

With the forecasted increase in the construction and operation of nuclear reactors, there will be a corresponding increase in the quantity of spent nuclear fuel (SNF) that requires long-term storage. In SNF, transuranic isotopes contribute the most to the long-term radiotoxicity of the fuel and pose a proliferation risk. One option that has been explored to address these issues is the removal of the transuranic isotopes from SNF and the conversion of these isotopes into transuranic fuel (TRU fuel). Here, this work sought to determine how effective a micro-modular Pebble-Bed High-Temperature Gas-Cooled Reactor (PB-HTGR); the 10-MW High Temperature Gas-cooled Test Reactor (HTR-10); and a salt-cooled small-modular pebble-bed reactor (PBR), i.e. the generic Fluoride-cooled High-temperature Reactor (gFHR), are at reducing the inventory of transuranic isotopes while still maintaining the intrinsic safety features of the PBR designs, such as negative temperature coefficients of reactivity. Optimized pebble designs utilizing TRU fuel were found for both reactors through the adjustment for the packing fraction of fuel in each pebble. The Axial Zone Equilibrium Modeling (A-ZEM) method was used in this work to help select the optimized pebble design. Once an optimized pebble design was selected and an equilibrium model was produced, the results from the deep burn (DB) HTR-10 and gFHR designs were compared to the results of two models from the literature. While both the DB gFHR and the DB HTR-10 were able to reduce the weapons-usable transuranic inventory, the performance of these reactors did not match that of the small-modular PB-HTGRs in the literature. Therefore, a need was identified for further refinement of the gFHR design using TRU fuel, as the results for this model were more promising than those of the DB HTR-10, which was strongly limited by the high leakage intrinsic to micro-modular PB-HTGRs.

Transuranic fuel↗

Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities

We consider a class of hierarchical variational inequality (VI) problems that subsumes VI-constrained optimization and several other problem classes, including the optimal solution selection problem and the optimal Nash equilibrium (NE) seeking problem. Our main contribution is threefold. (i) We consider bilevel VIs with monotone and Lipschitz continuous mappings and devise a single-timescale iteratively regularized extragradient method, named IR-EG 𝚖,𝚖 . We improve the existing iteration complexity results for addressing both bilevel VI and VI-constrained convex optimization problems. (ii) Under the strong monotonicity of the outer-level mapping, we develop a method named IR-EG 𝚜,𝚖 and derive faster guarantees than those in (i). We also study the iteration complexity of this method under a constant regularization parameter. These results appear to be new for both bilevel VIs and VI-constrained optimization. (iii) To our knowledge, complexity guarantees for computing the optimal NE in nonconvex settings do not exist. Motivated by this lacuna, we consider VI-constrained nonconvex optimization problems and devise an inexactly projected gradient method, named IPR-EG, where the projection onto the unknown set of equilibria is performed using IR-EG 𝚜,𝚖 with a prescribed termination criterion and an adaptive regularization parameter. We obtain new complexity guarantees in terms of a residual map and an infeasibility metric for computing a stationary point. Here, we validate the theoretical findings using preliminary numerical experiments for computing the best and the worst NEs.

bilevel optimization↗