Engineering PapersSearch

SEARCH · Engineering Papers

Results for “Complex Constraints”

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

Informed total-error-minimizing priors: Interpretable cosmological parameter constraints despite complex nuisance effects

While Bayesian inference techniques are standard in cosmological analyses, it is common to interpret resulting parameter constraints with a frequentist intuition. This intuition can fail, for example, when marginalizing high-dimensional parameter spaces onto subsets of parameters, because of what has come to be known as projection effects or prior volume effects. We present the method of informed total-error-minimizing (ITEM) priors to address this problem. An ITEM prior is a prior distribution on a set of nuisance parameters, such as those describing astrophysical or calibration systematics, intended to enforce the validity of a frequentist interpretation of the posterior constraints derived for a set of target parameters (e.g., cosmological parameters). Our method works as follows. For a set of plausible nuisance realizations, we generate target parameter posteriors using several different candidate priors for the nuisance parameters. We reject candidate priors that do not accomplish the minimum requirements of bias (of point estimates) and coverage (of confidence regions among a set of noisy realizations of the data) for the target parameters on one or more of the plausible nuisance realizations. Of the priors that survive this cut, we select the ITEM prior as the one that minimizes the total error of the marginalized posteriors of the target parameters. As a proof of concept, we applied our method to the density split statistics measured in Dark Energy Survey Year 1 data. We demonstrate that the ITEM priors substantially reduce prior volume effects that otherwise arise and that they allow for sharpened yet robust constraints on the parameters of interest.

79 ASTRONOMY AND ASTROPHYSICS

Machine Learning for Fairness-Aware Load Shedding: A Real-Time Solution via Identifying Binding Constraints: Preprint

Timely and effective load shedding in power systems is critical for maintaining supply-demand balance and preventing cascading blackouts. To eliminate load shedding bias against specific regions in the system, optimization-based methods are uniquely positioned to help balance between economic and fairness considerations. However, the resulting optimization problem involves complex constraints, which can be time-consuming to solve and thus cannot meet the real-time requirements of load shedding. To tackle this challenge, in this paper we present an efficient machine learning algorithm to enable millisecond-level computation for the optimization-based load shedding problem. Numerical studies on both a 3-bus toy example and a realistic RTS-GMLC system have demonstrated the validity and efficiency of the proposed algorithm for delivering fairness-aware and real-time load shedding decisions.

97 MATHEMATICS AND COMPUTING

The latent variable proximal point algorithm for variational problems with inequality constraints

The latent variable proximal point (LVPP) algorithm is a framework for solving infinite-dimensional variational problems with pointwise inequality constraints. The algorithm is a saddle point reformulation of the Bregman proximal point algorithm. At the continuous level, the two formulations are equivalent, but the saddle point formulation is more amenable to discretization because it introduces a structure-preserving transformation between a latent function space and the feasible set. Working in this latent space is much more convenient for enforcing inequality constraints than the feasible set, as discretizations can employ general linear combinations of suitable basis functions, and nonlinear solvers can involve general additive updates. LVPP yields numerical methods with observed mesh-independence for obstacle problems, contact, fracture, plasticity, and others besides; in many cases, for the first time. The framework also extends to more complex constraints, providing means to enforce convexity in the Monge–Ampère equation and handling quasi-variational inequalities, where the underlying constraint depends implicitly on the unknown solution. Here, in this paper, we describe the LVPP algorithm in a general form and apply it to ten problems from across mathematics.

Inequality constraints

CDRL: Certification-Driven Reinforcement Learning for Neutrino Flavor Model Discovery

