Search NASA⌕ Search

SEARCH · Search NASA

Results for “dual decomposition”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Scalable branching on dual decomposition of stochastic mixed-integer programming problems

In this work, we present a scalable branching method for the dual decomposition of stochastic mixed-integer programming. Our new branching method is based on the branching method proposed by Caroe and Schultz that creates branching disjunctions on first-stage variables only. We propose improvements to the process for creating branching disjunctions, including (1) branching on the optimal solutions of the Dantzig-Wolfe reformulation of the restricted master problem and (2) using a more comprehensive (yet simple) measure for the dispersions associated with subproblem solution infeasibility. We prove that the proposed branching process leads to an algorithm that terminates finitely, and we provide conditions under which globally optimal solutions can be identified after termination. We have implemented our new branching method, as well as the Caroe-Schultz method and a branch-and-price method, in the open-source software package DSP. Using SIPLIB test instances, we present extensive numerical results to demonstrate that the proposed branching method significantly reduces the number of node subproblems and solution times.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Extreme-scale EV charging infrastructure planning for last-mile delivery using high-performance parallel computing

Here, this paper addresses stochastic charger location and allocation problems under queue congestion for last-mile delivery using electric vehicles (EVs). The objective is to decide where to open charging stations and how many chargers of each type to install, subject to budgetary and waiting-time constraints. We formulate the problem as a mixed-integer non-linear program, where each station-charger pair is modeled as a multiserver queue with stochastic arrivals and service times to capture the notion of waiting in fleet operations. The model is extremely large, with billions of variables and constraints for a typical metropolitan area; even loading the model in solver memory is difficult, let alone solving it. To address this challenge, we develop a Lagrangian-based dual decomposition framework that decomposes the problem by station and leverages parallelization on high-performance computing systems, where the subproblems are solved by using a cutting plane method and their solutions are collected at the master level. We also develop a three-step rounding heuristic to transform the fractional subproblem solutions into feasible integral solutions. Computational experiments on data from the Chicago metropolitan area with hundreds of thousands of households and thousands of candidate stations show that our approach produces high-quality solutions in cases where existing exact methods cannot even load the model in memory. We also analyze various policy scenarios, demonstrating that combining existing depots with newly built stations under multiagency collaboration substantially reduces costs and congestion. These findings offer a scalable and efficient framework for developing sustainable large-scale EV charging networks.

Capacity allocation↗
DOE OSTI2022

Distributed Optimization Approaches with Discrete Variables in the Power Distribution Systems

Traditionally, centralized approaches have predominantly been used for the power system operation and control. With increasing penetration of small-scale distributed energy resources (DERs) in the distribution network, especially independently owned renewable resources, distributed algorithms can serve as a potential alternative for improving scalability, resiliency and addressing privacy concerns. However, the complexity of distributed algorithms significantly increases with the integration of the legacy devices, the operation of which depend on discrete control variables. This paper aims to provide a review of the distributed optimization algorithms incorporating discrete control variables for the power distribution system. While the research in this domain is still at its nascence, an extensive comparison of the approaches in the literature for applying quadratic penalty, branch and bound,ordinal optimization and proximal operator to handle discrete variables in the framework of ADMM and dual decomposition have been addressed. Future research direction in this field have been also provided.

Adan, Jannatul↗
DOE OSTI2023

Physics guided machine learning for multi-material decomposition of tissues from dual-energy CT scans of simulated breast models with calcifications

We introduce a physics guided data-driven method for image-based multi-material decomposition for dual-energy computed tomography (CT) scans. The method is demonstrated for CT scans of virtual human phantoms containing more than two types of tissues. The method is a physics-driven supervised learning technique. We take advantage of the mass attenuation coefficient of dense materials compared to that of muscle tissues to perform a preliminary extraction of the dense material from the images using unsupervised methods. We then perform supervised deep learning on the images processed by the extracted dense material to obtain the final multi-material tissue map. The method is demonstrated on simulated breast models with calcifications as the dense material placed amongst the muscle tissues. The physics-guided machine learning method accurately decomposes the various tissues from input images, achieving a normalized root-mean-squared error of 2.75%.

Gopalakrishnan Meena, Murali↗
DOE OSTI2021

