Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed optimization”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS2008

A Physical Model to Estimate Snowfall over Land using AMSU-B Observations

In this study, we present an improved physical model to retrieve snowfall rate over land using brightness temperature observations from the National Oceanic and Atmospheric Administration's (NOAA) Advanced Microwave Sounder Unit-B (AMSU-B) at 89 GHz, 150 GHz, 183.3 +/- 1 GHz, 183.3 +/- 3 GHz, and 183.3 +/- 7 GHz. The retrieval model is applied to the New England blizzard of March 5, 2001 which deposited about 75 cm of snow over much of Vermont, New Hampshire, and northern New York. In this improved physical model, prior retrieval assumptions about snowflake shape, particle size distributions, environmental conditions, and optimization methodology have been updated. Here, single scattering parameters for snow particles are calculated with the Discrete-Dipole Approximation (DDA) method instead of assuming spherical shapes. Five different snow particle models (hexagonal columns, hexagonal plates, and three different kinds of aggregates) are considered. Snow particle size distributions are assumed to vary with air temperature and to follow aircraft measurements described by previous studies. Brightness temperatures at AMSU-B frequencies for the New England blizzard are calculated using these DDA calculated single scattering parameters and particle size distributions. The vertical profiles of pressure, temperature, relative humidity and hydrometeors are provided by MM5 model simulations. These profiles are treated as the a priori data base in the Bayesian retrieval algorithm. In algorithm applications to the blizzard data, calculated brightness temperatures associated with selected database profiles agree with AMSU-B observations to within about +/- 5 K at all five frequencies. Retrieved snowfall rates compare favorably with the near-concurrent National Weather Service (NWS) radar reflectivity measurements. The relationships between the NWS radar measured reflectivities Z(sub e) and retrieved snowfall rate R for a given snow particle model are derived by a histogram matching technique. All of these Z(sub e)-R relationships fall in the range of previously established Z(sub e)-R relationships for snowfall. This suggests that the current physical model developed in this study can reliably estimate the snowfall rate over land using the AMSU-B measured brightness temperatures.

Kim, Min-Jeong↗
NASA NTRS1989

Optimizing Locations Of Nodes To Reduce Vibrations

Distribution of mass modified to move nodes to desired locations. Modal shaping proposed as method to reduce structural vibration. Current optimization technique deals with placement of nodal points, related to modal shaping and consists of modifying distribution of mass of structure to place node of mode at desired location. Key to procedure; analysis of sensitivity of locations of nodes, provides straightforward expressions for derivatives of locations of nodes.

Adelman, Howard M.↗
DOE OSTI2025

A Review of Quantum Computing Technologies in Power System Optimization

As modern power grids increasingly integrate variable renewable generation, distributed energy resources, and energy storage systems, classical optimization techniques are facing unprecedented challenges. This review examines the emerging application of quantum computing to overcome these challenges in power system optimization, including optimal power flow (OPF), unit commitment (UC), economic dispatch (ED), and intelligent switching and topology optimization (IS-TO). Recent research has introduced various quantum methodologies—such as gate-based, annealing-based, variational algorithms, and quantum-inspired algorithms—to address the combinatorial complexity inherent in grid reconfiguration and energy management. The review summaries the quantum algorithms, quantum devices and the power system test cases, highlighting hybrid quantum–classical strategies that leverage the complementary strengths of both paradigms. Some quantum advantages have been observed, including theoretical speedup, accurate simulation results, scalable qubit usage, efficient QUBO mapping. In particular, the review emphasizes the importance of integrating quantum optimization techniques with classical control frameworks, these hybrid approaches demonstrate the potential to improve real-time grid management and operational reliability. A significant portion of the analysis is devoted to the practical limitations of current quantum devices. Present-day quantum hardware, operating in the noisy intermediate-scale quantum (NISQ) era, remains highly sensitive to noise and limited in qubit connectivity, which constrains the scale and accuracy of implemented algorithms. The review delves into specific challenges such as the need for qubit-efficient encoding techniques and error mitigation strategies that are critical for handling real-world grid optimization problems. In addition, the work draws attention to the performance discrepancies between theoretical quantum speedups and experimental validations, underscoring the importance of rigorous benchmark studies using representative power grid test cases. In summary, this review highlights both the promise and limitations of quantum computing for power system optimization. It provides a comprehensive overview of the state-of-the-art technologies, categorizes recent advancements in algorithm design, and discusses practical considerations for implementation, and serves as an informative resource on current research. Future research directions include developing robust hybrid frameworks, advancing qubit-efficient formulations, and scaling up experimental demonstrations to confirm the theoretical advantages of quantum methods in large-scale power system operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Minimizing CGYRO HPC Communication Costs in Ensembles with XGYRO by Sharing the Collisional Constant Tensor Structure

