Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “constrained 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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Optimal Transactive Energy Trading of Electric Vehicle Charging Stations With On-Site PV Generation in Constrained Power Distribution Networks

This paper presents a two-level transactive energy market framework, that enables energy trading among electric vehicle charging stations (EVCSs). At the lower level, the discharging capability of EVs and on-site PV generation are leveraged by individual EVCS for participating in the transactive trading with their peers. Once the lower-level trading is completed, EVCSs trade energy at the upper level through the power grid network managed by the distribution system operator (DSO). The upper-level market is cleared while satisfying the power distribution network constraints. A cooperative game-based model is proposed to model the energy trading among EVCSs. To this end, the asymmetric Nash bargaining method is applied to allocate the grand coalition's payoff to each EVCS at the upper-level market, while a weighted proportional allocation method is used to allocate individual EVCS's payoff to its respective EVs at the lower-level market. In this work, the upper-level market formulation is further decomposed into two subproblems representing an energy scheduling and trading subproblem which maximizes EVCS payoffs, and a bargaining subproblem which allocates EVCS payoffs. The effectiveness of the proposed framework for incentivizing transactive trades among EVs and EVCSs is validated in case studies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2021

Topology optimization of additively manufactured fluidic components free of internal support structures

This report integrates projection-based approaches for implementing overhang constraints with fluid topology optimization to design additively manufactured fluidic components that do not require internal support structures. Internal support structures are challenging, potentially impossible to remove in complex fluid networks, yet would degrade fluidic performance if left within the part. This presents a major challenge in coupling topology optimization with additive manufacturing in the design of fluid components. The proposed approach leverages past work in overhang constraints for solid mechanics, including projection formulations and adjoint sensitivity analysis, and considers incompressible Navier–Stokes equations for laminar fluid flow. The approach is demonstrated on 2D and 3D fluid topology optimization problems to minimize pressure drop and constrain mass flow rates in pipes and manifolds. Resulting designs are crisp, logical, satisfy performance constraints, and satisfy overhang constraints, eliminating the need for internal support structures.

42 ENGINEERING↗
DOE OSTI2024

Improving cosmological analyses of HI clustering by reducing stochastic noise

High-number-density tracers of large-scale structure, such as the HI-rich galaxies measured by 21 cm intensity mapping, have low sampling noise, making them particularly promising as cosmological probes. At large scales, this sampling noise can be subdominant to other scale-independent contributions to the power spectrum; such contributions arise from nonlinear bias, and exceed the sampling noise if at least one of the associated bias coefficients is sufficiently large. This has important consequences for cosmological constraints obtained from such tracers, since it indicates that using the power spectrum does not lead to optimal constraints even in the linear regime. In this paper, we provide a conservative estimate of the possible improvement in constraining power of a 21 cm survey if one were to use an optimal analysis strategy (such as field-level analysis), where only the true sampling noise enters the error budget. We find that improvements in uncertainties on some cosmological parameters can be as large as 50%, depending on redshift, foreground cleaning efficiency, scales used in the analysis, and instrumental noise. One byproduct of our work is measurements of bias parameters and stochasticity for neutral hydrogen in the IllustrisTNG simulation over a wide range of redshifts; we provide simple fitting formulas for these measurements. Furthermore, our results motivate further exploration of new optimal analysis techniques and provide important insights into the constraining power of current and future 21 cm surveys.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Improving the Quasi‐Biennial Oscillation via a Surrogate‐Accelerated Multi‐Objective Optimization

