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.

SourceResearch connectionFrom yearThrough year

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

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

DOE OSTI2026

FIRM: federated image reconstruction using multimodal tomographic data

Here, we propose a federated algorithm for reconstructing images using multimodal tomographic data sourced from dispersed locations, addressing the challenges of traditional unimodal approaches that are prone to noise and reduced image quality, as well as the limitations of centralized multimodal approaches that require extensive data transfer, leading to significant communication overhead, storage demands, and potential data privacy concerns. Our approach formulates a joint inverse optimization problem incorporating multimodality constraints and solves it in a federated framework through local gradient computations complemented by lightweight central operations, thereby ensuring data decentralization. Leveraging the connection between our federated algorithm and the quadratic penalty method, we introduce an adaptive step-size rule with guaranteed sublinear convergence. Numerical results demonstrate superior computational efficiency and improved image reconstruction quality compared to existing approaches.

federated algorithm↗

DOE OSTI2024

Efficient estimation of the modified Gromov–Hausdorff distance between unweighted graphs

Abstract Gromov–Hausdorff distances measure shape difference between the objects representable as compact metric spaces, e.g. point clouds, manifolds, or graphs. Computing any Gromov–Hausdorff distance is equivalent to solving an NP-hard optimization problem, deeming the notion impractical for applications. In this paper we propose a polynomial algorithm for estimating the so-called modified Gromov–Hausdorff (mGH) distance, a relaxation of the standard Gromov–Hausdorff (GH) distance with similar topological properties. We implement the algorithm for the case of compact metric spaces induced by unweighted graphs as part of Python library , and demonstrate its performance on real-world and synthetic networks. The algorithm finds the mGH distances exactly on most graphs with the scale-free property. We use the computed mGH distances to successfully detect outliers in real-world social and computer networks.

Oles, Vladyslav (ORCID:0000000188727463)↗

DOE OSTI2025

A Type II Hamiltonian Variational Principle and Adjoint Systems for Lie Groups

We present a novel Type II variational principle on the cotangent bundle of a Lie group which enforces Type II boundary conditions, i.e., fixed initial position and final momentum. In general, such Type II variational principles are only globally defined on vector spaces or locally defined on general manifolds; however, by left translation, we are able to define this variational principle globally on cotangent bundles of Lie groups. Type II boundary conditions are particularly important for adjoint sensitivity analysis, which is our motivating application. As such, we additionally discuss adjoint systems on Lie groups, their properties, and how they can be used to solve optimization problems subject to dynamics on Lie groups.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

A Regularized Variance-Reduced Modified Extragradient Method for Stochastic Hierarchical Games

We consider an N -player hierarchical game in which the i th player’s objective comprises of an expectation-valued term, parametrized by rival decisions, and a hierarchical term. Such a framework allows for capturing a broad range of stochastic hierarchical optimization problems, Stackelberg equilibrium problems, and leader-follower games. We develop an iteratively regularized and smoothed variance-reduced modified extragradient framework for iteratively approaching hierarchical equilibria in a stochastic setting. We equip our analysis with rate statements, complexity guarantees, and almost-sure convergence results. We then extend these statements to settings where the lower-level problem is solved inexactly and provide the corresponding rate and complexity statements. Our model framework encompasses many game theoretic equilibrium problems studied in the context of power markets. We present a realistic application to the study of virtual power plants, emphasizing the role of hierarchical decision making and regularization. Preliminary numerics suggest that empirical behavior compares well with theoretical guarantees.

Tikhonov regularization↗

DOE OSTI2026

Quantum computing approach for building surface sunlit in urban-scale energy modeling

Solar shadow calculations are needed in building energy modeling and performance simulation of PV systems installed on roofs or facades of buildings. We present a quantum computing approach for calculation of building surface sunlit fractions by recasting solar visibility as a binary optimization problem solved by quantum annealing. Each triangulated surface centroid is encoded as a binary qubit indicating sunlit or shaded status. Geometric visibility constraints are derived from the Möller-Trumbore intersection algorithm and converted into a constrained quadratic binary model compatible with contemporary quantum annealers. The coefficients were embedded to D-Wave quantum computer. To demonstrate feasibility, we conducted a case study in San Francisco for a target building with 52 triangles and roughly 2700 nearby triangles within 50 m evaluated at representative winter and summer solar positions. The results demonstrated that quantum annealing can reliably calculate and distinguish sunlit from shaded surfaces. Quantum samples achieved average accuracy exceeding 92.4 %, with the aggregate surface-level agreement approaching 99.9 %. The outputs of quantum computers agreed closely with classical algorithms, indicating practical feasibility and promising scalability. Finally, the hourly sunlit fractions of building surfaces can be obtained for urban energy modelling. This is the first study to apply quantum computing to the solar shadow and building surface sunlit calculation. It introduces a new paradigm that differs fundamentally from traditional approaches.

