Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization problem”

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

Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms

The computational capabilities of near-term quantum computers are limited by the noisy execution of gate operations and a limited number of physical qubits. Hybrid variational algorithms are well-suited to near-term quantum devices because they allow for a wide range of tradeoffs between the amount of quantum and classical resources used to solve a problem. This paper investigates tradeoffs available at both the algorithmic and hardware levels by studying a specific case – applying the Quantum Approximate Optimization Algorithm (QAOA) to instances of the Maximum Independent Set (MIS) problem. We consider three variants of the QAOA which offer different tradeoffs at the algorithmic level in terms of their required number of classical parameters, quantum gates, and iterations of classical optimization needed. Since MIS is a constrained combinatorial optimization problem, the QAOA must respect the problem constraints. This can be accomplished by using many multi-controlled gate operations which must be decomposed into gates executable by the target hardware. We study the tradeoffs available at this hardware level, combining the gate fidelities and decomposition efficiencies of different native gate sets into a single metric called the gate decomposition cost .

Tomesh, Teague↗
DOE OSTI2025

Data-Driven Compositional Optimization in Misspecified Regimes

With a manifold growth in the scale and intricacy of systems, the challenges of parametric misspecification become pronounced. These concerns are further exacerbated in compositional settings, which emerge in problems complicated by modeling risk and robustness. In “Data-Driven Compositional Optimization in Misspecified Regimes,” the authors consider the resolution of compositional stochastic optimization problems, plagued by parametric misspecification. In considering settings where such misspecification may be resolved via a parallel learning process, the authors develop schemes that can contend with diverse forms of risk, dynamics, and nonconvexity. They provide asymptotic and rate guarantees for unaccelerated and accelerated schemes for convex, strongly convex, and nonconvex problems in a two-level regime with extensions to the multilevel setting. Surprisingly, the nonasymptotic rate guarantees show no degradation from the rate statements obtained in a correctly specified regime and the schemes achieve optimal (or near-optimal) sample complexities for general T-level strongly convex and nonconvex compositional problems.

Business & Economics↗
DOE OSTI2024

Rapid Optimization of Total Variation with Applications in Imaging, Additive Manufacturing, and Qualification

Total Variation optimization penalizes the gradient of a control variable or state. While this work focuses on image processing in particular, it has also found applications in inverse problems and topology optimization. In image processing, the goal is to maintain faithfulness to the original image while denoising and/or deblurring. Additionally, bilevel optimization over the spatially varying regularization weights can illuminate interfaces such as damage regions and other anomalies. We will address two fundamental challenges with TV-optimization: (i) the typical slow convergence of existing TV-optimization methods, and (ii) the selection of spatially varying TV parameters to promote interface detection. Additionally, we will apply such techniques to image data collected in additive manufacturing. In said context, stochasticity in build events induces flaws in the manufactured piece, compromising the integrity of said part. There is a critical need for in-situ monitoring to spot anomalies once they form, and in this setting we apply our total variation and hyperparameter solvers. We will develop a customized algorithm based on for extreme-scale TV-optimization that achieves super-linear or quadratic-convergence, a critical property for real-time, image-by-image analysis. A worst-case outcome is a preprocessing step that enhances image quality in-situ, specifically for out-of-focus and noisy images.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Finite elements for Matérn-type random fields: Uncertainty in computational mechanics and design optimization

This work highlights an approach for incorporating realistic uncertainties into scientific computing workflows based on finite elements, focusing on prevalent applications in computational mechanics and design optimization. We leverage Matérn-type Gaussian random fields (GRFs) generated using the SPDE method to model aleatoric uncertainties, including environmental influences, variating material properties, and geometric ambiguities. Our focus lies on delivering practical GRF realizations that accurately capture imperfections and variations and understanding how they impact the predictions of computational models as well as the shape and topology of optimized designs. Here we describe a numerical algorithm based on solving a generalized SPDE to sample GRFs on arbitrary meshed domains. The algorithm leverages established techniques and integrates seamlessly with the open-source finite element library MFEM and associated scientific computing workflows, like those found in industrial and national laboratory settings. Our solver scales efficiently for large-scale problems and supports various domain types, including surfaces and embedded manifolds. We showcase its versatility through biomechanics and topology optimization applications, emphasizing the potential to influence these domains. The flexibility and efficiency of SPDE-based GRF generation empowers us to run large-scale optimization problems on 2D and 3D domains, including finding optimized designs on embedded surfaces, and to generate design features and topologies beyond the reach of conventional techniques. Moreover, these capabilities allow us to model and quantify geometric uncertainties on reconstructed submanifolds, such as the interpolated surfaces of cerebral aneurysms provided by postprocessing CT scans. In addition to offering benefits in these specific domains, the proposed techniques transcend specific applications and generalize to arbitrary forward and backward problems in uncertainty quantification involving finite elements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Optimization of Membrane-based Carbon Capture using Dimensional Analysis, CFD and Process System Engineering