Accurate simulation of the quasi-biennial oscillation (QBO) is challenging due to uncertainties in representing convectively generated gravity waves. We develop an end-to-end uncertainty quantification workflow that calibrates these gravity wave processes in E3SM for a realistic QBO. Central to our approach is a domain knowledge-informed, compressed representation of high-dimensional spatio-temporal wind fields. By employing a parsimonious statistical model that learns the fundamental frequency from complex observations, we extract interpretable and physically meaningful quantities capturing key attributes. Building on this, we train a probabilistic surrogate model that approximates the fundamental characteristics of the QBO as functions of critical physics parameters governing gravity wave generation. Leveraging the Karhunen–Loève decomposition, our surrogate efficiently represents these characteristics as a set of orthogonal features, capturing cross-correlations among multiple physics quantities evaluated at different pressure levels and enabling rapid surrogate-based inference at a fraction of the computational cost of full-scale simulations. Finally, we analyze the inverse problem using a multi-objective approach. Our study reveals a tension between amplitude and period that constrains the QBO representation, precluding a single optimal solution. To navigate this, we quantify the bi-criteria trade-off and generate a set of Pareto optimal parameter values that balance the conflicting objectives. This integrated workflow improves the fidelity of QBO simulations and offers a versatile template for uncertainty quantification in complex geophysical models.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

CO 2 fertilization of terrestrial photosynthesis inferred from site to global scales

Significance The magnitude of the CO 2 fertilization effect on terrestrial photosynthesis is uncertain because it is not directly observed and is subject to confounding effects of climatic variability. We apply three well-established eco-evolutionary optimality theories of gas exchange and photosynthesis, constraining the main processes of CO 2 fertilization using measurable variables. Using this framework, we provide robust observationally inferred evidence that a strong CO 2 fertilization effect is detectable in globally distributed eddy covariance networks. Applying our method to upscale photosynthesis globally, we find that the magnitude of the CO 2 fertilization effect is comparable to its in situ counterpart but highlight the potential for substantial underestimation of this effect in tropical forests for many reflectance-based satellite photosynthesis products.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Improving operational flexibility of integrated energy system with uncertain renewable generations considering thermal inertia of buildings

Insufficient flexibility in system operation caused by traditional "heat-set" operating modes of combined heat and power (CHP) units in winter heating periods is a key issue that limits renewable energy consumption. In order to reduce the curtailment of renewable energy resources through improving the operational flexibility, a novel optimal scheduling model based on chance-constrained programming (CCP), aiming at minimizing the lowest generation cost, is proposed for a small-scale integrated energy system (IES) with CHP units, thermal power units, renewable generations and representative auxiliary equipments. In this model, due to the uncertainties of renewable generations including wind turbines and photovoltaic units, the probabilistic spinning reserves are supplied in the form of chance-constrained; from the perspective of user experience, a heating load model is built with consideration of heat comfort and inertia in buildings. To solve the model, a solution approach based on sequence operation theory (SOT) is developed, where the original CCP-based scheduling model is tackled into a solvable mixed-integer linear programming (MILP) formulation by converting a chance constraint into its deterministic equivalence class, and thereby is solved via the CPLEX solver. We report the simulation results on the modified IEEE 30-bus system demonstrate that the presented method manages to improve operational flexibility of the IES with uncertain renewable generations by comprehensively leveraging thermal inertia of buildings and different kinds of auxiliary equipments, which provides a fundamental way for promoting renewable energy consumption.

30 DIRECT ENERGY CONVERSION↗
DOE OSTI2022

Quantifying Subsurface Flow and Solute Transport in a Snowmelt‐Recharged Hillslope With Multiyear Water Balance

Abstract Quantifying flow and transport from hillslopes is vital for understanding water quantity and quality in rivers, but remains obscure because of limited subsurface measurements. Using measured hydraulic conductivity K profiles and water balance over a single year to calibrate a transmissivity feedback model for a hillslope in the East River watershed (Colorado) proved unsatisfactory for predicting flow over the subsequent years. Well‐constrained field‐scale K were obtained by optimizing subsurface flux predictions over years having large differences in recharge, and by including estimates of interannual transfer of excess snowmelt recharge. Water and solute exports during high snowmelt recharge occur predominantly via shallow groundwater flow through weathered rock and soil because of their enlarged transmissivities under saturated conditions. Conversely, these shallow pathways are less active in snow drought years when the water table remains deeper within the weathering zone. Hillslope soil water monitoring showed that rainfall does not infiltrate deeply during summer and fall months, and revealed water losses consistent with model ET predictions. By combining water table‐dependent fluxes with pore water chemistry in different zones, time‐dependent rates of solute exports become predictable. As an example, calibrated K were combined with dissolved nitrogen concentrations in pore waters to show the snowmelt‐dependence of reactive nitrogen exported from the hillslope, further supporting the recent finding that the weathering zone is the dominant source of reactive nitrogen at this site. Subsurface export predictions can now be obtained for wide ranges of recharge based on measurements of water table elevation and profiles of pore water chemistry.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Mapping the global distribution of C 4 vegetation using observations and optimality theory