Deng, Zhipeng↗

DOE OSTI2025

A phase-field fracture formulation for generalized standard materials: The interplay between thermomechanics and damage

Accurately modeling fracture of ductile materials poses open challenges in the field of computational mechanics due to the multiphysics nature of their failure processes. Integrating the interplay between thermodynamics and damage into ductile fracture models is vital for predicting critical failure modes. Here, in this paper, we develop a versatile phase-field (PF) framework for modeling ductile fracture, taking into account finite-strain elasto-plasticity. The framework stems from a variational formulation of constitutive relations for generalized standard materials (GSMs), whose response is described by a Helmholtz free energy and a dissipation pseudo-potential. Its variational structure is based on a minimum principle for a functional that expresses the sum of power densities for reversible and irreversible processes. By minimizing this functional with a constraint on a von Mises yield function, we derive the evolution equation for the equivalent plastic strain and an associative flow rule. This constrained optimization problem is analytically solved for a wide class of thermo-viscoplasticity models. The key innovations of the current work include (i) a cubic plastic degradation function that accounts for a non-vanishing damage-dependent yield stress, (ii) closed-form expressions of the Helmholtz free energy and dissipation pseudo-potential for three thermo-viscoplasticity models, (iii) an extended Johnson–Cook plasticity model with a nonlinear hardening law, and (iv) a plastic work heat source that depends on the plastic degradation function and a variable Taylor–Quinney (TQ) coefficient. The capabilities of the proposed framework are tested with the aid of four ductile fracture problems, including the Sandia Fracture Challenge. In each of these problems, we examine the evolution of relevant field variables such as the PF order parameter, the equivalent plastic strain, the temperature, and the internal power dissipation density, in addition to the overall structural response quantified by the force–displacement curve. These numerical studies demonstrate that the proposed framework effectively represents ductile fracture, yielding computational results that exhibit good agreement with experimental data.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Development of Steady-State and Dynamic Mass and Energy Constrained Neural Networks for Distributed Chemical Systems Using Noisy Transient Data

The paper presents the development of algorithms for mass and energy constrained neural network models that can exactly conserve the overall mass and energy of distributed chemical process systems, even though the noisy transient data used for optimal model training violate the same. In contrast to approximately satisfying mass and energy balance constraints of a system by soft penalization of objective function, algorithms have been developed for solving equality-constrained nonlinear optimization problems, thus providing the guarantee of exactly satisfying the system mass and energy conservation laws. For developing dynamic mass-energy constrained network models for distributed systems, hybrid series and parallel dynamic-static neural networks have been leveraged. The developed algorithms for solving both the training and forward problems are validated using both steady-state and dynamic data in the presence of various noise characteristics. The developed data-driven algorithms are flexible to exactly satisfy mass and energy balance constraints for dynamic chemical processes if the system holdup information is available. The proposed network structures and algorithms are applied to the development of data-driven lumped and distributed models of an adiabatic superheater/reheater system, a nonisothermal continuous stirred tank reactor, as well as an electrically heated plug-flow reactor system where one form of energy gets transformed to another. It has been observed that the mass-energy constrained neural networks yield a root mean squared error of <1% with respect to the system truth for the case studies evaluated in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

A Comparison of Electronic Structure Methods for Predicting the Hydrogenation Energies of Candidate Molecules for Hydrogen Storage

The development of novel energy materials and fuels is required to expand current available energy sources. Aiming to reach this goal, there is growing interest in using molecular hydrogen as an energy carrier due to its abundance and high energy density. Liquid organic hydrogen carriers (LOHCs) are a promising route to the large-scale storage and transport of hydrogen for use in the energy economy. The search for thermodynamically viable LOHC molecules for real world use has led to a set of constraints on the dehydrogenation enthalpy and the minimum gravimetric hydrogen capacity. These constraints allow one to formulate the search for an ideal LOHC candidate molecule as an optimization problem well suited to the strengths of machine learning and artificial intelligence computational approaches. A critical barrier to a large-scale, high-throughput screening of LOHC candidate molecules is the lack of reliable training data. Computational electronic structure methods including density functional theory, coupled cluster approximations, and diffusion Monte Carlo can be used to provide training data where experimental data are either unreliable or do not exist. In this work, we use these methods to calculate the dehydrogenation energies and enthalpies of candidate LOHC molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2026

Optimization of Desalination Systems with Detailed Water Chemistry through Integration of Reaktoro in WaterTAP