Carbon capture is a promising option to mitigate CO2 emissions from existing coal-fired power plants, cement and steel industries, and petrochemical complexes. Among the available technologies, membrane-based carbon capture presents the lowest energy consumption, operating costs, and carbon footprint. In addition, membrane processes have important operational flexibil-ity and response times. On the other hand, the major challenges to widespread application of this technology are related to reducing capital costs and improving membrane stability and durability.To upscale the technology into stacked flat sheet configurations, high fidelity computational fluid dynamics (CFD) that describes the separation process accurately are required. High fidelity simulations have been shown to be effective in studying the complex transport phenomena in membrane systems. In addition, obtaining high CO2 recovery percentages and product purity requires a multi-stage membrane process, where the optimal network configuration of the membrane modules must be studied in a systematic way. In order to address the design problem at process scale, we formulate a superstructure for the membrane-based carbon capture, including up to three separation stages. In the formulation of the optimization problem, we include reduced models, based on rigorous CFD simulations of the membrane modules. Numerical results indicate that the optimal design includes three membrane stages, and the capture cost is 45.4 $/t-CO2.

Pedrozo, Hector A.↗
DOE OSTI2024

Membrane-based carbon capture process optimization using CFD modeling

Carbon capture is a promising option to mitigate CO2 emissions from existing coal-fired power plants, cement and steel industries, and petrochemical complexes. Among the available technologies, membrane-based carbon capture presents the lowest energy consumption, operating costs, and carbon footprint. In addition, membrane processes have important operational flexibility and response times. On the other hand, the major challenges to widespread application of this technology are related to reducing capital costs and improving membrane stability and durability. To upscale the technology into stacked flat sheet configurations, high fidelity computational fluid dynamics (CFD) that describes the separation process accurately are required. High fidelity simulations have been shown to be effective in studying the complex transport phenomena in membrane systems. In addition, obtaining high CO2 recovery percentages and product purity requires a multi-stage membrane process, where the optimal network configuration of the membrane modules must be studied in a systematic way. In order to address the design problem at process scale, we formulate a superstructure for the membrane-based carbon capture, including up to three separation stages. In the formulation of the optimization problem, we include reduced models, based on rigorous CFD simulations of the membrane modules. Numerical results indicate that the optimal design includes three membrane stages, and the capture cost is 45.4 $/t-CO2.

Pedrozo, Hector A.↗
DOE OSTI2026

Convex Optimization with Smart Grid Examples

In this talk, we give an overview of the field of convex optimization and work through four canonical problems that relate to electrical power systems and smart grids. The purpose of these examples is to demonstrate the breadth of applications of convex optimization in energy research and to show that toy versions of these problems can be solved in just a few lines of code, indicating the scale and complexity of problems that can be tackled with a more detailed treatment. We emphasize the cvxpy modeling language as a foundational technology that enables rapid development and prototyping of convex optimization problems, allowing researchers to focus on model development rather than get caught in the weeds of numerical and code implementation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Nonlinear optimal recovery in Hilbert spaces

Here, this paper investigates solution strategies for nonlinear problems in Hilbert spaces, such as nonlinear partial differential equations (PDEs) in Sobolev spaces, when only finite measurements are available. We formulate this as a nonlinear optimal recovery problem, establishing its well-posedness and proving its convergence to the true solution as the number of measurements increases. However, the resulting formulation might not have a finite-dimensional solution in general. We thus present a sufficient condition for the finite dimensionality of the solution, applicable to problems with well-defined point evaluation measurements. To address the broader setting, we introduce a relaxed nonlinear optimal recovery and provide a detailed convergence analysis. An illustrative example is given to demonstrate that our formulations and theoretical findings offer a comprehensive framework for solving nonlinear problems in infinite-dimensional spaces with limited data.

convergence↗
DOE OSTI2026

CRADA Number NFE-24-10110 with Qubit Engineering Inc. (CRADA Final Report)