First-principles fusion plasma simulations are both compute and memory intensive, and CGYRO is no exception. The use of many HPC nodes to fit the problem in the available memory thus results in significant communication overhead, which is hard to avoid for any single simulation. That said, most fusion studies are composed of ensembles of simulations, so we developed a new tool, named XGYRO, that executes a whole ensemble of CGYRO simulations as a single HPC job. By treating the ensemble as a unit, XGYRO can alter the global buffer distribution logic and apply optimizations that are not feasible on any single simulation, but only on the ensemble as a whole. The main saving comes from the sharing of the collisional constant tensor structure, since its values are typically identical between parameter-sweep simulations. This data structure dominates the memory consumption of CGYRO simulations, so distributing it among the whole ensemble results in drastic memory savings for each simulation, which in turn results in overall lower communication overhead.

CGYRO↗
DOE OSTI2024

Physics-inspired spatiotemporal-graph AI ensemble for the detection of higher order wave mode signals of spinning binary black hole mergers

We present a new class of AI models for the detection of quasi-circular, spinning, non-precessing binary black hole mergers whose waveforms include the higher order gravitational wave modes ($\ell$, |m|) = {(2,2), (2,1), (3,3), (3,2), (4,4)}, and mode mixing effects in the $\ell$ = 3, |m| = 2 harmonics. These AI models combine hybrid dilated convolution neural networks to accurately model both short- and long-range temporal sequential information of gravitational waves; and graph neural networks to capture spatial correlations among gravitational wave observatories to consistently describe and identify the presence of a signal in a three detector network encompassing the Advanced LIGO and Virgo detectors. We first trained these spatiotemporal-graph AI models using synthetic noise, using 1.2 million modeled waveforms to densely sample this signal manifold, within 1.7 h using 256 NVIDIA A100 GPUs in the Polaris supercomputer at the Argonne Leadership Computing Facility. This distributed training approach exhibited optimal classification performance, and strong scaling up to 512 NVIDIA A100 GPUs. With these AI ensembles we processed data from a three detector network, and found that an ensemble of 4 AI models achieves state-of-the-art performance for signal detection, and reports two misclassifications for every decade of searched data. We distributed AI inference over 128 GPUs in the Polaris supercomputer and 128 nodes in the Theta supercomputer, and completed the processing of a decade of gravitational wave data from a three detector network within 3.5 h. Finally, we fine-tuned these AI ensembles to process the entire month of February 2020, which is part of the O3b LIGO/Virgo observation run, and found 6 gravitational waves, concurrently identified in Advanced LIGO and Advanced Virgo data, and zero false positives. This analysis was completed in one hour using one NVIDIA A100 GPU.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

High-dimensional maximum-entropy phase space tomography using normalizing flows

Particle accelerators generate charged-particle beams with tailored distributions in six-dimensional position-momentum space (phase space). Knowledge of the phase space distribution enables model-based beam optimization and control. In the absence of direct measurements, the distribution must be tomographically reconstructed from its projections. In this paper, we highlight that such problems can be severely underdetermined and that entropy maximization is the most conservative solution strategy. We leverage —invertible generative models—to extend maximum-entropy tomography to six-dimensional phase space and perform numerical experiments to validate the model's performance. Our numerical experiments demonstrate consistency with exact two-dimensional maximum-entropy solutions and the ability to fit complicated six-dimensional distributions to large measurement sets in reasonable time. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗
NASA NTRS2018

