Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization algorithms”

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 649 records · Page 36
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

MLOps for Beam Controls

Machine learning operations (MLOps) is the standardization and streamlining of the ML development lifecycle to address the challenges associated with large-scale machine learning applications. The full MLOps pipeline consists of open-source tools: DataHub, MinIO and MLflow. It is being used for dataset management and model development to handle changing data dependencies, varying business needs, reproducibility, and diverse teams working with differing tools and skills. To demonstrate the completion of an MLOps pipeline for particle accelerator operations, we are deploying a simple script that computes settings for the Booster’s gradient magnet power supply. Once the demonstration is complete, we will develop and deploy ML-based optimization algorithms to improve Booster’s overall efficiency. This MLOps pipeline opens the gate to systematically develop and deploy ML applications for accelerator controls and diagnostics.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

QFw: A Quantum Framework for Large-scale HPC Ecosystems

This work extends Quantum Framework (QFw) by integrating it with Northwest Quantum Simulator (NWQ-Sim) and by introducing a lightweight python library that allows multiple frontends (e.g., Qiskit) to interact with QFw. This extension enables QFw to flexibly decouple frontends from backends (e.g., NWQ-Sim). We demonstrate this capability by executing a Greenberger-Horne-Zeilinger (GHZ) circuit using Qiskit and Pennylane with NWQ-Sim and Tensor-Network Quantum Virtual-Machine (TN-QVM). QFw enables easy scaling to multiple nodes. We showcase this with scaling tests using GHZ with up to 32 qubits for different number of nodes on the Frontier supercomputer. And, to demonstrate the use of QFw for real world problems, we solve a metamaterial optimization problem, using a Quantum Approximate Optimization Algorithm (QAOA). We observe that QFw over NWQ-Sim marginally improves Qiskit-aer’s accuracy in reaching the lowest energy state. These additions to QFw prepare it to run hybrid applications in a hybrid resource environment since it treats actual quantum hardware and simulators alike.

Chundury, Srikar↗
DOE OSTI2026

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗
DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗
DOE OSTI2026

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗
DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗
DOE OSTI2026

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗
DOE OSTI2025

Nondestructive Evaluation of Concrete: Elastic Property Imaging Through Full Waveform Inversion

Concrete is a major construction material worldwide and plays a crucial role in the nuclear industry. The elastic properties of concrete are prone to change and degrade while in service, as it is often subjected to extreme operational and environmental conditions. An accurate evaluation of concrete's elastic properties is thus essential to ensure structural integrity and safety. This is especially true for concrete in nuclear power plants, where irradiation effects significantly impact concrete mechanical properties. There are various methods to assess these properties, with ultrasound-based techniques showing high potential due to their nondestructive nature, cost-effectiveness, and safety. While several nondestructive evaluation methods exist, most rely on idealizations such as assuming homogeneous material and plane wavefronts. In this work, we address these issues by introducing an ultrasound-based nondestructive method aimed at reconstructing spatially varying images of concrete mechanical properties. By accurately modeling wave physics, including scattering and reflection, we overcome several of the aforementioned idealizations and aim to utilize the full waveform for imaging material properties through depth, resulting in more reliable images. Full waveform inversion (FWI) was first introduced by geophysicists to reconstruct subsurface elastic property images. The goal is to minimize the difference between simulated and recorded wavefield signals, often through gradient-based optimization algorithms. While FWI is primarily conducted using the acoustic approximation of the wave equation, few works focus on elastic FWI, where the goal is to reconstruct images of not only the pressure wave speed but also the shear wave speed and density (or their equivalents). This work explores the potential of using elastic FWI to predict concrete mechanical properties as an initial effort for a more accurate monitoring of concrete conditions in service. Reconstructing images of different elastic parameters enables more specificity and accurate condition diagnosis. This paper will detail this approach and provide examples demonstrating the effectiveness of elastic FWI in reconstructing comprehensive maps of concrete mechanical properties.

42 - ENGINEERING↗
DOE OSTI2026

Data Analytics Methods to Measure Plant Outage Resilience

