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 253 records · Page 14

Scaling Spectroradiometric Monitoring to an Algal Factory Farm

This report briefly summarizes the spectroradiometric approach adapted and deployed as part of Task 4.2 within the BETO-funded D evelopment of I ntegrated S creening, C ultivar O ptimization, and V erification R esearch (DISCOVR) project, specifically task 4, “Increase crop protection and culture stability.” The goals of this subtask were to monitor ponds cultivating a variety of DISCOVR strains at the Arizona Center for Algae Technology and Innovation (AzCATI) with spectroradiometric technology to: • Predict biomass concentrations with high temporal frequency. • Optimize automated analysis methods that enabled feedback for pond automation strategies • Identify pond crash indicators from primary (pest/predator) and indirect (change in algal host) spectroscopic signals with potential for early treatment/intervention • Provide recommendations for technology deployment at scale. This report fulfills the deliverable requirement for the final bullet “provide recommendations for technology deployment at scale”.

09 BIOMASS FUELS↗

Implementing a unified solver for nonlinearly constrained optimization

SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno’s software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at https://github.com/cvanaret/Uno and via its C, Julia, Python, Fortran, and AMPL interfaces.

97 MATHEMATICS AND COMPUTING↗

Simulations of Quantum Approximate Optimization Algorithm on HPC-QC Integrated Systems

The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising tool for accelerating optimization processes in the Noisy Intermediate-Scale Quantum (NISQ) era. Compared to classical methods, QAOA efficiently solves optimization problems, often formulated as Quadratic Unconstrained Binary Optimization (QUBO) problems. Classical quantum simulators are crucial for evaluating quantum algorithms due to limited quantum resources. However, QAOA's performance can vary with different simulation methods. This study analyzes QAOA's performance using various quantum simulators (e.g., density _matrix, statevector, and matrix_product_state) and demonstrates the benefits of HPC-QC integrated systems in solving QUBO problems on an active learning workflow. By simulating QAOA on dense, large-matrix QUBO problems, we evaluate accuracy and problem-solving time. We also assess QAOA's performance on local computers and HPC-QC inte-grated systems, using Oak Ridge Leadership Computing Facility (OLCF)'s Frontier supercomputer with local Qiskit Aer and remote IBM Quantum simulators.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗

A deep learning approach to fast analysis of collective Thomson scattering spectra

Fast analysis of collective Thomson scattering ion acoustic wave features using a deep convolutional neural network model is presented. The network was trained from spectra to predict the plasma parameters, including ion velocities, population fractions, and ion and electron temperatures. A fully kinetic particle-in-cell simulation was used to model a laboratory astrophysics experiment and simulate a diagnostic image of the ion acoustic wave feature. Network predictions were compared with Bayesian inference of the plasma model parameters for both the simulated and experimentally measured images. Both approaches were fairly accurate predicting the simulated image and the network predictions matched a good portion of the Bayesian results for the experimentally measured image. The Bayesian approach is more robust to noise and motivates future work to train deep learning models with realistic noise. The advantage of the deep learning model is making thousands of predictions in a few hundred milliseconds, compared to a few seconds to minutes per prediction for the optimization and Bayesian approaches presented here. The results demonstrate promising capabilities of deep learning models to analyze Thomson data orders of magnitude faster than conventional methods when using the neural network for standalone analysis. If more rigorous analysis is needed, neural network predictions can be used to quickly initialize other optimization methods and increase chances of success. This is especially useful when the dataset becomes very large or highly dimensional and manually refining initial conditions for the entire dataset are no longer tractable.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

FuSED Users Manual, 5.24

The Fusion of Simulation, Experiment, and Data (FuSED) team provides a set of tools for solving inverse problems in structural dynamics and thermal physics, and also sensor placement optimization via Optimal Experimental Design (OED). These methods are used for designing experiments, model calibration, and verification/validation analysis of systems. This document provides a user’s guide to the input for the three apps that are supported for these methods. Details of input specifications, output options, and optimization parameters are included.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Simulator for Neyer Tests of Explosives

Explosives and explosive devices such as detonators are typically tested by applying a range of stimuli such as voltage or mechanical shock, and recording binary “detonated/did not detonate” responses. These are analyzed using maximum likelihood or generalized linear models to provide estimates of quantities such as the all-fire and no-fire points. Given that the true threshold for detonation is unknown a priori , sequential design methods are typically used to optimize the set of test points. One popular method, implemented in commercial software, is Neyer’s algorithm. To support simulation and experimental design, we have developed code in the R programming language to duplicate the functions of the Neyer software. We provide code for the simulator along with a description and examples of usage.

42 ENGINEERING↗

Counterdiabatic Driving with Performance Guarantees