A Privacy-Preserving Distributed Control of Optimal Power Flow

Here, we consider a distributed optimal power flow formulated as an optimization problem that maximizes a nondifferentiable concave function. Solving such a problem by the existing distributed algorithms can lead to data privacy issues because the solution information exchanged within the algorithms can be utilized by an adversary to infer the data. To preserve data privacy, in this paper we propose a differentially private projected subgradient (DP-PS) algorithm that includes a solution encryption step. We show that a sequence generated by DP-PS converges in expectation, in probability, and with probability 1. Moreover, we show that the rate of convergence in expectation is affected by a target privacy level of DP-PS chosen by the user. We conduct numerical experiments that demonstrate the convergence and data privacy preservation of DP-PS.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

The Average Spectrum Norm and Near-Optimal Tensor Completion

We propose the average spectrum norm to study the minimum number of measurements required to approximate a multidimensional array (i.e., sample complexity) via low-rank tensor recovery. Our focus is on the tensor completion problem, where the aim is to estimate a multiway array using a subset of tensor entries corrupted by noise. Our average spectrum norm-based analysis provides near-optimal sample complexities, exhibiting dependence on the ambient dimensions and rank that do not suffer from exponential scaling as the order increases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Catalytic Site Requirements for N2O Decomposition on Cu-, Co-, and Fe-SSZ-13 Zeolites

N2O decomposition is investigated on Cu, Co and Fe-exchanged SSZ-13 zeolite catalysts at relatively low metal loadings. The catalysts are synthesized by solution ion exchange, and subjected to X-ray diffraction (XRD), temperature-programed-reduction by H2 (H2-TPR), temperature-programed-reaction of N2O (N2O-TPR) coupled with in-situ transmission FTIR, and finally steady-state flow reaction tests. At low N2O pressures (< 0.05 kPa), all catalysts display pseudo first-order kinetics. From Arrhenius analysis, Cu and Fe-SSZ-13 display very different apparent activation energies but similar pre-exponential factors, suggesting their similar reaction mechanisms. N2O decomposition follows a dual-site mechanism, occurring on dimeric M-O-M sites in these catalysts, and O2 is formed by the combination of two O ad-atoms from two vicinal metal sites. Under low N2O pressure (0.05 kPa) and first-order kinetic regime, the reaction is limited by N-O cleavage on bare metal active sites. In comparison to Cu-SSZ-13, the much higher N2O decomposition rate over Fe-SSZ-13 is attributed to the much lower activation barriers for the N-O cleavage step. N2O decomposition occurs on isolated Co2+ ions in Co-SSZ-13. The rate-limiting step is N-O cleavage on an O-occupied Co site in the low-pressure first order kinetic regime. This single-site mechanism leads to much higher pre-exponential factors as compared to the dual-site mechanism. This beneficial factor for reaction rate enhancement, however, is compromised by the much higher activation barriers over this catalyst.

Lin, Fan↗
DOE OSTI2026

A hybrid Penman-Monteith and machine learning model for simulating evapotranspiration and its components

Integrating physical processes with machine learning has advanced evapotranspiration (ET) simulation, yet most hybrid models fail to partition total ET into its components: soil evaporation (E) and vegetation transpiration (T). This study introduces Residual Neural Network–Penman–Monteith (RNN-PM), a novel hybrid dual-source ET model designed to overcome this limitation. The model synergizes the physically-based Penman–Monteith framework with three specialized residual neural networks trained to estimate key conductance parameters (canopy conductance, soil surface conductance, and aerodynamic conductance). Furthermore this explicit parameterization allows for the direct partitioning of total ET. Validation at National Ecological Observatory Network (NEON) flux sites using high-frequency partitioned E and T shows that RNN-PM reliably reproduces ET and the transpiration fraction (T/ET). For ET, the model achieves an average Kling–Gupta efficiency (KGE) of 0.89 and a root-mean-square error (RMSE) of 0.55 mm/day; for T/ET, the KGE is 0.87 with an RMSE of 0.06. Furthermore, RNN-PM demonstrates robust generalization, accurately simulating ET and its components well beyond the initial training dataset, even under extreme climatic conditions. This study extended the analysis by comparing the RNN-PM model with seven established dual-source ET models. The results indicate that RNN-PM outperforms both conventional machine learning models and purely physical process-based models in simulating ET components in most cases. Among the purely physical process-based dual-source models, those based on surface temperature decomposition showed improved performance as the leaf area index (LAI) decreased when evaluated against high-frequency ET component datasets. In contrast, the performance of conductance-based dual-source models declined with decreasing LAI. Although purely machine learning-based models can produce relatively accurate simulations of ET components, they often exhibit limited generalization capability, an issue that the RNN-PM model effectively overcomes. Ultimately, the RNN-PM model represents a significant advance in simulating ET components, offering a novel and scalable approach for improving the representation of land–atmosphere interactions in Earth system models.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Enhancing carbon nanotube production from carbon dioxide and ethane using bimetallic catalysts

