Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solution 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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Rapid Screening of Single-Atom Catalyst Synthesis Conditions Using ToF-SIMS and Facet-Dependent Single-Crystal Substrates

Single-atom catalysts (SACs) offer superior catalytic performance compared to traditional nanoparticle catalysts but are challenging to develop because of the need for extensive optimization and specialized characterization techniques. Here, this study presents a rapid and versatile method for detecting synthesis conditions and elucidating deposition mechanisms of SACs on various substrates. By depositing active elements (Au, Cu, Ni and Rh) on facet-specific single-crystalline substrates (CeO 2 , TiO 2 , MgO and Al 2 O 3 ) and employing time-of-flight secondary ion mass spectroscopy (ToF-SIMS), we assessed facet-dependent deposition behaviors and identified optimal conditions for solution-based SAC synthesis. On CeO 2 and TiO 2 , we confirmed facet-dependent deposition, primarily influenced by oxygen vacancy density and photocatalytic activity, respectively. MgO exhibited the formation of metal oxide/hydroxide clusters for all active elements, and the degree of clustering for Cu and Ni was correlated with the facet hydrolysis susceptibility. Notably, Au and Rh deposition on MgO was facet-independent, attributed to the formation of hydroxide species in solution. Al 2 O 3 , due to its chemical stability and lack of surface defects, did not show active element deposition. This study not only provides a time and cost-efficient method for prescreening SAC synthesis conditions, but it also provides valuable insights into the various deposition mechanisms governing SAC formation on different substrates, paving the way for the rational design of tailored SACs for various catalytic applications.

ToF-SIMS↗
DOE OSTI2024

Characterization and novel application of power over fiber for electronics in a harsh environment

Power-over-Fiber (PoF) technology has been used extensively in settings where high voltages require isolation from ground. In a novel application of PoF, power is provided to photon detector modules located on a surface at ∼ 300 kV with respect to ground in the planned DUNE experiment. In cryogenic environments, PoF offers a reliable means of power transmission, leveraging optical fibers to transfer optical power. PoF technology excels in maintaining low noise levels when delivering power to sensitive electronic systems operating in extreme temperatures and high voltage environments. This paper presents the R&D effort of PoF in extreme conditions and underscores its capacity to revolutionize power delivery and management in critical applications, offering a dependable solution with low noise, optimal efficiency (∼ 51%), and superior isolation.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Endogenizing Probabilistic Resource Adequacy Risks in Deterministic Capacity Expansion Models

In this work, we demonstrate how power system capacity expansion models can understate the stochastic effects of thermal outages when considering resource availabilities on an hourly expected value basis, yielding system designs with multiple orders of magnitude more shortfall risk than stated adequacy targets. We develop a novel approximation approach to efficiently endogenize awareness of this risk in a deterministic, linear capacity expansion framework. We compare this approach to exogenous tuning of an energy reserve margin, the leading alternative method to compensate for unmodeled probabilistic shortfall risk. Empirical results from a test system show that the new endogenous method cost-effectively meets all regional reliability targets with a single optimization solve, and produces a near-identical system design as the incumbent method without the need for repeated re-optimizations to find an appropriate reserve level. The endogenous method may also use iterative re-optimizations to further improve solution quality, although these incremental benefits were modest in the system studied.

capacity expansion modeling↗
DOE OSTI2025

Techno-Economic Analysis for the Addition of a Thermal Energy Storage System to a Central Plant

Increasing energy demand and rising peak loads present significant challenges for energy management in commercial and institutional settings. As climate change drives greater cooling needs, central plants must navigate the complex tradeoffs between operational efficiency, cost control, and grid stability. Thermal energy storage (TES) systems offer a viable solution by shifting energy consumption from peak to off-peak periods, thereby reducing peak demand, lowering utility expenses, and improving grid resilience. However, the success of TES implementation hinges on appropriate system sizing, effective control strategies, and alignment with local utility rate structures. This article presents a techno-economic analysis of integrating a chilled water TES system into the central plant at California State University, Dominguez Hills. Drawing on historical load profiles and utility tariffs, we assess three TES sizing approaches and their corresponding control strategies from both energy and economic perspectives. This article utilizes a model-based approach to assess the impact of TES sizing and control strategies on the techno-economic feasibility of integrating TES into an existing central plant. The models employed for this analysis were calibrated using 4 years of historical data. Here, the results demonstrated that utility tariffs and the campus's operational profiles dictate the most feasible sizing and control methods. The findings offer valuable insights for institutions and commercial building managers exploring sustainable energy solutions. By demonstrating how optimized TES strategies can improve operational efficiency while achieving financial savings, this study highlights the potential for TES to align performance with cost effectiveness in real-world applications.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2026

Integrating Resilience Planning in Distribution System Planning