A Singular Value Decomposition Framework for Retrievals with Vertical Distribution Information from Greenhouse Gas Column Absorption Spectroscopy Measurements

We describe a variation of the Optimal Estimation (OE) method for greenhouse gas remote sensing retrievals using a singular value decomposition (SVD) and an uninformative prior. The SVD method is capable of discerning vertical information in column integrated absorption measurements. While traditional Bayesian optimal estimation (OE) assumes a prior distribution in order to regularize the inversion problem, the SVD approach identifies principal components that can be retrieved from the measurement without explicitly specifying a prior mean and prior covariance matrix. We discuss the method, illustrate its use on an integrated path differential absorption CO2 lidar measurement model, and compare it to traditional optimal estimation using numerical simulations. In the absence of forward model error, the mathematics behind the SVD method guarantee it to be bias-free, which is confirmed by the numerical simulations. In contrast, traditional OE retrievals exhibit bias when the prior mean used in the retrieval differs from the true mean. While the SVD approach can be used for most trace gas retrievals, it is particularly useful for situations where prior knowledge of the trace gas profile is poor. The SVD analysis is also useful in illustrating how vertical information is treated by the traditional OE approach.

Ramanathan, Anand K.↗
DOE OSTI2025

From Structure to Function: Zn/Mn-Modified Maghemite as an Advanced Nanoplatform for Magnetic Hyperthermia and Radionuclide Therapy

The development of nanoplatforms capable of efficient heat generation and stable radionuclide delivery is essential for effective bimodal cancer therapy. Here, in this study, binary (Fe–M) and ternary (Fe–M–M′) metal oxide nanoparticles were synthesized via a polyol method optimized to produce flower-like γ-Fe 2 O 3 (maghemite) structures, with M and M′ representing Zn and/or Mn. Comprehensive structural and magnetic characterization was conducted to explain the relationship between composition, defect structure, and hyperthermic performance. The analyses revealed that cation substitution induced an Fe-site vacancy, primarily at octahedral positions, leading to local structural distortions, as confirmed by powder X-ray diffraction and pair distribution function analysis. The optimized composition, with Zn/Mn/Fe = 0.040:0.182:1, exhibited the highest concentration of vacancies and structural disorder. These vacancies altered the bonding environment, enhancing magnetic interactions at tetrahedral sites while weakening those at the octahedral positions. The resulting multicore nanoflowers (20–63 nm; core size 13–18 nm) displayed strong heating performance, with intrinsic loss power ranging from 0.34 to 5.77 nHm 2 kg –1 . The optimized sample achieved a temperature increase of 30 °C within 2 min and a specific absorption rate of 369 W g –1 . This composition was further coated with citrate (CA) and successfully radiolabeled with 177 Lu, achieving a radiolabeling yield of 92.7% and excellent stability, thus forming a robust nanoplatform for combined magnetic hyperthermia and radionuclide therapy. Biological evaluation of the optimized S5 composition revealed selective cytotoxicity toward HeLa and LS174 cells, while toxicity was significantly lower to A549, A375, and normal MRC-5 cells. Citrate coating of S5 nanoparticles (S5@CA) drastically reduced their cytotoxicity across all tested cell lines (IC 50 > 200 μg mL –1 ), confirming their enhanced biocompatibility for therapeutic applications. In HeLa cells subjected to magnetic hyperthermia, the viability decreased to approximately 84% after 30 min and 61% after 60 min of treatment, demonstrating the sustained hyperthermic effect at a controlled working temperature of 48 °C. These results underscore the effectiveness of cation substitution and vacancy engineering in tailoring the functional properties of maghemite-based nanomaterials for advanced multimodal cancer therapies.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Powered By CADET