Counterdiabatic (CD) driving has the potential to speed up adiabatic quantum state preparation by suppressing unwanted excitations. However, existing approaches either require intractable classical computations or are based on approximations that do not have performance guarantees. We propose and analyze a nonvariational, system-agnostic CD expansion method and analytically show that it converges exponentially quickly in the expansion order. In finite systems, the required resources scale inversely with the spectral gap, which we argue is asymptotically optimal. To extend our method to the thermodynamic limit and suppress errors stemming from high-frequency transitions, we leverage finite-time adiabatic protocols. In particular, we show that a time determined by the quantum speed limit is sufficient to prepare the desired ground state, without the need to optimize the adiabatic trajectory. Numerical tests of our method on the quantum Ising chain show that our method can outperform state-of-the-art variational CD approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

State Dependent Optimization with Quantum Circuit Cutting

Quantum circuits can be reduced through optimization to better fit the constraints of quantum hardware. One such method, initial-state dependent optimization (ISDO), reduces gate count by leveraging knowledge of the input quantum states. Surprisingly, we found that ISDO is broadly applicable to the downstream circuits produced by circuit cutting. Circuit cutting also requires measuring upstream qubits and has some flexibility of selection observables to do reconstruction. Therefore, we propose a state-dependent optimization (SDO) framework that incorporates ISDO, our newly proposed measure-state dependent optimization (MSDO), and a biased observable selection strategy. Building on the strengths of the SDO framework and recognizing the scalability challenges of circuit cutting, we propose nonseparate circuit cutting-a more flexible approach that enables optimizing gates without fully separating them. We validate our methods on noisy simulations of QAOA, QFT, and BV circuits. Results show that our approach consistently mitigates noise and improves overall circuit performance, demonstrating its promise for enhancing quantum algorithm execution on near-term hardware.

Li, Xinpeng↗

Geometry-complete diffusion for 3D molecule generation and optimization

Abstract Generative deep learning methods have recently been proposed for generating 3D molecules using equivariant graph neural networks (GNNs) within a denoising diffusion framework. However, such methods are unable to learn important geometric properties of 3D molecules, as they adopt molecule-agnostic and non-geometric GNNs as their 3D graph denoising networks, which notably hinders their ability to generate valid large 3D molecules. In this work, we address these gaps by introducing the Geometry-Complete Diffusion Model (GCDM) for 3D molecule generation, which outperforms existing 3D molecular diffusion models by significant margins across conditional and unconditional settings for the QM9 dataset and the larger GEOM-Drugs dataset, respectively. Importantly, we demonstrate that GCDM’s generative denoising process enables the model to generate a significant proportion of valid and energetically-stable large molecules at the scale of GEOM-Drugs, whereas previous methods fail to do so with the features they learn. Additionally, we show that extensions of GCDM can not only effectively design 3D molecules for specific protein pockets but can be repurposed to consistently optimize the geometry and chemical composition of existing 3D molecules for molecular stability and property specificity, demonstrating new versatility of molecular diffusion models. Code and data are freely available on GitHub .

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine Learning for Optimized Polarization at Jefferson Lab

Polarized cryo-targets and polarized photon beams are widely used in experiments at Jefferson Lab. Traditional methods for maintaining the optimal polarization involve manual adjustments throughout data taking by human shift takers. This may introduce some level of inconsistency simply due to the wide variety of experience and expertise of the shift takers themselves. Implementing machine learning-based control systems can improve the stability of the polarization without relying on human intervention. The cryo-target polarization is influenced by temperature, microwave energy, the distribution of paramagnetic radicals, as well as operational conditions including the radiation dose. Diamond radiators are used to generate linearly polarized photons from a primary electron beam. The energy spectrum of these photons can drift over time due to changes in the primary electron beam conditions and diamond degradation. As a first step towards automating the continuous optimization and control processes, uncertainty aware surrogate models have been developed to predict the polarization based on historical data. This talk will provide an overview of the use cases and models developed, highlighting the collaboration between data scientists and physicists at Jefferson Lab.