Every 18 or 24 months nuclear power plants (depending on plant configuration, pressurized or boiling water reactor respectively) undergo a period of outage where the plant is taken offline and a large number of maintenance and surveillance activities (that cannot be performed while plant is running) are performed in typically 2–3 weeks. Planning of a plant outage is very challenging since all the activities are required to be performed in the shortest amount of time given available resources (typically contractor crews hired for the duration of the outage). Consequently, plant outages can be costly due the actual loss of power generation and crew costs and, because of it, there is a need to maximize resource usage in the outage planning phase and reduce the risk of outage delays. This paper is addressing these needs by providing a set of analytical methods designed to analyze plant outage schedule and identify critical elements based on available resources (time and crews). These methods are based on natural language processing and optimization algorithms. In this respect, two classes of methods have been developed: one that focuses on the time resource and how variability in the time to complete outage tasks may impact outage delays, and one that minimizes the risk of outage delays by integrating available resources to assess when daily activities should be performed.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Nondestructive Evaluation of Concrete: Elastic Property Imaging Through Full-Waveform Inversion

Concrete is a vital material in construction—especially in the nuclear industry, where it is used in critical structures such as containment vessels. Over time, concrete can degrade due to harsh operational and environmental conditions, necessitating that its elastic properties be accurately evaluated to ensure structural integrity and safety. Traditional nondestructive evaluation methods such as ultrasound-based techniques often rely on simplifying assumptions that may not hold true for concrete. This paper presents an advanced ultrasound-based method that uses elastic full-waveform inversion (EFWI) to create detailed images of concrete’s mechanical properties. By accurately modeling wave behaviors such as scattering and reflection, we aim to overcome the limitations of conventional ultrasonic-based methods. In this work, the imaging problem involved reconstructing the various elastic properties of a heterogenous concrete block with three steel rebars embedded in it. The ultrasonic measurements were synthetically generated from multiple sources and receivers, and the reconstruction process was performed using a gradient-based optimization algorithm. Our approach leveraged EFWI to reconstruct high-resolution images of the pressure wave speed, shear wave speed, and density. Multiple misfit functions—including L2-norm, cross-correlation (CC), and L1-norm—combined with total variation (TV) regularization and parameter constraints using a Sigmoid function—were explored for the reconstruction. The results demonstrated that using the L1-norm misfit function in conjunction with TV regularization and Sigmoid constraints significantly improved the reconstruction quality in comparison to traditional methods. This approach provided clearer images with fewer artifacts and better captured background heterogeneity. Our findings highlight that, when properly designed, EFWI carries great potential for providing comprehensive, more accurate, and more reliable assessments of concrete conditions, as is crucial for the maintenance and safety of nuclear power plant structures.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗
DOE OSTI2023

Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems

Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Algorithm for Nonlinear Optimization of Finishing Operations

A model is proposed for nonlinear optimization of final turning. On that basis, an automated computational algorithm is developed. The algorithm maximizes the productivity, while maintaining specified quality of the machined surface.

42 ENGINEERING↗
DOE OSTI2022

The Application of a Genetic Algorithm to the Optimization of a Mesoscale Model for Emergency Response

Besides solving the equations of momentum, heat, and moisture transport on the model grid, mesoscale weather models must account for subgrid-scale processes that affect the resolved model variables. These are simulated with model parameterizations, which often rely on values preset by the user. Such “free” model parameters, along with others set to initialize the model, are often poorly constrained, requiring that a user select each from a range of plausible values. Finding the values to optimize any forecasting tool can be accomplished with a search algorithm, and one such process—the genetic algorithm (GA)—has become especially popular. As applied to modeling, GAs represent a Darwinian process: an ensemble of simulations is run with a different set of parameter values for each member, and the members subsequently judged to be most accurate are selected as “parents” who pass their parameters onto a new generation. At the U.S. Department of Energy’s Savannah River Site in South Carolina, we are applying a GA to the Regional Atmospheric Modeling System (RAMS) mesoscale weather model, which supplies input to a model to simulate the dispersion of an airborne contaminant as part of the site’s emergency response preparations. An ensemble of forecasts is run each day, weather data are used to “score” the individual members of the ensemble, and the parameters from the best members are used for the next day’s forecasts. As meteorological conditions change, the parameters change as well, maintaining a model configuration that is best adapted to atmospheric conditions. Significance Statement We wanted to develop a forecasting system by which a weather model is run over the Savannah River Site each day and repeatedly adjusted according to how well it performed the previous day. To run the model, a series of values (parameters) must be set to control how the model will calculate winds, temperatures, and other desired variables. Each day the model was run several times using different combinations of these parameters and later compared with observed meteorological conditions. Parameters that produced the most accurate forecasts were preferentially reused to create the forecasts for the next day. The process was tested for the summer of 2020 and exhibited lower errors than forecasts produced by the model using default values of the parameters.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