Many scientific discovery problems require searching combinatorial hypothesis spaces under complex domain constraints. Reinforcement learning (RL) offers a promising approach, but existing methods rely on scalar rewards that provide limited information about why candidate solutions fail, leading agents to repeatedly explore invalid regions. We introduce Certification-Driven Reinforcement Learning (CDRL), a framework that leverages structured feedback from symbolic reasoning tools. When a candidate violates domain constraints, these tools produce certificates identifying the actions responsible for failure. CDRL converts these certificates into reusable constraints that eliminate classes of invalid solutions and guide exploration toward valid regions. We evaluate CDRL on neutrino flavor model discovery in theoretical particle physics, where the hypothesis space exceeds $10^{26}$ possible models, and compare it with the state-of-the-art RL approach previously used for this task. Across three theory spaces, CDRL achieves up to 1.95$\times$ higher valid model rates and up to 6.33$\times$ higher neutrino model rates while evaluating up to 4$\times$ fewer candidates. We further extract 40 interpretable rules from search trajectories using a post-hoc decision-tree framework and show that reusing them as soft constraints yields gains of up to 2$\times$ in valid model rates and 3$\times$ in neutrino model discovery across all three theory spaces. These results suggest that CDRL uncovers reusable structure in combinatorial search spaces and provides a general framework for scientific model discovery.

Jha, Piyush [Georgia Tech., Atlanta; Georgia Tech]

Simply Fabricatable Reference Electrode for Studying Li Metal Interfaces Operando

Reference electrodes are essential for studying Li metal interfaces, yet their integration into coin cells remains challenging due to geometric constraints and assembly complexity. Here, we present a simple three-electrode coin cell design in which a thin Cu film is evaporated directly onto a trilayer PP/PE/PP separator, forming a conductive and flexible in situ current collector. The microporous Cu preserves separator porosity and pressure uniformity, avoiding artifacts introduced by wire- or mesh-type references. It is easily activated by Li plating and provides stable potentials for over 10 days in ether-based electrolytes without affecting Coulombic efficiency (>99%) or Li deposition morphology. Operando measurements using this design reveal electrode-specific impedance evolution and voltage responses otherwise obscured in two-electrode setups, uncovering a correlation between the SEI resistance and electrolyte ionic conductivity. This microporous Cu reference electrode offers a robust and accessible platform for characterizing reactive interfaces under realistic cycling conditions.

Sacci, Robert [ORNL] (ORCID:0000000200735221)

Unlocking the Path to Decarbonized Building Thermal Systems: Strategies for Designers and Contractors: Preprint

The design and construction community plays a pivotal role in facilitating the transition to decarbonized thermal systems that maintain human comfort while reducing building emissions. Through the U.S. Department of Energy Better Buildings initiative's Design and Construction Allies, a cohort of leading architecture, engineering, and construction firms have identified top ranked barriers that designers and contractors face when implementing solutions for building owners. These barriers to decarbonizing thermal - especially heating - systems include equipment availability; electrical capacity constraints; space allocations; complex system configurations; and lack of experience in designing, installing, and maintaining heat pumps. These impediments significantly amplify the risk and financial burden associated with the adoption of decarbonized solutions. The barriers also decrease the likelihood that designers, contractors, and owners will adopt decarbonization strategies without clear plans and guidance on how to implement these solutions, mitigate risk, and overcome the identified barriers. The National Renewable Energy Laboratory, the Design and Construction Allies, and the American Society of Heating, Refrigerating, and Air-Conditioning Engineers have developed "how to" thermal decarbonization guidance based on best practices. The subjects covered range from the role of energy efficiency in facilitating decarbonized heating solutions to strategies for decarbonizing new and existing heating, ventilating, and air-conditioning systems. The focus is on overcoming barriers so that energy-efficient, electrified buildings - both new and retrofit - become the industry standard. This paper outlines 1) the method used to collect and organize this guidance, 2) industry barriers to decarbonization, and 3) decarbonization techniques that have broad market applicability.

building heating

Effects of Structural Constraints on Excited-State Properties in Dimeric Cu(I) Diimine Complexes