Jeske, Torri [Thomas Jefferson National Accelerato↗

Noise-aware optimization in nominally identical manufacturing and measuring systems for high-throughput parallel workflows

Device-to-device variability in experimental noise critically impacts reproducibility, especially in automated, high-throughput systems like additive manufacturing farms. While manageable in small labs, such variability can escalate into serious risks at larger scales, such as architectural 3D printing, where noise may cause structural or economic failures. This contribution presents a noise-aware decision-making algorithm that quantifies and models device-specific noise profiles to manage variability adaptively. It uses distributional analysis and pairwise divergence metrics with clustering to choose between single-device and robust multi-device Bayesian optimization strategies. Unlike conventional methods that assume homogeneous devices or enforce generic robustness, the proposed framework explicitly determines whether shared optimization across devices is appropriate based on the degree of inter-device noise heterogeneity. This enables improved performance, reproducibility, and efficiency. An experimental case study involving three nominally identical 3D printers (same brand, model, and close serial numbers) demonstrates reduced redundancy, lower resource usage, and improved reliability, along with improved convergence stability and solution quality through the selection of the appropriate optimization strategy based on the degree of inter-device noise heterogeneity. Overall, this framework establishes a general approach for precision- and resource-aware optimization in scalable, automated experimental platforms, demonstrated here on a representative multi-device 3D printing case study.

Schenk, Christina↗

Optimization-based approaches to control of connected and automated vehicles: Principles, complexities, applications, challenges, and outlook

Safe and optimal motion control for connected and automated vehicles (CAVs) poses a fundamental optimization challenge at the intersection of system complexity, environmental uncertainty, and stringent real-time constraints. Existing surveys address this challenge in isolation – focusing either on specific control techniques or individual uncertainty sources – without providing a unified framework that characterizes the trade-offs among computational tractability, performance verifiability, and adaptive generalization across paradigms. This review addresses that gap by presenting a cohesive analytical framework concentrated on the decision-making and trajectory optimization layers of the CAV autonomy stack. We systematically analyze three major optimization paradigms – first-principles model-based optimization, data-driven methods, and hybrid synergistic architectures – evaluating each against four core complexity axes: problem formulation, constraint handling, optimality guarantees, and robustness. Key applications including platooning, trajectory planning, collision avoidance, and cooperative control are examined to reveal recurring methodological patterns and critical operational constraints that limit real-world performance. Our synthesis identifies verifiable hybrid architectures, incentive-aligned multi-agent cooperation, and hardware-algorithm co-design as the defining research frontiers, and distills a targeted agenda for developing CAV control systems that are simultaneously safe, computationally efficient, and deployable in the full complexity of real-world traffic environments.

Muzahid, Abu Jafar Md [University of Tennessee, Kn↗

Efficient Optimization of Plasma Radiation Detector Configurations using Imperfect Inference Models

The configurations of instruments fielded on an experiment affect the amount of information captured and the quality of subsequent inference. Here, we investigate the problem of optimizing plasma x-ray radiation detectors in a magneto-inertial fusion experiment at Sandia National Laboratories. It is impossible to directly measure properties such as the temperature of the thermonuclear fusion plasma produced in these experiments because of the extreme environment and destructive nature of the experiment. Among other diagnostics, several detectors are placed with significant standoff from the fusion target to capture the x-rays emitted by the fusion plasma, which can be used to infer some of its properties. To optimize the configuration of these detectors, a high-fidelity model (HFM) is used for simulating outputs and a low-fidelity model (LFM) is used for inference. We develop methods based on A- and L-optimality criteria that are efficient to compute while explicitly accounting for the discrepancy between the HFM and the LFM. The method allows us to find detector configurations that perform similarly to or better than the configuration obtained using an existing sampling-based optimization method while decreasing computational time by a factor of 50. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work.

Bayesian optimization↗

Optimizing Grain Boundary Structures with LAMMPS Using Evolutionary Algorithms

Grain boundary structure optimization is an important part of materials modeling. Current methods for grain boundary structure optimization involve inefficient, time-consuming processes that do not fully explore the interface parameter space. Evolutionary algorithms have recently been demonstrated to be effective at determining both stable and metastable grain boundary interface structures. In this work, we demonstrate the use of GBOpt, a grain boundary structure optimization software designed to use the Large-scale Atomic/Molecular Massively Parallel Simulation (LAMMPS) software to efficiently determine grain boundary structures. We demonstrate that a only a few manipulations, namely atom insertion, atom removal, and relative grain displacement, are sufficient to explore much of the grain boundary structure parameter space. The efficacy of this approach is demonstrated on an FCC Ni system, and a BCC Fe system. The computational cost is compared against the gamma-surface sampling approach to demonstrate performance improvement.

Evolutionary algorithms↗

Bayesian optimization of PYTHIA 8 tunes

A new tune (set of model parameters) is found for the six most important parameters of the PYTHIA 8 final state parton shower and hadronization model using Bayesian optimization. The tune fits the Large Electron-Positron collider (LEPI) data from ALEPH better than the default tune in PYTHIA 8. To the best of our knowledge, we present the most comprehensive application of Bayesian optimization to the tuning of a parton shower and hadronization model using the LEPI data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Iterative methods in GPU-resident linear solvers for nonlinear constrained optimization

Linear solvers are major computational bottlenecks in a wide range of decision support and optimization computations. The challenges become even more pronounced on heterogeneous hardware, where traditional sparse numerical linear algebra methods are often inefficient. For example, methods for solving ill-conditioned linear systems have relied on conditional branching, which degrades performance on hardware accelerators such as graphical processing units (GPUs). To improve the efficiency of solving ill-conditioned systems, our computational strategy separates computations that are efficient on GPUs from those that need to run on traditional central processing units (CPUs). Our strategy maximizes the reuse of expensive CPU computations. Iterative methods, which thus far have not been broadly used for ill-conditioned linear systems, play an important role in our approach. In particular, we extend ideas from Arioli et al., (2007) to implement iterative refinement using inexact LU factors and flexible generalized minimal residual (FGMRES), with the aim of efficient performance on GPUs. In conclusion, we focus on solutions that are effective within broader application contexts, and discuss how early performance tests could be improved to be more predictive of the performance in a realistic environment.

97 MATHEMATICS AND COMPUTING↗

Chelation ion chromatography as an automated, and cost-effective analytical technique for REE determination: method development and applications

Rare earth elements (REEs), as critical minerals, have important uses in modern energy and technologies, yet are vulnerable to potential supply chain disruptions. To establish domestic REE supply chain, efficient REE detection methods for resource characterization and mineral processing will be needed to accelerate innovations for domestic REE recovery. This study developed a rapid, novel, and cost-effective for REE detection method using ion chromatography (IC) for aqueous samples. Various REE-targeted eluent gradients and post-column agent compositions were tested on the chelation ion chromatography (CIC) with UV-vis detector for optimal separation and quantification of REEs within approximately 20 min. The single-channel pump to deliver the post-column solution to UV-vis detector was replaced with a 4-channel gradient pump, to increase operation and maintenance efficiencies. After method optimization, resulting calibration curves for more than ten REEs achieved high coefficients of determination (R2>0.999) and low relatively standard deviations (below 3.24%), demonstrating sub-ppm level detection limits (0.0897 to 0.1149 mg/L). The reliability of the CIC method was validated through comparison with inductively coupled plasma mass spectrometry (ICP-MS), showing strong agreement in REE recovery from certified standards. The impact of metal ions and salts on REE recovery using CIC was also systematically investigated. CIC consistently exhibited reliable performance in the presence of salt solutions such as NaCl and Na₂SO₄ (up to 10,000 mg/L). Our study also found the presence of high concentrations of Al ions (at 10,000 mg/L) significantly influenced REE determination, and elevated concentrations of Ca ions affected the recovery of specific REEs, including La, Ce, and Pr. The CIC method was further tested on REE-containing eluents from solvent extraction tests out of fly ash leachates. REE detection from these real processing fluids were reported to achieve 90% to 100% recovery rate from our IC method, compared to ICP-MS results. This study underscores the potential of CIC as a reliable and efficient alternative for REE determination in complex matrices. It also highlights the importance of minimizing select interfering metal ions in solutions to ensure accurate results. The REE CIC method presents a promising, low-maintenance, salt-tolerant, and cost-effective alternative to traditional analytical methods for REE analysis.

detection of rare earth elements (REE)↗

Alchemy: A Model-Based Approach for 2D to 3D Autonomous Nuclear System Design

Engineering design of nuclear power plant (NPP) piping and equipment systems frequently bypasses crucial 2D system planning, instead moving straight to 3D modeling. This often leads to designs that exceed building envelope constraints, forcing expensive and time-consuming redesigns. When 2D modeling is employed, it typically involves labor-intensive manual workflows that convert 2D drawings into 3D models, resulting in inefficiencies and errors across design iterations. These workflows further suffer from poor software interoperability and dependence on proprietary software ecosystems, thereby contributing to schedule delays and cost overruns. This paper presents Alchemy, an autonomous framework that transforms 2D system definitions into Industry Foundation Classes (IFC)-compliant 3D building information models (BIMs) for expediting nuclear facility design at the conceptual preliminary phase. Using a model-based approach, the framework treats the 2D system diagram as the central reference model employed to automatically generate all subsequent outputs, ensuring consistency between the system definition and the resulting physical design. A web-based interface enables engineers to define hierarchical system topologies including associated equipment, geometric properties, and connectivity requirements. A two-phase equipment layout optimization algorithm automatically computes collision-free spatial configurations within predefined building envelopes. An artificial intelligence (AI)-assisted pipe routing module then generates orthogonal, collision-free routing paths, allowing the user to select either an A* search-based method or an Ant Colony Optimization (ACO)-based method. All outputs are authored natively in IFC format, relying on open-source technologies and standardized formats in order to ensure extensibility and eliminate proprietary software dependencies. The proposed framework is validated on two representative pressurized-water reactor (PWR)-based case studies, for which it autonomously generates IFC-compliant 3D models in minutes, drastically reducing workflows that typically require hours of manual effort. The generated model demonstrates topologically correct equipment placement, physically plausible spatial relationships, and collision-free pipe routing consistent with known PWR loop configurations. This work represents a foundational step toward digital engineering for nuclear facility preliminary design, with future ongoing development targeting design code compliance and expanded system complexity.

97 - MATHEMATICS AND COMPUTING↗