Plants with the C 4 photosynthesis pathway typically respond to climate change differently from more common C 3 -type plants, due to their distinct anatomical and biochemical characteristics. These different responses are expected to drive changes in global C 4 and C 3 vegetation distributions. However, current C 4 vegetation distribution models may not predict this response as they do not capture multiple interacting factors and often lack observational constraints. Here, we used global observations of plant photosynthetic pathways, satellite remote sensing, and photosynthetic optimality theory to produce an observation-constrained global map of C 4 vegetation. We find that global C 4 vegetation coverage decreased from 17.7% to 17.1% of the land surface during 2001 to 2019. This was the net result of a reduction in C 4 natural grass cover due to elevated CO 2 favoring C 3 -type photosynthesis, and an increase in C 4 crop cover, mainly from corn (maize) expansion. Using an emergent constraint approach, we estimated that C 4 vegetation contributed 19.5% of global photosynthetic carbon assimilation, a value within the range of previous estimates (18–23%) but higher than the ensemble mean of dynamic global vegetation models (14 ± 13%; mean ± one standard deviation). Our study sheds insight on the critical and underappreciated role of C 4 plants in the contemporary global carbon cycle.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Accelerated Constrained Sparse Tensor Factorization on Massively Parallel Architectures

This study presents the first constrained sparse tensor factorization (cSTF) framework that optimizes and fully offloads computation to massively parallel GPU architectures, and the first performance characterization of cSTF on GPU architectures. In contrast to prior work on tensor factorization, where the matricized tensor times Khatri-Rao product (MTTKRP) is the primary performance bottleneck, our systematic analysis of the cSTF algorithm on GPUs reveals that adding constraints creates an additional bottleneck in the update operation for many real-world sparse tensors. While executing the update operation on the GPU brings significant speedup over its CPU counterpart, it remains a significant bottleneck. To further accelerate the update operation, we propose cuADMM, a new update algorithm that leverages algorithmic and code optimization strategies to minimize both computation and data movement on GPUs. As a result, our framework delivers significantly improved performance compared to prior state-of-the-art. On 10 real-world sparse tensors, our framework achieves geometric mean speedup of 5.1 × (max 41.59 ×) and 7.01 × (max 58.05 ×) on the NIVIDA A100 and H100 GPUs, respectively, over the state-of-the-art SPLATT library running on a 26-core Intel Ice Lake Xeon CPU.

Soh, Yongseok↗
DOE OSTI2022

Systems and methods for tensor scheduling

A technique for efficient scheduling of operations in a program for parallelized execution thereof using a multi-processor runtime environment having two or more processors includes constraining the type or number of loop optimization transforms that may be explored such that memory and processing capacity available for the scheduling task are not exceeded, while facilitating a tradeoff between memory locality, parallelization, and/or data communication between memory modules of the multi-processor runtime environment.

Meister, Benoit J.↗
DOE OSTI2022

Enhanced physics-constrained deep neural networks for modeling vanadium redox flow battery