Copper(I) bis-diimine complexes have played important roles in light-activated processes that can lead to their potential applications in photocatalysis and chemical sensing. Their metal-to-ligand charge-transfer (MLCT) excited-state properties are tunable by various structural factors. Dimeric Cu(I) complexes with connecting diimine derivative ligands offer another structural tuning platform for the excited-state properties. Here, we investigate excited-state properties in two covalently connected dimeric Cu(I)'s with varying structural constraints exerted by the number of carbons in the polyethylene bridge (C0 and C4) connecting the two copper(I) diimine moieties. An interesting feature of Cu(I) diimine complexes is their ability to flatten following a photoinduced structural change. Herein, we observe larger structural constraints and more structural rearrangement required upon excitation of the longer bridged complex C4 to achieve a conformation toward a more flattened tetrahedral coordination geometry compared to the shorter bridged C0. Vibrational wavepacket analysis of these complexes further supports the effect of these structural constraints where we observe a more rapid dephasing of the C0 complex, as opposed to the C4 complex, despite similar normal mode vibrations. The experimental results were supplemented by TDDFT calculations. In conclusion, the studies provide insight into using metal-metal interactions through constraints to tune excited-state dynamics and pathways.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Computational Algorithms for Unit Commitment with AC Power Flows (Final Report)

Security-constrained unit commitment (SCUC) is a key component in power system operations. When AC power flow constraints are considered in the SCUC model (AC-SCUC), the problem becomes extremely difficult due to its discrete and non-convex nature, as described in “Grid Optimization Competition Challenge 3 Problem Formulation (GOCC)”. There are four main challenges: (i) Discrete decisions regarding unit online/offline status and start-up/shut-down procedures for every single unit. The number of discrete decision variables increases considerably when a system integrates multiple generators; (ii) Configuration-based combined-cycle formulations, and multi-commodity models that include ramping products, spin/non-spin products, and regulation up/down products. The combined-cycle units introduce additional discrete decision variables and auxiliary service products further complicate the model by connecting multi-commodity products’ continuous and discrete variables; (iii) SCUC models with AC power flow constraints are far more complex due to massive bilinear terms in the large-scale nonlinear power balance equations. The nonlinear power balance equations are further complicated by the discrete step control variables of shunts; (iv) N − 1 contingency analysis. The size of the model increases linearly with the number of contingencies considered, greatly increasing the size of the optimization model. Accordingly, there is an emergent need to develop a robust algorithm capable of deriving a high-quality solution in a short time and passing through contingency tests simultaneously. In this project, we explore innovative techniques to address this challenging problem by integrating advanced polyhedral theory, approximation methods, relaxation strategies, decomposition techniques, and parallel computing. Each technique approaches the problem from a different perspective, leveraging its specific strengths to tackle distinct challenges. Each individual method has demonstrated its effectiveness in the PI’s previous research. Their integration is expected to significantly reduce the computational time required to solve the proposed complex problem. Successful completion of this project has the potential to transform the industry by enhancing optimization solvers capable of handling large-scale day-ahead energy market clearing models within strict time constraints, while incorporating AC power flow constraints. This advancement will lead to reduced overall generation costs and, consequently, increased social welfare.

29 ENERGY PLANNING, POLICY, AND ECONOMY

Navigating Integration: Key Challenges for Data Centers, Nuclear Stakeholders, and Utility Operators

he exponential growth of data centers—driven by artificial intelligence and cloud computing—is reshaping the U.S. energy landscape, presenting urgent challenges and transformative opportunities for data center developers, nuclear energy providers, and utility operators. As data centers are projected to consume up to 12% of U.S. electricity by 2028, stakeholders must address rapid deployment needs, grid congestion, and the demand for reliable, high-quality power. This presentation explores the multifaceted barriers to integrating data centers with nuclear and utility infrastructure, including land use constraints, public perception, regulatory complexity, and workforce alignment. It highlights the distinct priorities and operational cultures of each sector, and the friction that arises from misaligned planning horizons and risk tolerances. We examine collaborative strategies such as co-siting, hybrid power-purchase agreements, unified community engagement, and innovative financing models.

22 - GENERAL STUDIES OF NUCLEAR REACTORS

Optimization-based approaches to control of connected and automated vehicles: Principles, complexities, applications, challenges, and outlook