The Capacity Expansion Decision Support for Distribution Networks (CADET) is a Python-based library and framework for creating electrical distribution system capacity planning tools for cost-effective, reliable power delivery. It enables the creation of modular, scalable, and extensible distribution capacity planning tools by providing a high-level optimization interface, parameter and options data managers, optimization constraint and objective libraries, generalized nomenclature, a system for tracking and modifying distribution network changes, optimization solution validation, and other capabilities. This webinar will describe 1) the motivation for creating CADET, 2) key designs, and 3) several use cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2005

Distributed Adaptive Control: Beyond Single-Instant, Discrete Variables

In extensive form noncooperative game theory, at each instant t, each agent i sets its state x, independently of the other agents, by sampling an associated distribution, q(sub i)(x(sub i)). The coupling between the agents arises in the joint evolution of those distributions. Distributed control problems can be cast the same way. In those problems the system designer sets aspects of the joint evolution of the distributions to try to optimize the goal for the overall system. Now information theory tells us what the separate q(sub i) of the agents are most likely to be if the system were to have a particular expected value of the objective function G(x(sub 1),x(sub 2), ...). So one can view the job of the system designer as speeding an iterative process. Each step of that process starts with a specified value of E(G), and the convergence of the q(sub i) to the most likely set of distributions consistent with that value. After this the target value for E(sub q)(G) is lowered, and then the process repeats. Previous work has elaborated many schemes for implementing this process when the underlying variables x(sub i) all have a finite number of possible values and G does not extend to multiple instants in time. That work also is based on a fixed mapping from agents to control devices, so that the the statistical independence of the agents' moves means independence of the device states. This paper also extends that work to relax all of these restrictions. This extends the applicability of that work to include continuous spaces and Reinforcement Learning. This paper also elaborates how some of that earlier work can be viewed as a first-principles justification of evolution-based search algorithms.

Wolpert, David H.↗
NASA NTRS2004

Product Distribution Theory for Control of Multi-Agent Systems