Chemistry predictions are critical for an accurate estimation of performance and costs in desalination process models, which allows for the estimation of the value of new technologies and the viability of treating new water sources. Herein, we present how an implicit function formulation can be used to integrate the chemical modeling package, Reaktoro, into the techno-economic assessment and modeling platform, WaterTAP. This approach resolves the critical issues of integrating large-scale thermodynamic models and databases into equation-oriented process models while allowing more flexibility relative to previously presented surrogate-based methods. We describe how this integration into Pyomo and WaterTAP models is implemented and used through the open-source package Reaktoro-PSE . We first validate this integration approach by performing optimization on a previously presented desalination treatment train with softening and acid addition as the pretreatment steps. Then, to demonstrate the value of this approach, we extend the cost-optimization problem to include the simultaneous addition of lime and soda ash for softening, and HCl and H 2 SO 4 in the acidification steps. Finally, we were able to confirm the previously established results that were obtained by using surrogate models and demonstrate that the implicit function approach enables exploration of different feedwater compositions and a larger number of chemicals and their combinations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2026

Multi‐Objective Urban Observational Strategies: A Risk‐Based Framework for Expanding Flood Sensor Networks

In coupled human and natural systems, developing an observation strategy which maximizes insight into both the natural system and the human system is a challenging multi-objective optimization problem. In this article, we describe the expansion of a flood risk observation system in Southeast Texas designed to improve our understanding of both physical and socioeconomic exposure to hydrological hazards at fine spatial scales, in the context of a structured hazard-exposure-vulnerability risk framework. We describe a new approach for assessing the spatial extent through which a flood sensor's observations can be assumed to be relevant, and estimate the population served within each sensor's area of information using downscaled socio-demographic data. As hydrological observations and modeling move to ever finer scale, assessing the information they contain in the context of both social and natural systems becomes increasingly important for developing actionable scientific insights.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2025

Genetic algorithm-based geometry calibration for dynamic compression x-ray diffraction experiments

An important component of dynamic compression x-ray diffraction (XRD) experiment analysis is geometry calibration: proper data interpretation requires knowledge of the precise detector position and orientation and, if the experiment involves a single-crystal sample, knowledge of the lattice orientation. The determination of these parameters in the arbitrary three-dimensional (3D) scattering geometries often present in dynamic compression facilities is challenging, as the associated optimization problem can be highly nonlinear, nonsmooth, and discontinuous. We present a genetic algorithm-based approach for performing dynamic compression XRD calibrations that overcomes these obstacles. We provide details regarding the image processing, algorithm implementation, and open-source software deployment and demonstrate the capability of the approach to calibrate the detector and crystal parameters in 3D geometries. Notably, we demonstrate the solver’s capacity to find the crystal orientation without a priori rotation constraints.