Electric utilities, regulators, and stakeholders face increasing risks of severe storms, freezes, floods, and heat waves damaging grid infrastructure and causing power outages—and increasing risks of utility equipment igniting wildfires. At the same time, customer electricity rates have risen substantially in recent years, due in part to replacing aging infrastructure and improving resilience to natural hazards and physical threats. To address these challenges, utilities are beginning to move beyond traditional, siloed planning processes to balance resilience with other fundamental grid objectives such as affordability, reliability, safety, and serving new loads. This study presents a framework for states and utilities that want to advance integration of resilience and distribution planning processes to improve planning efficiency, better prioritize cost-effective grid expenditures, and balance planning objectives. The framework includes 7 key integration points between these planning processes: -Strategy process -Data -Threat assessments -Solution identification and prioritization -Optimization opportunities -Consideration of other grid needs -Metrics Lawrence Berkeley National Laboratory reviewed utility distribution system plans and interviewed subject matter experts to identify emerging practices for each of the 7 integration points. This report presents these practices, which can be used as a guide toward more holistic planning and cohesive investment strategies. It also includes 3 case studies to provide practical examples of how utilities apply such integrated planning processes: two pole hardening programs and one microgrid planning effort. The report concludes by identifying opportunities for future research.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Unsupervised Learning for Equitable DER Control: Preprint

In the context of managing distributed energy resources (DERs) within distribution networks (DNs), this work focuses on the task of developing local controllers. We propose an unsupervised learning framework to train functions that can closely approximate optimal power flow (OPF) solutions. The primary aim is to establish specific conditions under which these learned functions can collectively guide the network towards desired configurations asymptotically, leveraging an incremental control approach. The flexibility of the proposed methodology allows to integrate fairness-driven components into the cost function associated with the OPF problem. This addition seeks to mitigate power curtailment disparities among DERs, thereby promoting equitable power injections across the network. To demonstrate the effectiveness of the proposed approach, power flow simulations are conducted using the IEEE 37-bus feeder. The findings not only showcase the guaranteed system stability but also underscore its improved overall performance.

asymptotic stability↗
DOE OSTI2025

Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

