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

Labeling sequential data from noisy annotations

Crowdsourcing algorithms often work under the assumption that the data samples are independent. Recent work has shown that data dependence, such as temporal correlations in sequential data, can be leveraged to improve the label quality. Existing methods that exploit this special structure rely on third-order statistics of the annotator outputs to ensure the identifiability of key latent parameters, which are costly to acquire. This work proposes an approach for integrating crowdsourced annotations under the Dawid-Skene/Hidden Markov Model (DS-HMM) for sequential data based on second-order statistics, which naturally enjoys a lower sample complexity. An effective algorithm is proposed to tackle the challenging optimization problem associated with the proposed estimator. Numerical experiments showcase the effectiveness of the data labeling paradigm.

Marrinan, Timothy P.↗
DOE OSTI2024

On the Training and Generalization of Deep Operator Networks

Here, we present a novel training method for deep operator networks (DeepONets), one of the most popular neural network models for operators. DeepONets are constructed by two subnetworks, namely the branch and trunk networks. Typically, the two subnetworks are trained simultaneously, which amounts to solving a complex optimization problem in a high dimensional space. In addition, the nonconvex and nonlinear nature makes training very challenging. To tackle such a challenge, we propose a two-step training method that trains the trunk network first and then sequentially trains the branch network. The core mechanism is motivated by the divide-and-conquer paradigm and is the decomposition of the entire complex training task into two subtasks with reduced complexity. Therein the Gram–Schmidt orthonormalization process is introduced which significantly improves stability and generalization ability. On the theoretical side, we establish a generalization error estimate in terms of the number of training data, the width of DeepONets, and the number of input and output sensors. Numerical examples are presented to demonstrate the effectiveness of the two-step training method, including Darcy flow in heterogeneous porous media.

deep operator networks↗
DOE OSTI2025

ChemComp: A Compilation Framework for Computing with Chemical Reaction Networks

The acceleration of scientific computation, data analytics, and artificial intelligence is driving a surge in computational requirements. Yet, state-of-the-art high-performance computing systems are approaching physical limitations that impede further significant improvements in energy efficiency. As we move towards post-exascale computing systems, innovative approaches are necessary to overcome this barrier in power consumption. Novel analog and hybrid digital-analog architectures hold promise for enhancing energy efficiency by several orders of magnitude. Biochemical computation stands out among the various solutions being explored due to its potential to enable new classes of devices with immense computational capabilities. These devices can capitalize on the inherent efficacy of biological cells in solving optimization problems and are scalable through increasing reaction system size or vessel capacity, potentially satisfying scientific computing's high-performance requirements. Nonetheless, several theoretical and practical limitations persist, including problem formulation and mapping to chemical reaction networks (CRNs) and implementation of actual CRN devices. In this paper, we propose a framework for biochemical computation using systems chemistry. We present the initial components of our approach: an abstract chemical reaction dialect implemented as a multi-level intermediate representation (MLIR) compiler extension and a pathway to represent mathematical problems with CRNs. To showcase the potential of this approach, we emulate a simplified chemical reservoir device. This work lays the groundwork for leveraging chemistry's computing potential in creating energy-efficient, high-performance computing systems tailored to contemporary computational needs.

artificial intelligence↗
DOE OSTI2024

Ontologies at Work: Analyzing Information Requirements for Model Predictive Control in Buildings

Model Predictive Control (MPC) has shown significant potential for improving energy efficiency, indoor air quality and occupant comfort of buildings. MPC-based control algorithms have also shown the ability to shift loads and optimize for multiple objectives, including but not limited to reducing the green-house gas emissions, energy costs and peak demand. However, one of the main implementation challenges of these control algorithms is the integration and configuration effort needed to deploy a supervisory MPC controller in a building. By assigning standardized references to information sources and control points in buildings, existing studies have shown that semantic ontologies and corresponding queries have the potential to ease the deployment of such controllers. Yet, the use of semantic information to ease the deployment processes of MPC controllers is still limited. In this paper, we review three MPC experiments and synthesize the information requirements of these optimization problems. We then turn to existing and upcoming semantic ontologies such as Brick, SAREF and ASHRAE Standard 223 to represent these requirements, evaluating their potential to support the implementation of an MPC controller. This investigation concludes with a discussion of existing opportunities and open questions that the community should explore to support more streamlined MPC implementations.

Prakash, Anand Krishnan↗
DOE OSTI2025

hdsullivan/ResSR

