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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 559 records · Page 31

All sources NASA NTRS DOE OSTI

DOE OSTI2024

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)↗

DOE OSTI2024

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↗

DOE OSTI2026

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↗

DOE OSTI2025

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↗

DOE OSTI2025

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↗

DOE OSTI2024

Evaluating the impact of peat soils and snow schemes on simulated active layer thickness at pan-Arctic permafrost sites

Abstract Permafrost stability is significantly influenced by the thermal buffering effects of snow and active-layer peat soils. In the warm season, peat soils act as a barrier to downward heat transfer mainly due to their low thermal conductivity. In the cold season, the snowpack serves as a thermal insulator, retarding the release of heat from the soil to the atmosphere. Currently, many global land models overestimate permafrost soil temperature and active layer thickness (ALT), partially due to inaccurate representations of soil organic matter (SOM) density profiles and snow thermal insulation. In this study, we evaluated the impacts of SOM and snow schemes on ALT simulations at pan-Arctic permafrost sites using the Energy Exascale Earth System Model (E3SM) land model (ELM). We conducted simulations at the Circumpolar Active Layer Monitoring (CALM) sites across the pan-Arctic domain. We improved ELM-simulated site-level ALT using a knowledge-based hierarchical optimization procedure and examined the effects of precipitation-phase partitioning methods (PPMs), snow compaction schemes, and snow thermal conductivity schemes on simulated snow depth, soil temperature, ALT, and CO 2 fluxes. Results showed that the optimized ELM significantly improved agreement with observed ALT (e.g. RMSE decreased from 0.83 m to 0.15 m). Our sensitivity analysis revealed that snow-related schemes significantly impact simulated snow thermal insulation levels, soil temperature, and ALT. For example, one of the commonly used snow thermal conductivity schemes (quadratic Sturm or SturmQua) generally produced warmer soil temperatures and larger ALT compared to the other two tested schemes. The SturmQua scheme also amplified the model’s sensitivity to PPMs and predicted deeper ALTs than the other two snow schemes under both current and future climates. The study highlights the importance of accurately representing snow-related processes and peat soils in land models to enhance permafrost dynamics simulations.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2025

Scale-up study of enhancing algal growth through bioaugmentation with the indole-3-acetic acid producing bacteria Azospirillum brasilense

Algae-based wastewater treatment technologies can recover nutrients while generating algal biomass with diverse application potentials. While numerous bacteria have demonstrated the ability to enhance algal growth through symbiotic relationships in laboratory settings, scaling this benefit to larger applications remains challenging due to complex wastewater conditions and microbe-algae dynamics. This study explores the effectiveness of bioaugmentation with Azospirillum brasilense, a plant growth-promoting bacterium known for producing the phytohormone indole-3-acetic acid (IAA), in boosting algal productivity within an Algaewheel wastewater treatment system. Through a series of experiments conducted at lab-, pilot-, and full-scale levels, we evaluated the impact of bioaugmentation on algal growth and developed a bioaugmentation strategy for an Algaewheel system. The results indicate that a biweekly dosing, achieving a final bioaugmenting cell density of 0.2–4 × 10 9 cells/L, effectively doubles the biomass productivity in a residential subdivision wastewater treatment plant in Northern Illinois. The bacterial production of IAA was the primary mechanism driving this enhancement, as demonstrated by the similar growth and yield improvements observed with chemically supplemented IAA and bioaugmentation across all experimental scales. High-throughput sequencing of 18S rRNA genes revealed that the algal community in the bioaugmented tank exhibited more stable biodiversity than the control. Additionally, bioaugmentation improved nutrient removal efficiency during winter, highlighting its potential to enhance the overall performance and sustainability of algae-based wastewater systems. The developed bioaugmentation and chemical treatment methods offer further operational solutions for managing yield, optimizing biochemical profiles, and enhancing biofuel production potential.

Algae-bacterial symbiotic relationship↗

DOE OSTI2025

A Portfolio Approach to Massively Parallel Bayesian Optimization