Over the past year, the Qubit Engineering team has pushed the frontiers of power‑grid optimization, working in close collaboration with Oak Ridge National Laboratory (ORNL) and the Tennessee Valley Authority (TVA). Their progress is reflected in three newly submitted conference papers, “Unified Relational GNN Architecture for AC Optimal Power Flow Calculations in Electric Grids,” “Graph‑Based Attention Mechanisms for Solving the AC Optimal Power Flow Problem in Electrical‑Power Networks,” and “Enhanced Power‑Grid Maintenance Planning and Quantum‑Inspired Combinatorial Prospects.” These publications showcase state‑of‑the‑art graph‑neural‑network methods for AC‑OPF and novel quantum‑inspired heuristics for maintenance scheduling. Beyond the academic results, the Qubit team has converted the research into two production‑grade tools built on TVA data: Neuro‑Grid, an AI‑driven power‑flow simulator that provides instant, interactive full‑grid load‑flow visualizations, and Quanta‑Grid, a quantum‑inspired maintenance‑scheduling engine to support logistics optimization for power utilities. Together, these advances demonstrate how Qubit’s partnership with ORNL and TVA is delivering practical, physics‑grounded analytics for next‑generation grid management.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

A Demand Bidding Model for Multi-Product Industrial Plants

The growing contribution of renewable energy sources has increased volatility and uncertainty in electricity markets, challenging traditional grid operation paradigms. Demand bidding (DB), a market participation model where (large) electricity users communicate their willingness to pay for electricity to the grid operator, was shown in previous work to enhance grid stability and lower generation cost. We present a DB model for multi-product industrial plants, based on an extended optimal power flow problem where the plant dynamics are represented using autoregressive with extra inputs (ARX) models. We compare DB to price-based demand-side management, showing that, under certain assumptions, the two approaches are equivalent, while DB provides more transparency and predictability to the grid operator. A case study based on an industrial air separation unit is discussed.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

ARPA-E Grid Optimization (GO) Competition Challenge 1

The ARPA-E Grid Optimization (GO) Competition Challenge 1, from 2018 to 2019, focused on the basic Security Constrained AC Optimal Power Flow problem (SCOPF) for a single time period. The Challenge utilized sets of unique datasets generated by the ARPA-E GRID DATA program. Each dataset consisted of a collection of power system network models of different sizes with associated operating scenarios (snapshots in time defining instantaneous power demand, renewable generation, generator and line availability, etc.). The datasets were of two types: Real-Time, which included starting-point information, and Online, which did not. Week-Ahead data is also provided for some cases but was not used in the Competition. Although most datasets were synthetic and generated by GRIDDATA, a few came from industry and were only used in the Final Event. All synthetic Input Data and Team Results for the GO Competition Challenge 1 for the Sandbox, Trial Events 1 to 3, and the Final Event along with problem, format, scoring and rules descriptions are available here. Data for industry scenarios will not be made public. Challenge 1, a minimization problem, required two computational steps. Solver 1 or Code 1 solved the base SCOPF problem under a strict wall clock time limit, as would be the case in industry, and reported the base case operating point as output, which was used to compute the Objective Function value that was used as the scenario score. The feasibility of the solution was provided by the Solver 2 or Code 2, which solves the power flow problem for all contingencies based on the results from Solver 1. This is not normally done in industry, so the time limits were relaxed. In fact, there were no time limits for Trial Event 1. This proved to be a mistake, with some codes running for more than 90 hours, and a time limit of 2 seconds per contingency was imposed for all other events. Entrants were free to use their own Solver 2 or use an open-source version provided by the Competition. Containers, such as Docker, were considered to improve the portability of codes, but none that could reliably support a multi-node parallel computing environment, e.g., MPI, could be found. For more information on the competition and challenge see the "GO Competition Challenge 1 Information" and "GO Competition Challenge 1 Additional Information" resources below.

ACOPF↗
DOE OSTI2024

Membrane-based Carbon Capture Process Optimization using CFD Modeling

Carbon capture is a promising option to mitigate CO2 emissions from existing coal-fired power plants, cement and steel industries, and petrochemical complexes. Among the available technologies, membrane-based carbon capture presents the lowest energy consumption, operating costs, and carbon footprint. In addition, membrane processes have important operational flexibility and response times. On the other hand, the major challenges to widespread application of this technology are related to reducing capital costs and improving membrane stability and durability. To upscale the technology into stacked flat sheet configurations, high fidelity computational fluid dynamics (CFD) that describes the separation process accurately are required. High fidelity simulations have been shown to be effective in studying the complex transport phenomena in membrane systems. In addition, obtaining high CO2 recovery percentages and product purity re-quires a multi-stage membrane process, where the optimal network configuration of the mem-brane modules must be studied in a systematic way. In order to address the design problem at process scale, we formulate a superstructure for the membrane-based carbon capture, including up to three separation stages. In the formulation of the optimization problem, we include reduced models, based on rigorous CFD simulations of the membrane modules.