Safe and optimal motion control for connected and automated vehicles (CAVs) poses a fundamental optimization challenge at the intersection of system complexity, environmental uncertainty, and stringent real-time constraints. Existing surveys address this challenge in isolation – focusing either on specific control techniques or individual uncertainty sources – without providing a unified framework that characterizes the trade-offs among computational tractability, performance verifiability, and adaptive generalization across paradigms. This review addresses that gap by presenting a cohesive analytical framework concentrated on the decision-making and trajectory optimization layers of the CAV autonomy stack. We systematically analyze three major optimization paradigms – first-principles model-based optimization, data-driven methods, and hybrid synergistic architectures – evaluating each against four core complexity axes: problem formulation, constraint handling, optimality guarantees, and robustness. Key applications including platooning, trajectory planning, collision avoidance, and cooperative control are examined to reveal recurring methodological patterns and critical operational constraints that limit real-world performance. Our synthesis identifies verifiable hybrid architectures, incentive-aligned multi-agent cooperation, and hardware-algorithm co-design as the defining research frontiers, and distills a targeted agenda for developing CAV control systems that are simultaneously safe, computationally efficient, and deployable in the full complexity of real-world traffic environments.

Muzahid, Abu Jafar Md [University of Tennessee, Kn

CHARGE-MAP: An integrated framework to study the multicriteria EV charging infrastructure expansion problem

The widespread adoption of electric vehicles (EVs) in recent years has necessitated the development of effective charging infrastructures. However, charging infrastructure expansion is a multifaceted problem that requires careful consideration of the existing infrastructure, spatiotemporal distribution of charging demands, power-grid capacity, and budget constraints. Here, to approach this complex problem, we present CHARGE-MAP, a data-driven simulation-optimization framework, focused on ensuring meaningful charging experience for individual EV owners. CHARGE-MAP integrates three modules: an agent-based simulation module that estimates spatiotemporal distribution of charging demands by modeling EV adopter mobility and charging behavior; an optimization module that determines optimal new charging station/charger locations and capacities, while minimizing expected detour distances and wait-times with a limited number of new stations; and a power module that determines how to connect the stations to the power grid while maintaining its stability. Using the state of Virginia (consisting of 95 counties and 38 independent cities) as a case study, our results show that CHARGE-MAP can meet the demand of ~198,600 predicted EVs with 1,305 new public charging stations and 2,164 new chargers. It reduces average detour distances for charging by 66% and wait-times at stations by 72% compared to the existing infrastructure. Furthermore, transformer capacity requirement analysis reveals that only 1.8% of residential transformers require upgrades, while over 80% of commercial charging locations can be supported with modest transformer infrastructure (25 to 50 kVA). This indicates that targeted investments can facilitate cost-effective EV integration. Consequently, CHARGE-MAP provides policymakers and urban planners with crucial data-driven insights for effective EV charging infrastructure expansion. Sign up for PNAS alerts.

charging infrastructure

Deep Learning-based Surrogate Model for Efficient Reservoir Simulation in Large-scale Geological Carbon Storage: Application in IBDP Dataset

This project introduces an advanced deep learning (DL)-based surrogate modeling approach to enhance the efficiency and accuracy of large-scale geological carbon storage (GCS) simulations. Using the Illinois Basin Decatur Project (IBDP) dataset as training data, the study employs a residual U-Net architecture to predict critical state variables such as pressure and CO₂ saturation, as well as CO₂ plume migration. By incorporating key geological parameters (e.g., porosity, permeability, and rock facies) and physics-informed inputs like the diffusive time of flight and time step, the DL model effectively reduces computational complexity while maintaining robust physical constraints. Compared to traditional simulators like Eclipse, the DL model achieves remarkable accuracy, with a root mean square error (RMSE) of 1.57 psi for pressure and 0.007 for saturation, and dramatically reduces computational time from hours to just 69.9 seconds for 50-step simulations. These results demonstrate the potential of innovative DL methodologies to improve the predictivity and operational efficiency of GCS simulations, providing a reliable foundation for decision-making in CCS operations. Supported by the SMART initiative, this project underscores the success of leveraging computational innovations to advance CCS technologies.

advanced deep learning

Quantum simulations of nuclear resonances with variational methods

Background: The many-body nature of nuclear physics problems poses significant computational challenges. These challenges become even more pronounced when studying the resonance states of nuclear systems, which are governed by the non-Hermitian Hamiltonian. Quantum computing, particularly for quantum many-body systems, offers a promising alternative, especially within the constraints of current noisy intermediate-scale quantum (NISQ) devices. Purpose: This work aims to simulate nuclear resonances using quantum algorithms by developing a variational framework compatible with non-Hermitian Hamiltonians and implementing it fully on a quantum simulator. Methods: We employ the complex scaling technique to extract resonance positions classically and adapt it for quantum simulations using a two-step algorithm. First, we transform the non-Hermitian Hamiltonian into a Hermitian form by using the energy variance as a cost function within a variational framework. Second, we perform 𝜃-trajectory calculations to determine optimal resonance positions in the complex energy plane. To address resource constraints on NISQ devices, we utilize Gray code (GC) encoding to reduce qubit requirements. Results: We first validate our approach using a schematic potential model that mimics a nuclear potential, successfully reproducing known resonance energies with high fidelity. We then extend the method to a more realistic 𝛼−𝛼 nuclear potential and compute the 𝐷- and 𝐺-wave resonance energies with a basis size of 𝑁=16, using only four qubits. The quantum simulation results closely match the classical values, demonstrating the feasibility of our approach. Conclusions: This study demonstrates, for the first time, that the complete 𝜃-trajectory method can be implemented on a quantum computer without relying on any classical input beyond the Hamiltonian. The results establish a scalable and efficient quantum framework for simulating resonance phenomena in nuclear systems. This work represents a significant step toward quantum simulations of open quantum systems and lays the foundation for future investigations into resonance structures in nuclear, atomic, and molecular physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints

Augmented Lagrangian (AL) methods have proven remarkably useful in solving optimization problems with complicated constraints. The last decade has seen the development of overall complexity guarantees for inexact AL variants. Yet, a crucial gap persists in addressing nonsmooth convex constraints. To this end, we present a smoothed augmented Lagrangian (AL) framework where nonsmooth terms are progressively smoothed with a smoothing parameter $\eta _k$ . The resulting AL subproblems are $\eta _k$ -smooth, allowing for leveraging accelerated schemes. By a careful selection of the inexactness level $\epsilon _k$ (for inexact subproblem resolution), the penalty parameter $\rho _k$ , and smoothing parameter $\eta _k$ at epoch k, we derive rate and complexity guarantees of $\tilde{\mathcal {O}}(1/{\varepsilon }^{3/2})$ and $\tilde{\mathcal {O}}(1/{\varepsilon })$ in convex and strongly convex regimes for computing an ${\varepsilon }$ -optimal solution, when $\rho _k$ increases at a geometric rate, a significant improvement over the best available guarantees for AL schemes for convex programs with nonsmooth constraints. Analogous guarantees are developed for settings with $\rho _k = \rho$ as well as $\eta _k = \eta$ . Preliminary numerics on a fused Lasso problem display promise.

augmented Lagrangian

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING

Structural constraint integration in a generative model for the discovery of quantum materials

Billions of organic molecules have been computationally generated, yet functional inorganic materials remain scarce due to limited data and structural complexity. Here, in this work, we introduce Structural Constraint Integration in a GENerative model (SCIGEN), a framework that enforces geometric constraints, such as honeycomb and kagome lattices, within diffusion-based generative models to discover stable quantum materials candidates. SCIGEN enables conditional sampling from the original distribution, preserving output validity while guiding structural motifs. This approach generates ten million inorganic compounds with Archimedean and Lieb lattices, over 10% of which pass multistage stability screening. High-throughput density functional theory calculations on 26,000 candidates shows over 95% convergence and 53% structural stability. A graph neural network classifier detects magnetic ordering in 41% of relaxed structures. Furthermore, we synthesize and characterize two predicted materials, TiPd 0.22 Bi 0.88 and Ti 0.5 Pd 1.5 Sb, which display paramagnetic and diamagnetic behaviour, respectively. Our results indicate that SCIGEN provides a scalable path for generating quantum materials guided by lattice geometry.

36 MATERIALS SCIENCE