Numerical simulation has become indispensable in advancing cost-effective process optimization and control of flow batteries. We propose an enhanced version of the physics-constrained deep neural network (PCDNN) approach to provide high-accuracy voltage predictions in the vanadium redox flow batteries (VRFBs). The purpose of the PCDNN approach is to enforce the physics-based zero-dimensional (0D) VRFB model in a neural network to assure model generalization for various battery operation conditions. However, limited by the simplifications of the 0D model, the PCDNN cannot capture sharp voltage changes in the extreme SOC regions. To improve the accuracy of voltage prediction at extreme ranges, we introduce a second (enhanced) DNN to mitigate the prediction errors carried from the 0D model itself and call the resulting approach enhanced PCDNN (ePCDNN). By comparing with experimental data, we demonstrate that the ePCDNN approach can accurately capture the voltage response throughout the charge–discharge cycle, including the tail region of the voltage discharge curve. The loss function for training the ePCDNN is designed to be flexible by adjusting the weights of the physics-constrained DNN and the enhanced DNN. In conclusion, this allows the ePCDNN framework to be transferable to battery systems with variable physical model fidelity.

25 ENERGY STORAGE↗
DOE OSTI2021

Classical symmetries and the Quantum Approximate Optimization Algorithm

Here, we study the relationship between the Quantum Approximate Optimization Algorithm (QAOA) and the underlying symmetries of the objective function to be optimized. Our approach formalizes the connection between quantum symmetry properties of the QAOA dynamics and the group of classical symmetries of the objective function. The connection is general and includes but is not limited to problems defined on graphs. We show a series of results exploring the connection and highlight examples of hard problem classes where a nontrivial symmetry subgroup can be obtained efficiently. In particular, we show how classical objective function symmetries lead to invariant measurement outcome probabilities across states connected by such symmetries, independent of the choice of algorithm parameters or number of layers. To illustrate the power of the developed connection, we apply machine learning techniques toward predicting QAOA performance based on symmetry considerations. We provide numerical evidence that a small set of graph symmetry properties suffices to predict the minimum QAOA depth required to achieve a target approximation ratio on the MaxCut problem, in a practically important setting where QAOA parameter schedules are constrained to be linear and hence easier to optimize.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A model to calculate fatigue damage caused by partial waking during wind farm optimization

Abstract. Wind turbines in wind farms often operate in waked or partially waked conditions, which can greatly increase the fatigue damage. Some fatigue considerations may be included, but currently a full fidelity analysis of the increased damage a turbine experiences in a wind farm is not considered in wind farm layout optimization because existing models are too computationally expensive. In this paper, we present a model to calculate fatigue damage caused by partial waking on a wind turbine that is computationally efficient and can be included in wind farm layout optimization. The model relies on analytic velocity, turbulence, and load models commonly used in farm research and design, and it captures some of the effects of turbulence on the fatigue loading. Compared to high-fidelity simulation data, our model accurately predicts the damage trends of various waking conditions. We also perform example wind farm layout optimizations with our presented model in which we maximize the annual energy production (AEP) of a wind farm while constraining the damage of the turbines in the farm. The results of our optimization show that the turbine damage can be significantly reduced, more than 10 %, with only a small sacrifice of around 0.07 % to the AEP, or the damage can be reduced by 20 % with an AEP sacrifice of 0.6 %.

17 WIND ENERGY↗
DOE OSTI2023

Multi-objective, robust constraints enforced global topology optimizer for optical devices

A method for optimization of photonic devices is disclosed. The method includes receiving a set of unconstrained latent variables; mapping the set of unconstrained latent variables to a constrained space to generate a constrained device; calculating the permittivity across each element of the constrained device; determining a permittivity-constrained width gradient based at least partially on the permittivity across each element; and optimizing the set of unconstrained latent variables by at least partially using the permittivity-constrained width gradient.

Fan, Jonathan↗
DOE OSTI2024

Exploring the Frontiers of Energy Efficiency using Power Management at System Scale

In the face of surging power demands for exascale HPC systems, this work tackles the critical challenge of understanding the impact of software-driven power management techniques like Dynamic Voltage and Frequency Scaling (DVFS) and Power Capping. These techniques have been actively developed over the past few decades. By combining insights from GPU benchmarking to understand application power profiles, we present a telemetry data-driven approach for deriving energy savings projections. This approach has been demonstrably applied to the Frontier supercomputer at scale. Our findings based on three months of telemetry data indicate that, for certain resource-constrained jobs, significant energy savings (up to 8.5%) can be achieved without compromising performance. This translates to a substantial cost reduction, equivalent to 1438 MWh of energy saved. The key contribution of this work lies in the methodology for establishing an upper limit for these best-case scenarios and its successful application. This work enables HPC professionals to optimize the power-performance trade-off within constrained power budgets, not only for the exascale era but also beyond.