In this work, we present two neural network approaches that approximate the solutions of static and dynamic conditional optimal transport (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inference—particularly in the simulation-based (“likelihood-free”) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Data-Driven Recommendation of Optimal Tuning Scheme for Range-Separated Hybrid Functionals in Solution-Phase UV/Vis Absorption Energy Prediction

Time-dependent density functional theory (TDDFT) combined with range-separated hybrid (RSH) functionals and a tuned range-separation parameter γ offers a computationally economical approach for high-throughput excited- state property predictions. The γ-tuning procedure in the gas phase is well established. However, no agreement on the best γ- tuning procedure has been made when considering the solvent effect with implicit solvent models like the polarizable continuum model (PCM). To answer that question, this study created a diverse dataset with 937 molecules with experimental solutionphase UV/vis absorption spectra. Three γ-tuning methods, the gasphase γ-tuning (GPγT), the partial vertical γ-tuning (PVγT), and the strict vertical γ-tuning (SVγT), were evaluated for the ωPBEh functional over the entire dataset. Additional benchmarks are done for the optimally tuned screened range-separated hybrid combined with the PCM approach (SRSH-PCM) and the solvation-mediated tuning procedure (sol-med-OT). Our findings revealed that the optimal γ-values obtained by the PVγT and the SVγT are significantly smaller than the GPγT. This trend holds consistently across all molecules in our dataset, and we explained the origin of this phenomenon. TDDFT calculations with PVγTand SVγT-tuned γ-values and default global Fock exchange fraction achieve superior performance compared to those using GPγTtuned or default γ and slightly outperform SRSH-PCM and sol-med-OT with similar or lesser computational cost. Furthermore, we found that the smaller γ-values from SVγT captured the expected 1/(εR) asymptotic behavior in the solution phase, resulting in accurate prediction of solution-phase CT excitations, consistent with the screened asymptote behavior encoded in SRSH-PCM. These results show that SVγT is the best scheme for high-throughput UV/vis absorption spectrum calculations using the ωPBEh functional from a data-driven perspective.

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

Bayesian optimization algorithms for accelerator physics

Accelerator physics relies on numerical algorithms to solve optimization problems in online accelerator control and tasks such as experimental design and model calibration in simulations. The effectiveness of optimization algorithms in discovering ideal solutions for complex challenges with limited resources often determines the problem complexity these methods can address. The accelerator physics community has recognized the advantages of Bayesian optimization algorithms, which leverage statistical surrogate models of objective functions to effectively address complex optimization challenges, especially in the presence of noise during accelerator operation and in resource-intensive physics simulations. In this review article, we offer a conceptual overview of applying Bayesian optimization techniques toward solving optimization problems in accelerator physics. We begin by providing a straightforward explanation of the essential components that make up Bayesian optimization techniques. We then give an overview of current and previous work applying and modifying these techniques to solve accelerator physics challenges. Finally, we explore practical implementation strategies for Bayesian optimization algorithms to maximize their performance, enabling users to effectively address complex optimization challenges in real-time beam control and accelerator design. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Strategically designed metal-free deep-ultraviolet birefringent crystals with superior optical properties

Finding new birefringent materials with deep-ultraviolet (DUV, λ < 200 nm) transparency is urgent, as current commercial materials cannot meet the rapidly growing demands in related application fields. Herein, three guanidinium-based compounds, C(NH 2 ) 3 CH 3 SO 3 , β-C(NH 2 ) 3 Cl, and γ-C(NH 2 ) 3 Cl, all featuring [C(NH 2 ) 3 ·X] ∞ (X = CH 3 SO 3 and Cl) pseudo layers, were designed through structural motif tailoring. Theoretical calculations indicate that these metal-free compounds all possess broad bandgaps (6.49–6.71 eV, HSE06) and remarkable birefringence (cal. 0.166–0.211 @ 1064 nm). Centimeter-sized C(NH 2 ) 3 CH 3 SO 3 crystals have been grown using a feasible aqua-solution method. Subsequently, to further optimize the properties, β/γ-C(NH 2 ) 3 Cl was remolded by further tailoring the [C(NH 2 ) 3 ] + cationic unit and the acceptor Cl - anion, and then the fourth compound NH 2 COF was theoretically constructed. Interestingly, NH 2 COF exhibits the desired coexistence of a wider bandgap (7.87 eV, HSE06) and giant birefringence (cal. 0.241 @ 1064 nm) attributed to its higher density of well-aligned birefringence-active groups (BAGs). Furthermore, among these four designed compounds, C(NH 2 ) 3 CH 3 SO 3 has been experimentally synthesized and exhibits a short UV cutoff edge. Centimeter-sized crystals have been grown using a feasible aqueous solution method. This study provides an effective strategy to optimize the density of BAGs for large birefringence and offers valuable insights into the strategic design of metal-free DUV birefringent crystals.

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

Technoeconomic Design Optimization for Fast Reactors. Part I: Workflow Development and Case Study for Small LFR District Energy Application

The nuclear industry is developing small reactor designs that can target a variety of deployment locations and energy products. Smaller nuclear designs have traditionally struggled to handle the steep trade-offs between size and cost that have historically incentivized large reactors. This motivates computational optimization of small reactors to minimize costs and quantify the trade-off between size and cost. In this paper, the cost/size trade-off for a small fast reactor is derived using a multi-objective genetic algorithm optimization, with steady-state, transient, and cost analysis of the fast reactor being performed. Specifically, the method is demonstrated on a small 10- to 120-MW(thermal) U-Pu-Zr–fueled lead-cooled fast reactor with a 10-year core life for district energy applications, which can have a thermal load compatible with this range. The results reinforced that fast reactor cores at the lower end of this power range suffer cost penalties due to critical mass considerations. It was found that high power density cores with strong reactivity swings and many control rods were favored over designing to minimize reactivity swing. Furthermore, this contrasts with some traditional configurations designed using engineering judgment and demonstrates that optimizers can find nontraditional but realistic solutions, along with demonstrating the value of incorporating cost functions into whole-reactor design optimization.

Fast reactor↗
DOE OSTI2025

hdsullivan/ResSR

This is the official implementation of ResSR [1]. ResSR is a computationally efficient MSI-SR method that achieves high-quality reconstructions by using a closed-form spectral decomposition along with a spatial residual correction. ResSR applies singular value decomposition to identify correlations across spectral bands, uses pixel-wise computation to upsample the MSI, and then applies a residual correction process to correct the high-spatial frequency components of the upsampled bands. While ResSR is formulated as the solution to a spatially-coupled optimization problem, we use pixel-wise regularization and derive an approximate closed-form solution, resulting in a pixel-wise algorithm with a dramatic reduction in computation that achieves state-of-the-art reconstructions. [1] Duba-Sullivan, H., Reid, E. J., Voisin, S., Bouman, C. A., & Buzzard, G. T. (2024). ResSR: A Computationally Efficient Residual Approach to Super-Resolving Multispectral Images. arXiv preprint arXiv:2408.13225.

Duba-Sullivan, Haley [Oak Ridge National Laborator↗
DOE OSTI2025

Analysis of the Trusted Inertial Terrain-Aided Navigation Measurement Function

The trusted inertial terrain-aided navigation (TITAN) algorithm leverages an airborne vertical synthetic aperture radar to measure the range to the closest ground points along several prescribed iso-Doppler contours. These TITAN minimum-range, prescribed-Doppler measurements are the result of a constrained nonlinear optimization problem whose optimization function and constraints both depend on the radar position and velocity. Owing to the complexity of this measurement definition, analysis of the TITAN algorithm is lacking in prior work. This publication offers such an analysis, making the following three contributions: (1) an analytical solution to the TITAN constrained optimization measurement problem, (2) a derivation of the TITAN measurement function Jacobian, and (3) a derivation of the Cramér-Rao lower bound on the estimated position and velocity error covariance. These three contributions are verified via Monte Carlo simulations over synthetic terrain, which further reveal two remarkable properties of the TITAN algorithm: (1) the along-track positioning errors tend to be smaller than the cross-track positioning errors, and (2) the cross-track positioning errors are independent of the terrain roughness.

TITAN↗
DOE OSTI2025

Machine Learning-Assisted Distribution System Network Reconfiguration Problem

High penetration from volatile renewable energy resources in the grid and the varying nature of loads raise the need for frequent line switching to ensure the efficient operation of electrical distribution networks. Operators must ensure maximum load delivery, reduced losses, and the operation between voltage limits. However, computations to decide the optimal feeder configuration are often computationally expensive and intractable, making it unfavorable for real-time operations. This is mainly due to the existence of binary variables in the network reconfiguration optimization problem. To tackle this issue, we have devised an approach that leverages machine learning techniques to reshape distribution networks featuring multiple substations. This involves predicting the substation responsible for serving each part of the network. Hence, it leaves simple and more tractable Optimal Power Flow problems to be solved. This method can produce accurate results in a significantly faster time, as demonstrated using the IEEE 37-bus distribution feeder. Compared to the traditional optimization-based approaches, a feasible solution is achieved approximately ten times faster for all the tested scenarios.

deep neural networks↗
DOE OSTI2025

Quantum annealing for combinatorial optimization: a benchmarking study

Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of qubits and their connectivity, the QA hardware did not show such an advantage over classical methods in past benchmarking studies. Recent advancements in QA with more than 5000 qubits, enhanced qubit connectivity, and the hybrid architecture promise to realize the quantum advantage. Here, we use a quantum annealer with state-of-the-art techniques and benchmark its performance against classical solvers. To compare their performance, we solve over 50 optimization problem instances represented by large and dense Hamiltonian matrices using quantum and classical solvers. The results demonstrate that a state-of-the-art quantum solver has higher accuracy (~0.013%) and a significantly faster problem-solving time (~6561×) than the best classical solver. Our results highlight the advantages of leveraging QA over classical counterparts, particularly in hybrid configurations, for achieving high accuracy and substantially reduced problem solving time in large-scale real-world optimization problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Nonlinear optimal recovery in Hilbert spaces

Here, this paper investigates solution strategies for nonlinear problems in Hilbert spaces, such as nonlinear partial differential equations (PDEs) in Sobolev spaces, when only finite measurements are available. We formulate this as a nonlinear optimal recovery problem, establishing its well-posedness and proving its convergence to the true solution as the number of measurements increases. However, the resulting formulation might not have a finite-dimensional solution in general. We thus present a sufficient condition for the finite dimensionality of the solution, applicable to problems with well-defined point evaluation measurements. To address the broader setting, we introduce a relaxed nonlinear optimal recovery and provide a detailed convergence analysis. An illustrative example is given to demonstrate that our formulations and theoretical findings offer a comprehensive framework for solving nonlinear problems in infinite-dimensional spaces with limited data.

convergence↗
DOE OSTI2026

Robust Optimal Experimental Design of Infinite-Dimensional Bayesian Nonlinear Inverse Problems

Abstract. We consider robust optimal experimental design (ROED) for nonlinear Bayesian inverse problems governed by partial differential equations (PDEs). An optimal design is one that maximizes some utility quantifying the quality of the solution of an inverse problem. However, the optimal design is dependent on elements of the inverse problem such as the simulation model, the prior, or the measurement error model. ROED aims to produce an optimal design that is aware of the additional uncertainties encoded in the inverse problem and remains optimal even after variations in them. We follow a worst-case scenario approach to develop a new framework for robust optimal design of nonlinear Bayesian inverse problems. The proposed framework (a) is scalable and designed for infinite-dimensional Bayesian nonlinear inverse problems constrained by PDEs; (b) develops efficient approximations of the utility, namely the expected information gain; (c) employs eigenvalue sensitivity techniques to develop analytical forms and efficient evaluation methods of the gradient of the utility with respect to the uncertainties against which we wish to be robust; and (d) employs a probabilistic optimization paradigm that properly defines and efficiently solves the resulting combinatorial max-min optimization problem. The effectiveness of the proposed approach is illustrated for optimal sensor placement problem in an inverse problem governed by an elliptic PDE.

Chowdhary, Abhijit↗
DOE OSTI2025

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