Converting CO 2 into carbon nanotubes (CNTs) offers a promising way for CO 2 utilization and sequestration, potentially mitigating environmental impacts from anthropogenic emissions. This study reports that bimetallic CoFe catalysts can increase CNT production from the reaction of CO 2 and C 2 H 6 by an order of magnitude compared to their monometallic counterparts. The active sites and CNT morphologies are composition-dependent: Co-rich catalysts (Co/Fe ratio ≥ 5) form stable face-centered cubic (fcc) CoFe alloys, producing cylindrical CNTs; Fe-containing catalysts (Co/Fe ≤ 2) favor body-centered cubic (bcc) CoFe alloy upon reduction, which transforms into carbides, resulting in bamboo-like CNTs. Experimental evidence and DFT calculations reveal that adjacent Fe and Co atoms modulate CO and C x H y adsorption, regulating CNT production pathways through the CO Boudouard reaction and C 2 H 6 decomposition. In conclusion, these results highlight the dual benefits of bimetallic catalysts in enhancing CNT yield and controlling CNT morphology through adjustment of catalyst compositions.

58 GEOSCIENCES↗
DOE OSTI2024

Geometric representations of braid and Yang–Baxter gates

Brick-wall circuits composed of the Yang–Baxter gates are integrable. It becomes an important tool to study the quantum many-body system out of equilibrium. To put the Yang–Baxter gate on quantum computers, it has to be decomposed into the native gates of quantum computers. It is favorable to apply the least number of native two-qubit gates to construct the Yang–Baxter gate. We study the geometric representations of all X-type braid gates and their corresponding Yang–Baxter gates via the Yang–Baxterization. We find that the braid and Yang–Baxter gates can only exist on certain edges and faces of the two-qubit tetrahedron. We identify the parameters by which the braid and Yang–Baxter gates are the Clifford gate, the matchgate, and the dual-unitary gate. The geometric representations provide the optimal decompositions of the braid and Yang–Baxter gates in terms of other two-qubit gates. We also find that the entangling powers of the Yang–Baxter gates are determined by the spectral parameters. Our results provide the necessary conditions to construct the braid and Yang–Baxter gates on quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

From phase decomposition to evaporation: A multi-modal evaluation of thermally degraded model lightweight high-entropy alloy

Lightweight high-entropy alloys (LHEAs) have the potential to replace conventional lightweight materials due to their superior mechanical properties and thermal stability. However, the thermal degradation pattern of LHEAs from phase decomposition to evaporation is not clear. We develop a new Al-based dual phase (FCC + HCP) LHEA—AlTi 0.45 CuZn, and further investigate its thermal degradation behavior for potential high-temperature structural applications. Using multimodal advanced characterization techniques such as differential scanning calorimetry/thermogravimetric analysis, scanning/transmission electron microscopy, and synchrotron X-ray diffraction/pair distribution function (XRD/PDF), a sequence of thermal degradation events beyond the thermal phase stability limit—between 250 and 360 °C—is observed. These include phase decomposition at ~360 °C, Zn evaporation at ~750 °C, and LHEA melting at 880 °C which results in ~25% cumulative weight loss. The formation of Al-Ti phase off the AlTi 0.45 CuZn matrix is due to the largest negative mixing enthalpy for Al-Ti than other binary pairs. Similarly, Zn evaporation from AlTi 0.45 CuZn LHEA is due to its faster evaporation rate than other constituent elements. The high-resolution synchrotron XRD and PDF results support the aforementioned observations; in addition, they reveal local atomic arrangements, local strain, and sluggish grain growth in the LHEA. Among other LHEAs of close density range (5.55 ≤ ρ ≤ 5.85 g/cc), the investigated LHEA exhibits outstanding nano-indentation hardness values due to the coupled grain size effect and HCP phase strengthening of the FCC matrix. As the search for LHEAs for lightweight applications grows, this study shows the potential use of AlTi 0.45 CuZn LHEA for structural applications even at elevated temperatures.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Parallelized POD-based suboptimal economic model predictive control of a state-constrained Boussinesq approximation