One way to reduce the time of conducting optimization studies is to evaluate designs in parallel rather than just one-at-a-time. For expensive-to-evaluate black-boxes, batch versions of Bayesian optimization have been proposed. They work by building a surrogate model of the black-box to simultaneously select multiple designs via an infill criterion. Still, despite the increased availability of computing resources that enable large-scale parallelism, the strategies that work for selecting a few tens of parallel designs for evaluations become limiting due to the complexity of selecting more designs. It is even more crucial when the black-box is noisy, necessitating more evaluations as well as repeating experiments. Here we propose a scalable strategy that can keep up with massive batching natively, focused on the exploration/exploitation trade-off and a portfolio allocation. We compare the approach with related methods on noisy functions, for mono and multi-objective optimization tasks. These experiments show orders of magnitude speed improvements over existing methods with similar or better performance.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Convergence Analysis of the Alternating Anderson–Picard Method for Nonlinear Fixed-Point Problems

Anderson acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This work focuses on a variant of AA in which multiple Picard iterations are performed between each AA step, referred to as the Alternating Anderson–Picard (AAP) method. Furthermore, despite introducing more “slow” Picard iterations, this method has been shown to be efficient and even more robust in both linear and nonlinear cases. However, there is a lack of theoretical analysis for AAP in the nonlinear case. In this paper, we address this gap by establishing the equivalence between AAP and a multisecant-GMRES method that uses GMRES to solve a multisecant linear system at each iteration. From this perspective, we show that AAP “converges” to the Newton-GMRES method. Specifically, as the residual approaches zero, the multisecant matrix, the approximate Jacobian inverse, the search direction, and the optimization gain of AAP converge to their counterparts in the Newton-GMRES method. These connections provide insights for analyzing the asymptotic convergence properties of AAP. Consequently, we show that AAP is locally 𝑞-linear convergent and provide an upper bound for the convergence factor of AAP. To validate the theoretical results, numerical examples are provided.

Anderson acceleration↗

DOE OSTI2025

Optimization of direct air capture processes using reactive transport models of adsorption-desorption cycles

In this study, we develop and implement a reactive transport model in COMSOL Multiphysics® to address the challenges of direct air carbon capture. The model is validated against experimental data and used to simulate the cyclic steady state of the adsorption-desorption process. The optimization of this model is achieved through advanced trust-region methods integrated with Gaussian Processes. Key decision variables, including adsorption and desorption times, desorption temperature and pressure, input velocity, bed porosity, column length, and radius were optimized to minimize the capture cost. After optimization, a sensitivity analysis revealed the complex interplay between the decision variables and their effect on the specific energy and cost of removing the CO 2 . We optimized the capture cost while taking into account the trade-off between energy consumption and productivity. The resulting minimum capture cost was determined to be 265.2 $/t-CO 2 , which aligns with expected values reported in the literature. Numerical results suggest the effectiveness of the optimization strategies applied, and underscore the importance of simultaneous decision variable selection in improving the performance in direct air capture processes. We also extend the modeling approach to a 2D axisymmetric model to better visualize CO₂ uptake and temperature profiles, revealing significant radial gradients during the regeneration step. As a main drawback, this enhanced model comes with a computational cost approximately 40 times higher than that of the 1D model.

Adsorption-desorption process↗

DOE OSTI2025

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Optimal Design Approaches for Cost-Effective Manufacturing and Deployment of Chemical Process Families with Economies of Numbers

Developing methods for rapid, large-scale deployment of carbon capture systems is critical for meeting climate change goals. Optimization-based decisions can be employed at the design and manufacturing phases to minimize costs of deployment and operation. Manufacturing standardization results in significant cost savings due to economies of numbers. Building off previous work, we present a process family design approach to design a set of carbon capture systems while explicitly including economies of numbers savings within the formulation. Our formulation optimizes both the number and characteristics of the common components in the platform and simultaneously designs the resulting set of carbon capture systems. Savings from economies of numbers are explicitly included in the formulation to determine the number of components in the platform. We show and discuss the savings we gain from economies of numbers.

Stinchfield, Georgia↗

DOE OSTI2024

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

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

36 MATERIALS SCIENCE↗

DOE OSTI2025

Complexity Reduction Methods for Large-Scale Spatially Explicit Biofuels Network Design

The size and complexity of energy system optimization models have increased significantly in recent years, driven by the availability of high-resolution spatial data. We present complexity reduction and solution methods that enable us to efficiently represent high-resolution spatial data in the network design of large-scale energy systems. We aim to reduce the size and enhance the computational efficiency of network design models without sacrificing solution accuracy. Specifically, we first present how to aggregate highly granular data into larger resolutions without averaging out their specific properties through a composite-curve-based approach and then develop a method to linearly represent these curves. Second, we utilize a general clustering method to determine groups of geographically proximate biomass fields and establish a single transportation arc for all of them, reducing the number of transportation-related variables while maintaining an accurate representation of the system. Finally, we introduce a two-step algorithm that decomposes large-scale network design problems into two smaller, more manageable subproblems. We demonstrate the application of our methods using a case study of switchgrass-to-biofuels network design in the eight states of the U.S. Midwest, using realistic and highly explicit spatial data.