Karimi, Ahmad Maroof↗
DOE OSTI2024

Enhancing Solar Power Forecasting with Regularized Constrained Quantile Regression Averaging and Bootstrapping Techniques

Probabilistic solar power forecasting (SPF) plays an essential role in optimizing power-grid operations by quantifying the forecast uncertainty. To improve the accuracy and robustness of probabilistic SPF, this paper introduces the regularized constrained quantile regression averaging (rCQRA) method to combine outputs from multiple PSPF models. In addition, a bootstrapping method was used to quantify model uncertainty, providing insights into the reliability and significance of each ensemble component. To evaluate its efficacy, the proposed rCQRA method is used to integrate four PSPF methods. The resulting SPF models are trained and validated using a real-world six-year dataset from a rooftop solar plant in the USA. The performance of the proposed rCQRA method is evaluated and compared with two benchmark methods under three categories of weather conditions. It is shown that the rCQRA method has superior performance in its forecast reliability, sharpness, and accuracy.

Ensemble learning, probabilistic solar power forec↗
DOE OSTI2023

QuComm: Optimizing Collective Communication for Distributed Quantum Computing

Distributed quantum computing (DQC) is a scalable way to build a large-scale quantum computing system while the error-prone nonlocal communication between DQC nodes may heavily degrade the fidelity of the distributed quantum program and thus demands specific compiler optimizations. Previous compilers on DQC communication optimization either assumes unlimited communication resource or a few communication qubits due to the hardware limitation. The former compilers may not be efficient when interfacing with communication-resource-constrained DQC hardware while the latter compilers lose the opportunities of optimizing collective communication and routing concurrent communication as they unnecessarily couple limited communication qubits with the implementation of expensive inter-node operations. In this paper, we invent the communication buffer, a communication facility consisting of idle qubits in each compute node, to decouple the execution of inter-node quantum operations from communication qubits: communication qubits are devoted to generating inter-node entanglement while internode operations are conducted in the communication buffer. The communication buffer provides an intermediate layer for inter-node communication and paves the way for collective communication optimization. We then propose QuComm, a buffer-based compiler framework that first performs smart buffer allocation according to communication characteristics of the distributed quantum program and then optimizes and collectively routes inter-node quantum operations. Experimental results on a hierarchical DQC system show that the proposed QuComm can reduce the most expensive inter-node communication request and the latency of various distributed quantum programs by 50.4% and 47.6% on average, respectively.

Wu, Anbang↗
DOE OSTI2023

Automating NISQ Application Design with Meta Quantum Circuits with Constraints (MQCC)

Near-term intermediate scale quantum (NISQ) computers are likely to have very restricted hardware resources, where precisely controllable qubits are expensive, error-prone, and scarce. Programmers of such computers must therefore balance trade-offs among a large number of (potentially heterogeneous) factors specific to the targeted application and quantum hardware. To assist them, we propose Meta Quantum Circuits with Constraints (MQCC), a meta-programming framework for quantum programs. Programmers express their application as a succinct collection of normal quantum circuits stitched together by a set of (manually or automatically) added meta-level choice variables, whose values are constrained according to a programmable set of quantitative optimization criteria. MQCC’s compiler generates the appropriate constraints and solves them via an SMT solver, producing an optimized, runnable program. We showcase a few MQCC’s applications for its generality including an automatic generation of efficient error syndrome extraction schemes for fault-tolerant quantum error correction with heterogeneous qubits and an approach to writing approximate quantum Fourier transformation and quantum phase estimation that smoothly trades off accuracy and resource use. We also illustrate that MQCC can easily encode prior one-off NISQ application designs-–multi-programming (MP), crosstalk mitigation (CM)—as well as a combination of their optimization goals (i.e., a combined MP-CM).

97 MATHEMATICS AND COMPUTING↗