Pedrozo, Hector A.↗
DOE OSTI2024

Efficient conversion of syngas to linear α-olefins by phase-pure χ-Fe5C2

Abstract Oil has long been the dominant feedstock for producing fuels and chemicals, but coal, natural gas and biomass are increasingly explored alternatives 1–3 . Their conversion first generates syngas, a mixture of CO and H 2 , which is then processed further using Fischer–Tropsch (FT) chemistry. However, although commercial FT technology for fuel production is established, using it to access valuable chemicals remains challenging. A case in point is linear α-olefins (LAOs), which are important chemical intermediates obtained by ethylene oligomerization at present 4–8 . The commercial high-temperature FT process and the FT-to-olefin process under development at present both convert syngas directly to LAOs, but also generate much CO 2 waste that leads to a low carbon utilization efficiency 9–14 . The efficiency is further compromised by substantially fewer of the converted carbon atoms ending up as valuable C 5 –C 10 LAOs than are found in the C 2 –C 4 olefins that dominate the product mixtures 9–14 . Here we show that the use of the original phase-pure χ-iron carbide can minimize these syngas conversion problems: tailored and optimized for the process of FT to LAOs, this catalyst exhibits an activity at 290 °C that is 1–2 orders higher than dedicated FT-to-olefin catalysts can achieve above 320 °C (refs. 12–15 ), is stable for 200 h, and produces desired C 2 –C 10 LAOs and unwanted CO 2 with carbon-based selectivities of 51% and 9% under industrially relevant conditions. This higher catalytic performance, persisting over a wide temperature range (250–320 °C), demonstrates the potential of the system for developing a practically relevant technology.

Science & Technology - Other Topics↗
DOE OSTI2024

Security constrained optimal power shutoff for wildfire risk mitigation

Abstract Electric grid faults are increasingly the source of ignition for major wildfires. To reduce the likelihood of such ignitions in high risk situations, utilities use preemptive de‐energization of power lines, commonly referred to as Public Safety Power Shutoffs (PSPS). Besides raising challenging trade‐offs between power outages and wildfire safety, PSPS removes redundancy from the network at a time when component faults are likely to happen. This may leave the network particularly vulnerable to unexpected line faults that may occur while the PSPS is in place. Previous works have not explicitly considered the impacts of these outages. To address this gap, the Security Constrained Optimal Power Shutoff problem is proposed which uses post‐contingency security constraints to model the impact of unexpected line faults when planning a PSPS. This model enables, for the first time, the exploration of a wide range of trade‐offs between both wildfire risk and pre‐ and post‐contingency load shedding when designing PSPS plans, providing useful insights for utilities and policy makers considering different approaches to PSPS. The efficacy of the model is demonstrated using the EPRI 39‐bus system as a case study. The results highlight the potential risks of not considering security constraints when planning PSPS and show that incorporating security constraints into the PSPS design process improves the resilience of current PSPS plans.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2025

A hybrid neural architecture: Online attosecond x-ray characterization

The emergence of high-repetition-rate x-ray free-electron lasers (XFELs), such as SLAC’s LCLS-II, serves as our canonical example for autonomous controls that necessitate high-throughput diagnostics paired with streaming computational pipelines capable of single-shot analysis with extremely low latency. We present the deterministic characterization with an integrated parallelizable hybrid resolver architecture, a hybrid machine learning framework designed for fast, accurate analysis of XFEL diagnostics using angular streaking-based sinogram images. This architecture integrates convolutional neural networks and bidirectional long short-term memory models to denoise input, identify x-ray sub-spike features, and extract sub-spike relative delays with sub-30 attosecond temporal resolution. Deployed on low-latency hardware, it achieves over 10 kHz throughput with 168.3 μs inference latency, indicating scalability to 14 kHz with field-programmable gate array integration. By transforming regression tasks into classification problems and leveraging optimized error encoding, we achieve high precision with low-latency performance that is critical for real-time streaming event selection and experimental control feedback signals. This represents a key development in real-time control pipelines for next-generation autonomous science, generally, and high repetition-rate x-ray experiments in particular.

Accelerator Physics (physics.acc-ph)↗