Product Distribution (PD) theory is a new framework for controlling Multi-Agent Systems (MAS's). First we review one motivation of PD theory, as the information-theoretic extension of conventional full-rationality game theory to the case of bounded rational agents. In this extension the equilibrium of the game is the optimizer of a Lagrangian of the (probability distribution of) the joint stare of the agents. Accordingly we can consider a team game in which the shared utility is a performance measure of the behavior of the MAS. For such a scenario the game is at equilibrium - the Lagrangian is optimized - when the joint distribution of the agents optimizes the system's expected performance. One common way to find that equilibrium is to have each agent run a reinforcement learning algorithm. Here we investigate the alternative of exploiting PD theory to run gradient descent on the Lagrangian. We present computer experiments validating some of the predictions of PD theory for how best to do that gradient descent. We also demonstrate how PD theory can improve performance even when we are not allowed to rerun the MAS from different initial conditions, a requirement implicit in some previous work.

Lee, Chia Fan↗
DOE OSTI2024

Cognitive Grid Optimization

This project laid the foundation to include a security constrained economic dispatch (SCED) within one of the leading simulators which is used to train system operators who keep the lights on for over 150 million people in USA. The SCED is designed to handle very high penetrations of renewable generation as well as battery storage. As a follow on the this project, a Trusted Source Model of the North American Electric Interconnections will be built from public GIS data. The various North American Markets will be emulated. This Trusted Source Model will grow the software developers for the next generation of power applications that are needed to transition to all green generation while everything is electrified.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Large Scale Bilevel Optimization for N-K SCOPF Using Adversarial Robustness

Ensuring a secure dispatch against multiple simultaneous outages has long been desired to maintain grid security in the presence of severe events, such as extreme weather phenomena. Traditionally denoted as N-k security constrained optimal power flow (N-k SCOPF), this problem is intractable to solve due to its size being combinatorial in the number of simultaneous outages and due to the non-convex nature of the AC network constraints. This hinders the use of N-k SCOPF for operating realistic-scale systems. In this paper, we introduce a methodology to scalably solve an AC-feasible dispatch that improves security over k simultaneous outages. Our methodology poses N-k SCOPF as a bilevel optimization problem and solves it using an adversarial robustness approach. We develop new efficient methods to solve each level of the bilevel optimization by employing knowledge of the physics of the underlying system. This yields significant improvements in speed and convergence that enable us to address the N-k SCOPF problem at scale. We demonstrate the effectiveness of our method by conducting a comprehensive analysis of an N-3 SCOPF for a 500-bus network. Furthermore, we emphasize the ability of our physics-driven techniques to handle larger systems by successfully scaling up to 12,000 buses.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Fast and robust strategies for large-scale mixed-integer SCOPF

This project develops scalable, computationally efficient algorithms to solve realistic large-scale power system optimization problems, including systems with more than 8,000 buses, as part of a larger series of competitions run by ARPA-E. These problems are critical because the secure and reliable operation of the power grid is becoming increasingly challenging, especially under conditions of increased uncertainty and variability. The economic feasibility of our methods is high, given that they are purely software-based solutions designed to operate power grids more efficiently. The technical effectiveness balances heuristics and approximations to provide a trade-off between speed and accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Tightest Mixed-Integer Programming Formulations for Quadratic SCUC Optimization

In this project, we developed new, tighter Mixed-Integer Programming (MIP) formulations for the combined Alternating Current (AC) Security-Constrained Unit Commitment (SCUC) and Security-Constrained Optimal Power Flow (SCOPF). The work addresses a critical challenge in power system operations: efficiently determining which generation units to commit and how to optimally dispatch them while maintaining network reliability constraints for both normal and contingency scenarios. Our efforts: 1. Advance the Understanding of SCUC/SCOPF Modeling: By introducing tighter MIP formulations and leveraging cutting-edge optimization tools (Julia/JuMP, PowerModels.jl), this project has pushed forward the state of the art in efficient power systems scheduling. 2. Enhance Technical and Economic Feasibility: The methods developed provide more accurate and potentially faster solutions to large-scale, realistic scheduling and dispatch problems in electric power systems, which can translate into improved reliability and potentially lower costs for grid operations. 3. Benefit to the Public: Greater efficiency in power system operations leads to cost savings for utilities and end-users. Improved reliability and integration of advanced modeling approaches can facilitate the adoption of clean energy resources and better accommodate uncertainties in renewable generation. Because this technology could impact bulk power markets and reliability, these innovations have far-reaching public benefits in terms of cost savings, reliability, and sustainability.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1994

Aligning parallel arrays to reduce communication

Axis and stride alignment is an important optimization in compiling data-parallel programs for distributed-memory machines. We previously developed an optimal algorithm for aligning array expressions. Here, we examine alignment for more general program graphs. We show that optimal alignment is NP-complete in this setting, so we study heuristic methods. This paper makes two contributions. First, we show how local graph transformations can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. Second, we give a heuristic that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. Our algorithms have been implemented; we present experimental results showing their effect on the performance of some example programs running on the CM-5.

Sheffler, Thomas J.↗
NASA NTRS2002

Bi-Level Integrated System Synthesis (BLISS) for Concurrent and Distributed Processing

The paper introduces a new version of the Bi-Level Integrated System Synthesis (BLISS) methods intended for optimization of engineering systems conducted by distributed specialty groups working concurrently and using a multiprocessor computing environment. The method decomposes the overall optimization task into subtasks associated with disciplines or subsystems where the local design variables are numerous and a single, system-level optimization whose design variables are relatively few. The subtasks are fully autonomous as to their inner operations and decision making. Their purpose is to eliminate the local design variables and generate a wide spectrum of feasible designs whose behavior is represented by Response Surfaces to be accessed by a system-level optimization. It is shown that, if the problem is convex, the solution of the decomposed problem is the same as that obtained without decomposition. A simplified example of an aircraft design shows the method working as intended. The paper includes a discussion of the method merits and demerits and recommendations for further research.

Sobieszczanski-Sobieski, Jaroslaw↗