Motivated by an energy efficient building application, we want to optimize a quadratic cost functional subject to the Boussinesq approximation of the Navier-Stokes equations and to bilateral state and control constraints. Since the computation of such an optimal solution is numerically costly, we design an efficient strategy to compute a sub-optimal (but applicationally acceptable) solution with significantly reduced computational effort. We employ an economic Model Predictive Control (MPC) strategy to obtain a feedback control. The MPC sub-problems are based on a linear-quadratic optimal control problem subjected to mixed control and state constraints and a convection-diffusion equation, reduced with proper orthogonal decomposition. Finally, to solve each sub-problem, we apply a primal-dual active set strategy. The method can be fully parallelized, which enables the solution of large problems with real-world parameters.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Soil pore architecture and rhizosphere legacy define N 2 O production in root detritusphere

Root detritusphere is one of the most important sources of N 2 O, however, understanding of how N 2 O emission from the detritusphere is influenced by soil properties remains elusive. Here, we evaluated the effects of pore architecture and soil moisture on N 2 O emission during the decomposition of in-situ grown roots of switchgrass, an important bioenergy crop. We combined dual isotope labeling ( 15 C and 15 N) with zymography to gain insights into the location of the microbial N 2 O production in soils with contrasting pore architectures. In the studied soil, the effect of soil pore architecture on N 2 O emissions was 6 times greater than that of soil moisture. Soil dominated by > 30 μm Ø pores (i.e., large-pore soil) had higher chitinase activity than the soil dominated by < 10 μm Ø pores (i.e., small-pore soil), especially near the decomposing roots. The chitinase activity on the decomposing roots was positively correlated with emission of root-derived N 2 O, indicating that N released from root decomposition was an important source of N 2 O. Greater N 2 O and N2 emission was induced by switchgrass roots in soils dominated by the large- compared to the small-pore soils. Here, the microenvironment developed near decomposing roots of the large-pore soil also resulted in positive N 2 O priming. Our study challenged the traditional view on soil moisture as the main factor of N 2 O production. Production and emission of N 2 O was most intensive in microbial activity hotspots (i.e., rhizosphere legacy) in the large pores, where decomposed roots release mineral N as the main N 2 O source.

13C Pulse labeling↗
DOE OSTI2022

A multistage distributionally robust optimization approach to water allocation under climate uncertainty

This paper investigates a Multistage Distributionally Robust Optimization (MDRO) approach to water allocation under climate uncertainty. The MDRO is formed by creating sets of conditional distributions (called conditional ambiguity sets) on a finite scenario tree. The distributions in the conditional ambiguity sets remain close to a nominal conditional distribution according a ø-divergence (e.g., Kullback-Leibler divergence, Hellinger distance, Burg entropy, etc.). Here, the paper discusses a decomposition algorithm to solve the resulting MDRO with ø-divergences, which uses the dual formulation and solves only linear subproblems instead of convex ones. Some properties of the algorithm such as generating feasible policies and valid upper/lower bounds are established. The paper then applies the modeling and solution techniques to allocate water in a rapidly-developing area of Tucson, Arizona. Tucson, like many arid and semi-arid regions around the world, faces considerable uncertainty in its ability to provide water for its citizens in the future. The primary sources of uncertainty in the Tucson region include (1) unpredictable population growth, (2) the availability of water from the Colorado River, and (3) the effects of climate variability on water consumption. This paper integrates forecasts for all these sources of uncertainty into a single optimization model for robust and sustainable water allocation. Then, it uses this model to analyze the value of constructing additional treatment facilities to reduce future water shortages. The results indicate that the MDRO approach can be very valuable for water managers by providing insights to minimize their risks and help them plan for the future.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