T3CO (Transportation Technology Total Cost of Ownership) Open Source [SWR-21-54]

T3CO (Transportation Technology Total Cost of Ownership), is open source software for modeling total cost of ownership for commercial vehicles with advanced powertrains. T3CO is a modeling framework for determining geospatially and temporally optimized total cost of ownership (TCO) for vehicle powertrain technologies. T3CO runs NREL's FASTSim™ software for a representative set of operating conditions to minimize TCO based on vehicle parameters that affect purchase and operating costs (e.g., fuel/electricity consumption, asset depreciation, opportunity costs associated with charging time) while simultaneously ensuring that firm performance constraints (e.g. zero-to-sixty time, gradeability) are satisfied. T3CO will enable the user to control which powertrain parameters are used in optimizing TCO, and these parameters will be modified by a multi-objective optimization (MOO) algorithm to identify a Pareto-optimal solution set. The optimization algorithm will be modular so that users can choose from many different MOO options or insert their own user-defined optimization tool. NREL T3CO Homepage: https://www.nrel.gov/transportation/t3co.html PyPI package: https://pypi.org/project/t3co/

Lustbader, Jason↗
DOE OSTI2023

Complete Performance Comparison Between the Optimized Image Construction Algorithm (U-MBIR) and the Existing Reconstruction Algorithm for Detecting Defects and Damage in Concrete

Reinforced concrete (RC) is a composite material subjected to mechanical, thermal, and chemical loads throughout its service life. Because of these external stressors and the susceptibility of RC structural members to shrinkage and microcracking, the material degrades throughout its life cycle. This deterioration can lead to a decrease in member capacity and, ultimately, poses a threat to the structural integrity. Thus, it is crucial that the damage caused by aging and degradation be monitored and assessed at regular intervals throughout the material’s service life. Since coring of the material is typically not feasible for in-service structural systems, non-destructive evaluation (NDE) methodologies are used to assess remaining structural capacity. NDE methods enable surface and subsurface examination without damaging or degrading the medium. Moreover, RC is a critical component of nuclear power plants; thus, its safety and reliability must be thoroughly examined throughout the life cycle of the structural system. Ultrasonic measurements have been an industry standard for both surface and subsurface inspections. To this end, Oak Ridge National Laboratory (ORNL) has researched and developed advanced image reconstruction algorithms to capture internal damage. The results and discussion presented herein summarize the current state of the ultrasonic model–based iterative reconstruction (U-MBIR) algorithm developed at ORNL. More specifically, this report presents a comparison between reconstruction images produced via a widely employed ultrasonic NDE technique—the synthetic aperture focusing technique (SAFT)—and the ORNL-developed U-MBIR algorithm. These NDE methodologies are demonstrated using ultrasonic data collected from four concrete specimens. Overall, the U-MBIR algorithm eliminates artifacts and noise that are typically present within the SAFT reconstructions, and it shows defects and anomalies more clearly than the SAFT images. In conclusion, this algorithm is suitable for identifying concrete defects, although more improvements and optimization could be done to better define internal defects.

36 MATERIALS SCIENCE↗
DOE OSTI2024

A Novel Noise-Aware Classical Optimizer for Variational Quantum Algorithms

A key component of variational quantum algorithms (VQAs) is the choice of classical optimizer employed to update the parameterization of an ansatz. It is well recognized that quantum algorithms will, for the foreseeable future, necessarily be run on noisy devices with limited fidelities. Thus, the evaluation of an objective function (e.g., the guiding function in the quantum approximate optimization algorithm (QAOA) or the expectation of the electronic Hamiltonian in variational quantum eigensolver (VQE)) required by a classical optimizer is subject not only to stochastic error from estimating an expected value but also to error resulting from intermittent hardware noise. Model-based derivative-free optimization methods have emerged as popular choices of a classical optimizer in the noisy VQA setting, based on empirical studies. However, these optimization methods were not explicitly designed with the consideration of noise. In this work we adapt recent developments from the “noise-aware numerical optimization” literature to these commonly used derivative-free model-based methods. We introduce the key defining characteristics of these novel noise-aware derivative-free model-based methods that separate them from standard model-based methods. In conclusion, we study an implementation of such noise-aware derivative-free model-based methods and compare its performance on demonstrative VQA simulations to classical solvers packaged in scikit-quant.

classical optimizers↗