This is the official implementation of ResSR [1]. ResSR is a computationally efficient MSI-SR method that achieves high-quality reconstructions by using a closed-form spectral decomposition along with a spatial residual correction. ResSR applies singular value decomposition to identify correlations across spectral bands, uses pixel-wise computation to upsample the MSI, and then applies a residual correction process to correct the high-spatial frequency components of the upsampled bands. While ResSR is formulated as the solution to a spatially-coupled optimization problem, we use pixel-wise regularization and derive an approximate closed-form solution, resulting in a pixel-wise algorithm with a dramatic reduction in computation that achieves state-of-the-art reconstructions. [1] Duba-Sullivan, H., Reid, E. J., Voisin, S., Bouman, C. A., & Buzzard, G. T. (2024). ResSR: A Computationally Efficient Residual Approach to Super-Resolving Multispectral Images. arXiv preprint arXiv:2408.13225.

Duba-Sullivan, Haley [Oak Ridge National Laborator↗
DOE OSTI2025

Adaptive Computing (AC) [SWR-24-106]

The Adaptive Computing (AC) software stack supports goal-based computing, for which a simulation workload is created on the fly adapting to the results of calculations. Application-specific code defines an objective, which may be to solve an optimization problem or to train a surrogate model with minimal uncertainty. Then, the AC driver decides where in the design parameter space to run simulations to best achieve that objective. This process is iterative and online; as new data is returned from simulations, the AC driver chooses new simulations to run. The AC driver can strategically run simulations on distributed hardware resources (including high performance computing machines, cloud resources, and edge devices) to maximize throughput and obey resource constraints.

Griffin, Kevin [National Renewable Energy Laborato↗
DOE OSTI2025

blastforge

BlastForge is a python module meant to aid reinforcement learning research for geometry optimization research projects. The code is built to use PyTorch as a backend and will contain several model architectures and reinforcement learning training loops as well as helper python functions to evaluate a model’s performance during and after training. BlastForge is meant to be a small, focused python project to study moderate-complexity geometry optimization problems

Hickmann, Kyle [Los Alamos National Laboratory]↗
DOE OSTI2025

Homotopy Solver

This software implements parallel versions of an interior-point solver, based on the publicly available ipopt solver. Here we have full control over the linear solver and our algorithm is fully parallel thus enabling scalability to large-scale optimization problems. This package also has a parallel implementation of a homotopy solver developed under the scalable methods for contact LDRD project 23-ERD-017. This solver is an mfem-based implementation of algorithm described in ``A filter trust-region Newton continuation method for nonlinear complementarity problems''. Cosmin G. Petra, Nai-Yuan Chiang, Jingyi Wang, Tucker Hartland, and Michael Puso (submitted), LLNL-JRNL-869761.

Hartland, Tucker [Lawrence Livermore National Labo↗
DOE OSTI2026

BLING

The Bounded Linearized Iteration for Natural Gas (BLING) algorithm solves an optimization problem for gas pipeline flow scheduling that maximizes economic surplus and minimizes the energy used for gas compression subject to pressure, flow, and engineering constraints.

Zlotnik, Anatoly↗
DOE OSTI2026

Adaptive Computing (AC) (Open Source) [SWR-24-106]

The Adaptive Computing (AC) software stack supports goal-based computing, for which a simulation workload is created on the fly, adapting to the results of calculations. Application-specific code defines an objective, which may be to solve an optimization problem or to train a surrogate model with minimal uncertainty. Then, the AC driver decides where in the design parameter space to run simulations to best achieve that objective. This process is iterative and online; as new data is returned from simulations, the AC driver chooses new simulations to run. The AC driver can strategically run simulations on distributed hardware resources (including high performance computing machines, cloud resources, and edge devices) to maximize throughput and obey resource constraints.

Griffin, Kevin [National Laboratory of the Rockies↗
DOE OSTI2026

RegularizedOptimization.jl: A Julia framework for regularized and nonsmooth optimization

RegularizedOptimization.jl is a Julia package that implements families of quadratic regularization and trust-region methods for solving the nonsmooth optimization problem $^{\textrm{minimize}}_{𝑥∈ℝ^𝑛}$ 𝑓(𝑥) + ℎ(𝑥) subject to 𝑐(𝑥) = 0, (1) where 𝑓 ∶ ℝ 𝑛 → ℝ and 𝑐 ∶ ℝ 𝑛 → ℝ 𝑚 are continuously differentiable, and ℎ ∶ ℝ 𝑛 → ℝ∪{+∞} is lower semi-continuous. The nonsmooth objective ℎ can be a regularizer, such as a sparsity inducing penalty, model simple constraints, such as 𝑥 belonging to a simple convex set, or can be a combination of both. All 𝑓, ℎ, and 𝑐 can be nonconvex. RegularizedOptimization.jl provides a modular and extensible framework for solving (1), and developing novel solvers. Currently, the following solvers are implemented: • Trust-region solvers TR and TRDH (Aravkin et al., 2022; Leconte & Orban, 2025) • Quadratic regularization solvers R2, R2DH and R2N (Aravkin et al., 2022; Diouane, Habiboullah, et al., 2024) • Levenberg-Marquardt solvers LM and LMTR (Aravkin et al., 2024) used when 𝑓 is a least-squares residual. • Augmented Lagrangian solver AL (De Marchi et al., 2023). All solvers rely on first derivatives of 𝑓 and 𝑐, and optionally on their second derivatives in the form of Hessian-vector products. If second derivatives are not available, quasi-Newton approximations can be used. In addition, the proximal mapping of the nonsmooth part ℎ, or adequate models thereof, must be evaluated. At each iteration, a step is computed by solving a subproblem of the form (1) inexactly, in which 𝑓, ℎ, and 𝑐 are replaced with appropriate models around the current iterate. The solvers R2, R2DH, and TRDH are particularly well suited to solve the subproblems, though they are general enough to solve (1). All solvers are allocation-free, so re-solves incur no additional allocations. To illustrate our claim of extensibility, a first version of the AL solver was implemented by an external contributor. Furthermore, a nonsmooth penalty approach, described in Diouane, Gollier, et al. (2024), is currently being developed, that relies on the library to efficiently solve the subproblems.

Gollier, Maxence [Polytechnique Montréal, QC (Cana↗
DOE OSTI2024

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

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

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Design and Optimization of Processes for Recovering Rare Earth Elements from End-of-Life Hard Disk Drives

In this poster, we first provide motivation for why rare earth elements as rare earth permanent magnets (REPM) are increasing in demand. We then highlight some of the recent work that has been done by several national labs (National Renewable Energy Laboratory (NREL), Environmental Protection Agency (EPA), Critical Minerals Institute (CMI)) on recycling rare earth elements from end-of-life hard disk drives (EOL). Then, we mention our long-term plan to design a feedstock agnostic process to recover rare earth elements as rare earth oxides from many different EOL products at once. Next, we discuss how we quantified the rare earth elements available for recycling from EOL hard disk drives from consumer desktops and laptops. We then discuss how we used superstructure optimization to design the optimal pathway. The proposed superstructure was modeled as a MILP optimization problem, selecting the net present value as the objective function. Costing data from the literature was used to inform this model whenever possible. However, due to the novelty of this research area, data were often unavailable, thus requiring the generation of flowsheets implemented in Aspen Plus.

Laliwala, Chris↗
DOE OSTI2026

Transitions, Dynamics, and Driven States in Quantum Magnets (Final Report Revised)

Transitions into unusual electronic, optical, and magnetic states at the absolute zero of temperature display special properties that teach us about fundamental quantum mechanics and also underlie important technologies. These so-called quantum phase transitions intertwine the static and dynamical responses of the materials changing state. They are extremely sensitive to the effects of disorder and etch in high relief the role of quantum fluctuations. There are ample questions remaining about the character of such transitions and the nature of the competing quantum states. There are also opportunities to drive quantum materials out of equilibrium, with the possibility of new types of correlated and coherent order, and new ways to access the dynamical evolution of ground and excited states. We have investigated how the order develops in time and space, and the nature of the final configurations. We are able to compare and contrast classical and quantum excitations in our experimental system of choice, and thereby can trace the relative speed by which the system settles into its lowest-energy ground state. This comparison of quantum and classical annealing protocols lies at the heart of strategies for harnessing the power of quantum computers dedicated to optimization problems. A combination of magnetic susceptibility measurements at finite frequency where the magnetic spins are queried by an external ac field, dc magnetometry measurements that characterize the macroscopic strength of magnetic order and its resistance to change, noise measurements that reveal the microscopic fluctuations of the spins as they prepare to change state, and microwave spectroscopy to look at the response of both the electronic and nuclear degrees of freedom, have been performed as functions of temperature, magnetic field, frequency, excitation amplitude, magnetic spin concentration, and disorder. This combination of probes addresses issues of stability over time, overlap between spin states, the ability of the spins to respond independently or coherently, and the promise of control on the nanometer length scale. The research reported here provides insights into fundamental quantum physics. It also addresses the question of how best to use complex systems, such as magnetic solids, to stably process quantum information.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Hybridization Assessment of Trybrid Pumped Storage Hydropower System—Part 1: A Case Study of Corral Summit

This report is a part of the deliverables for technical assistance provided to Cat Creek Energy for the Coral Summit Trybrid (Triple Hybrid-Pumped Storage Hydropower, Battery Energy Storage System, and photovoltaic solar energy) energy project. This report explores the operational benefits and challenges of hybridizing an open loop PSH (200MW) located at Mackay, Custer County, Idaho with solar PV (Ground mount 300MW and floating 40MW) and battery (720MWhr). This document reports two activities performed as a part of the hybridization assessment task 1) optimal resource allocation and energy management strategy, and 2) power quality and reliability assessment. From optimal resource allocation and energy management strategy (activity 1), the following key findings can be observed: • Conventional PSH (CPSH) with two reversible pump turbines and separate penstocks can provide required flexibility equivalent to that from two ternary PSH with separate penstock. With single unit CPSH, upper reservoir head cannot be maintained accurately, the variation of water level is rapid and pump mode flexibility is not available. These disadvantages can be overcome by single unit TPSH. However, using two CPSH units with separate penstocks also overcome these disadvantages with the formation of the hydraulic short circuit between two conventional units. • Flooding of the lower reservoir is a severe concern when considering continuous operation for black start. This limits the duration of continuous operation from PSH alone to around 50 hours. Due to the complementary PV and battery action, the duration of continuous operation and smooth power output can be extended. • An optimization problem is framed that maximizes the power output on an hourly basis while minimizing constraint violations and respecting seasonal variations of solar PV and load profiles . Two value streams, arbitrage and baseload generation are served by this profile. It was uncovered that for smooth power output during regular operation, PV curtailment will be required, or the battery capacity needs to be increased above 90MW to accommodate additional PV. From power quality and reliability assessment (activity 2) the following takeaway points can be observed: • The Trybrid, when integrated at the Lost River bus, and limited to 250MW in generation mode and -150MW in the pump mode, causes no violation of voltage or flow.

13 - HYDRO ENERGY↗
DOE OSTI2026

Searching for the Most Harmful Field Errors in the HSR IR Superconducting Magnets

In this project, we improve beam stability for the Electron-Ion Collider. Magnetic field errors can reduce beam stability, making it essential to identify the field errors that have the greatest impact on accelerator performance. However, this is particularly challenging because beam stability depends on the complex interactions of many magnetic field errors, resulting in a high-dimensional and nonlinear optimization problem. We determine which field errors are the most influential for the large physical aperture superconducting magnet B2PF, a critical magnet in the Interaction Region (IR) in the Hadron Storage Ring (HSR). We complete and analyze nearly 30,000 simulations on the Brookhaven National Laboratory Linux Cluster by varying 18 nonlinear magnetic field errors. We evaluate beam stability using the dynamic aperture and the tune diffusion. We identify the field errors that most strongly influence beam stability and establish quantitative field error tolerances that improve accelerator performance.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Neural Networks for Prediction of Complex Chemistry in Water Treatment Process Optimization

Water chemistry plays a critical role in the design and operation of water treatment processes. Detailed chemistry modeling tools use a combination of advanced thermodynamic models and extensive databases to predict phase equilibria and reaction phenomena. The complexity and formulation of these models preclude their direct integration in equation-oriented modeling platforms, making it difficult to use their capabilities for rigorous water treatment process optimization. Neural networks (NN) can provide a pathway for integrating the predictive capability of chemistry software into equation-oriented models and enable optimization of complex water treatment processes across a broad range of conditions and process designs. Herein, we assess how NN architecture and training data impact their accuracy and use in equation-oriented water treatment models. We generate training data using PhreeqC software and determine how data generation and sample size impact the accuracy of trained NNs. The effect of NN architecture on optimization is evaluated by optimizing hypothetical black-box desalination processes using a range of feed compositions from USGS brackish water data set, tracking the number of successful optimizations, and testing the impact of initial guess on the final solution. Our results clearly demonstrate that data generation and architecture impact NN accuracy and viability for use in equation-oriented optimization problems.

Dudchenko, Alexander V↗
DOE OSTI2024

A Data-Driven Approach for High-Impedance Fault Localization in Distribution Systems: Preprint

Accurate and quick identification of high-impedance faults (HIFs) is critical for the reliable operation of distribution systems. Unlike other faults in power grids, HIFs are very difficult to detect by conventional overcurrent relays due to the low fault current. Although HIFs can be affected by various factors, the voltage-current characteristics can substantially imply how the system responds to the disturbance and thus provides opportunities to effectively localize HIFs. In this work, we propose a data-driven approach for the identification of HIF events. To tackle the nonlinearity of the voltage-current trajectory, first, we formulate optimization problems to approximate the trajectory with piecewise functions. Then we collect the function features of all segments as inputs and use the support vector machine approach to efficiently identify HIFs at different locations. Numerical studies on the IEEE 123-node test feeder demonstrate the validity and accuracy of the proposed approach for real-time HIF identification.

explainable artificial intelligence↗