A Computationally Efficient Algorithm for Computing Convex Hull Prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may execute side payments when a participant’s cost is not covered through energy sale settlements from locational marginal pricing schemes, or when a participant incurs lost opportunity costs to follow the dispatch signal. Convex hull pricing minimizes these and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. However, computing convex hull prices involves solving either a large-scale linear program - which in turn requires explicit descriptions of market participants’ convex hulls -or the Lagrangian dual of the corresponding non-convex scheduling problem. Here, we propose a computationally feasible and industrially scalable Benders decomposition approach to computing convex hull prices at least an order of magnitude faster than the current state-of-the-art while leveraging recent advances in convex hull formulations for thermal generating units.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2025

Optimizing the design and operation of water networks: Two decomposition approaches

We consider the design and operation of water networks simultaneously. Water network problems can be divided into two categories: the design problem and the operation problem. The design problem involves determining the appropriate pipe sizing and placements of pump stations, while the operation problem involves scheduling pump stations over multiple time periods to account for changes in supply and demand. Our focus is on networks that involve water co-produced with oil and gas. While solving the optimization formulation for such networks, we found that obtaining a primal (feasible) solution is more challenging than obtaining dual bounds using off-the-shelf mixed-integer nonlinear programming solvers. Therefore, we propose two methods to obtain good primal solutions. One method involves a decomposition framework that utilizes a convex reformulation, while the other is based on time decomposition. To test our proposed methods, we conduct computational experiments on a network derived from the PARETO case study.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Dynamic Transmission Line Switching Amid Wildfire-Prone Weather Under Decision-Dependent Uncertainty

During dry and windy seasons, environmental conditions significantly increase the risk of wildfires, exposing power grids to disruptions caused by transmission line failures. Wildfire propagation exacerbates grid vulnerability, potentially leading to prolonged power outages. To address this challenge, we propose a multistage optimization model that dynamically adjusts transmission grid topology in response to wildfire propagation, aiming to develop an optimal response policy. By accounting for decision-dependent uncertainty, where line survival probabilities depend on usage, we employ distributionally robust optimization to model uncertainty in line survival distributions. We adapt the stochastic nested decomposition algorithm and derive a deterministic upper bound for its finite convergence. To enhance computational efficiency, we exploit the Lagrangian dual problem structure for a faster generation of Lagrangian cuts. Using realistic data from the California transmission grid, we demonstrate the superior performance of dynamic response policies against two-stage alternatives through a comprehensive case study. In addition, after solving the multistage formulation, we construct easy-to-implement policies that significantly reduce computational burden while maintaining good performance in real-time deployment. History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms and Applications. Funding: This work was supported by the U.S. Department of Energy, Office of Electricity [Grant DE-AC02-05CH11231]. The work of R. Jiang was supported in part by the U.S. National Science Foundation, Division of Electrical, Communications and Cyber Systems [Grant ECCS-1845980] and the U.S. Air Force Office of Scientific Research [Grant FA9550-23-1-0323]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2025.1210 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2025.1210 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Estrada-Garcia, Juan-Alberto↗
DOE OSTI2022

A Lagrangian dual method for two-stage robust optimization with binary uncertainties

This report presents a new exact method to calculate worst-case parameter realizations in two-stage robust optimization problems with categorical or binary-valued uncertain data. Traditional exact algorithms for these problems, notably Benders decomposition and column-and-constraint generation, compute worst-case parameter realizations by solving mixed-integer bilinear optimization subproblems. However, their numerical solution can be computationally expensive not only due to their resulting large size after reformulating the bilinear terms, but also because decision-independent bounds on their variables are typically unknown. We propose an alternative Lagrangian dual method that circumvents these difficulties and is readily integrated in either algorithm. We specialize the method to problems where the binary parameters switch on or off constraints as these are commonly encountered in applications, and discuss extensions to problems that lack relatively complete recourse and to those with integer recourse. Numerical experiments provide evidence of significant computational improvements over existing methods.

42 ENGINEERING↗