09 BIOMASS FUELS↗

DOE OSTI2025

Hierarchical Gaussian process-based Bayesian optimization for materials discovery in high entropy alloy spaces

Bayesian optimization (BO) is a powerful and data-efficient method for iterative materials discovery and design, particularly valuable when prior knowledge is limited, underlying functional relationships are complex or unknown, and the cost of querying the materials space is significant. Traditional BO methodologies typically utilize conventional Gaussian Processes (cGPs) to model the relationships between material inputs and properties, as well as correlations within the input space. However, cGP-BO approaches often fall short in multi-objective optimization scenarios, where they are unable to fully exploit correlations between distinct material properties. Leveraging these correlations can significantly enhance the discovery process, as information about one property can inform and improve predictions about others. Here, this study addresses this limitation by employing advanced kernel structures to capture and model multi-dimensional property correlations through multi-task (MTGPs) or deep Gaussian Processes (DGPs), thus accelerating the discovery process. We demonstrate the effectiveness of MTGP-BO and DGP-BO in rapidly and robustly solving complex materials design challenges that occur within the context of complex multi-objective optimization over FCC FeCrNiCoCu high entropy alloy (HEA) spaces, where traditional cGP-BO approaches fail. Furthermore, we highlight how the differential costs associated with querying various material properties can be strategically leveraged to make the materials discovery process more cost-efficient.

36 MATERIALS SCIENCE↗

DOE OSTI2025

HP-MDR: High-performance and Portable Data Refactoring and Progressive Retrieval with Advanced GPUs

Scientific applications produce vast amounts of data, posing grand challenges in the underlying data management and analytic tasks. Progressive compression is a promising way to address this problem, as it allows for on-demand data retrieval with significantly reduced data movement cost. However, most existing progressive methods are designed for CPUs, leaving a gap for them to unleash the power of today’s heterogeneous computing systems with GPUs.In this work, we propose HP-MDR, a high-performance and portable data refactoring and progressive retrieval framework for GPUs. Our contributions are four-fold: (1) We carefully optimize the bitplane encoding and lossless encoding, two key stages in progressive methods, to achieve high performance on GPUs; (2) We propose pipeline optimization and incorporate it with data refactoring and progressive retrieval workflows to further enhance the performance for large data process; (3) We leverage our framework to enable high-performance data retrieval with guaranteed error control for common Quantities of Interest; (4) We evaluate HP-MDR and compare it with state of the arts using five real-world datasets. Experimental results demonstrate that HP-MDR delivers an average 13.68 × and 6.31 × throughput in data refactoring and progressive retrieval tasks, respectively. It also leads to 11.22 × throughput for recomposing required data representations under Quantity-of-Interest error control and 6.04 × performance for the corresponding end-to-end data retrieval, when compared with state-of-the-art solutions.

Li, Yanliang [University of Oregon]↗

DOE OSTI2026

Catalytic Autoxidation for Depolymerization of Multilayer Plastic Films

Recycling multilayer plastic films is challenged by a diversity of polymers, prompting development of new recycling methods. For the depolymerization of mixed polymers like those in multilayer films, metal-catalyzed autoxidation offers a versatile chemical recycling method to deconstruct multiple polymers to useful oxygenates. Here, we demonstrate that catalytic autoxidation is effective for depolymerizing multilayer films across diverse chemistries. We investigated conditions for a model polyethylene substrate using a Co, Mn, and Br cocatalyst system, achieving full carbon closure with oxygenated small molecules contributing up to 48 mol% carbon. Subsequently, we characterized product distributions for several common polymers used in multilayer films using high-resolution mass spectrometry (HRMS) and developed analytical methods to quantify the resulting complex product streams. Optimized conditions for polyethylene were applied to 11 multilayer plastic films containing 10 different polymers, including films with nonpolymeric potential disrupters like aluminum foil and titanium dioxide, showing that catalytic autoxidation is effective across a broad range of polymer types and is resistant to disrupters and additives. The generation of CO 2 in these reactions overall suggests that both reaction engineering and modifications to the reaction conditions will be required to achieve higher yields of soluble oxygenated products.

36 MATERIALS SCIENCE↗