Brown, Nathan P. [Sandia National Laboratories (SN↗

DOE OSTI2026

Scalable quantum computational science: A perspective from block-encodings and polynomial transformations

Significant developments made in quantum hardware and error correction recently have been driving quantum computing toward practical utility. However, gaps remain between abstract quantum algorithmic development and practical applications in computational sciences. In this perspective article, we propose several properties that scalable quantum computational science methods should possess. We further discuss how block-encodings and polynomial transformations can potentially serve as a unified framework with the desired properties. Recent advancements on these topics are presented, including the construction and assembly of block-encodings, and various generalizations of quantum signal processing (QSP) algorithms to perform polynomial transformations. The scalability of QSP methods on parallel and distributed quantum architectures is also highlighted. Promising applications in simulation and observable estimation in chemistry, physics, and optimization problems are presented. We hope this perspective serves as a gentle introduction to state-of-the-art quantum algorithms for the computational science community and inspires future development of scalable quantum computational science methodologies that bridge theory and practice.

Bayesian inference↗

DOE OSTI2024

Mass Optimization of a Multilayered Shield for Transportable Microreactors

The ability to easily transport microreactors is a major selling point for deploying microreactors to remote areas. However, this creates a unique shielding challenge, especially when the microreactor is being shipped after irradiation. A traditional reactor configuration utilizes a separate biological shield and pressure vessel to meet radiological shielding and pressure needs. The limited space available for transportable microreactors for both shielding and pressure vessels requires a revised assessment of separating out the biological shield and pressure vessel. To address these concerns, we examine a nuclear-grade sandwich composite (NGSC) that combines the reactor pressure vessel and biological shielding functions into a single component. Through a series of optimization problems for both transportation and operational use cases, the NGSC is able to minimize dose, minimize the vessel cost, and ensure that weight requirements are met for transportation. Initial results show that using a tungsten-tetraboride cermet in the first two layers of a six-layer NGSC provides adequate shielding for both use cases. These results show promise that an NGSC has enough overlap between operational and transportation cases to help reduce the design space for future analysis and assessment.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2024

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗

DOE OSTI2024

Retrieving Top-k Hyperedge Triplets: Models and Applications

Complex systems frequently exhibit multi-way, rather than pairwise, interactions. These group interactions can- not be faithfully modeled as collections of pairwise interactions using graphs and instead require hypergraphs. However, methods that analyze hypergraphs directly, rather than via lossy graph reductions, remain limited. Hypergraph motifs hold promise in this regard, as motif patterns serve as building blocks for larger group interactions which are inexpressible by graphs. Recent work has focused on categorizing and counting hypergraph motifs based on the existence of nodes in hyperedge intersection regions. Here, we argue that the relative sizes of hyperedge inter- sections within motifs contain varied and valuable information. We propose a suite of efficient algorithms for finding top-k triplets of hyperedges based on optimizing the sizes of these intersection patterns. This formulation uncovers interesting local patterns of interaction, finding hyperedge triplets that either (1) are the least similar with each other, (2) have the highest pairwise but not groupwise correlation, or (3) are the most similar with each other. We formalize this as a combinatorial optimization problem and design efficient algorithms based on filtering hyperedges. Our comprehensive experimental evaluation shows that the resulting hyperedge triplets yield insightful information on real-world hypergraphs. Our approach is also orders of magnitude faster than a naive baseline implementation.

hypergraphs, motifs, Combinatorial Algorithms↗

DOE OSTI2024

Optimization-Based Model Reduction Scheme for Renewable Energy Power Plants Using Standardized Testing Scenarios

This paper presents an optimization-based model reduction scheme for renewable energy (RE) power plants consisting of inverter-based resources (IBRs) operating in grid-following (GFL) or grid-forming (GFM) modes. More importantly, the datasets feeding the optimization-based model reduction scheme are generated and re-used through the standardized grid-interactive testing scenarios. Particularly, the proposed scheme makes use of the power plant point of common coupling (PCC) measurements of various quantities specified by standardized tests (e.g., voltage and frequency ride through) as per IEEE 2800, to estimate the parameters of the reduced-order model such that its dynamic performance aligns with the original detailed power plant model. The proposed model reduction approach does not require the parameters of individual IBRs and using standardized test data as input to the formulated optimization problem simplifies the reduced-order modelling scheme. Extensive case studies following standardized test scenarios verified the remarkable accuracy of the proposed approach.

Yallamilli, Ram S. [Purdue University]↗

DOE OSTI2024

DS-GL: Advancing Graph Learning via Harnessing the Power of Nature within Dynamic Systems

With the rapid digitization of the world, an increasing number of real-world applications are turning to nonEuclidean data, modeled as graphs. Due to their intrinsic high complexity and irregularity, learning from graph data demands tremendous computational power. Recently, CMOS-compatible Ising machines, i.e., dynamic systems composed of CMOS components, have emerged as a new approach that harnesses the inherent power of natural annealing within dynamic systems to efficiently resolve binary optimization problems and have been adopted for traditional graph computation, such as max-cut. However, when performing complex Graph Learning (GL) tasks, Ising machines face significant hurdles: (i) they are inherently binary and thus ill-suited for real-valued problems; (ii) their expensive all-to-all coupling network that guarantees effective natural annealing poses daunting scalability concerns. To address these challenges, this paper proposes a nature-powered graph learning framework dubbed DS-GL, which is the first effort to transform the process of solving graph learning problems into the natural annealing process within a parameterized dynamic system embodied as a CMOS chip. To tackle the two major hurdles, DS-GL first augments the Ising machine architecture to modify the self-reaction term of its Hamiltonian function from linear to quadratic, effectively serving as an energy regulator. This adjustment maintains the system’s original physical interpretation while enabling it to process continuous, real-valued data. Second, to address the scaling issue, DS-GL further upgrades the real-valued dense Ising machine by decomposing it into a mesh-based multi-PE dynamic system that supports efficient distributed spatial-temporal co-annealing across different PEs through sparse interconnects. By exploiting the inherent sparsity and component structures in real-world graphs, DS-GL is able to map complex graph learning tasks onto the scalable dynamic system while maintaining high accuracy. Evaluations with three diverse GL applications across six real-world datasets, including traffic flow and COVID-19 prediction, show that DS-GL can deliver from 102× to 106× speedups and 500× energy reduction over Graph Neural Networks on GPUs, with 5% - 20% accuracy enhancement.

Song, Ruibing↗

DOE OSTI2024

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

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↗