Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimized”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Analysis and optimization of seismic monitoring networks with Bayesian optimal experimental design

SUMMARY Monitoring networks increasingly aim to assimilate data from a large number of diverse sensors covering many sensing modalities. Bayesian optimal experimental design (OED) seeks to identify data, sensor configurations or experiments which can optimally reduce uncertainty and hence increase the performance of a monitoring network. Information theory guides OED by formulating the choice of experiment or sensor placement as an optimization problem that maximizes the expected information gain (EIG) about quantities of interest given prior knowledge and models of expected observation data. Therefore, within the context of seismo-acoustic monitoring, we can use Bayesian OED to configure sensor networks by choosing sensor locations, types and fidelity in order to improve our ability to identify and locate seismic sources. In this work, we develop the framework necessary to use Bayesian OED to optimize a sensor network’s ability to locate seismic events from arrival time data of detected seismic phases at the regional-scale. This framework requires five elements: (i) A likelihood function that describes the distribution of detection and traveltime data from the sensor network, (ii) A prior distribution that describes a priori belief about seismic events, (iii) A Bayesian solver that uses a prior and likelihood to identify the posterior distribution of seismic events given the data, (iv) An algorithm to compute EIG about seismic events over a data set of hypothetical prior events, (v) An optimizer that finds a sensor network which maximizes EIG. Once we have developed this framework, we explore many relevant questions to monitoring such as: how to trade off sensor fidelity and earth model uncertainty; how sensor types, number and locations influence uncertainty; and how prior models and constraints influence sensor placement.

58 GEOSCIENCES↗
DOE OSTI2021

Analysis and Optimization of Seismo-Acoustic Monitoring Networks with Bayesian Optimal Experimental Design

The Bayesian optimal experimental design (OED) problem seeks to identify data, sensor configurations, or experiments which can optimally reduce uncertainty. The goal of OED is to find an experiment that maximizes the expected information gain (EIG) about quantities of interest given prior knowledge about expected data. Therefore, within the context of seismic monitoring, we can use Bayesian OED to configure sensor networks by choosing sensor locations, types, and fidelity in order to improve our ability to identify and locate seismic sources. In this work, we develop the framework necessary to use Bayesian OED to optimize the ability to locate seismic events from arrival time data of detected seismic phases. In order to do utilize Bayesian OED we must develop four elements:1. A likelihood function that describes the uncertainty of detection and travel times; 2. A Bayesian solver that takes a prior and likelihood to identify the posterior; 3. An algorithm to compute EIG; and, 4. An optimizer that finds a sensor network which maximizes EIG. Once we have developed this framework, we can explore many relevant questions to monitoring such as: how and what multiphenomenology data can be used to optimally reduce uncertainty, how to trade off sensor fidelity and earth model uncertainty, and how sensor types, number, and locations influence uncertainty

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Component-wise reduced-order model design optimization such as for lattice design optimization

Systems and methods for optimizing a lattice structure design are disclosed herein. In some embodiments, a method for optimizing a lattice structure design can include (i) modeling the lattice structure with a component-wise reduced-order model (CWROM) and (ii) optimizing the CWROM based on a selected criterion using a topology optimization algorithm for lattice design. The selected criterion can include a boundary condition and a load applied to the lattice structure. By modeling the lattice structure as a CWROM, the optimization process can be very fast while still permitting the accurate computation of physical quantities of the lattice structure.

Choi, Youngsoo↗
DOE OSTI2023

Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition

In “Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition,” we review the state of the art in practical algorithms for scheduling power-systems operations in the short term and the results of the recent competition organized by the U.S. Advanced Research Projects Agency–Energy. We explain the mixed-integer nonlinear formulation used in the competition for nonspecialists in electrical engineering, the context and organization of the competition, and the performance of competitors. We find that the collective approaches and results of competitors provide support for efforts to move nonlinear optimization techniques into industrial applications, as they have proven to be a robust and efficient alternative to current linear approximation techniques.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Toward a scalable robust security-constrained optimal power flow using a proximal projection bundle method

Robust security-constrained optimal power flow (rSCOPF) aims to find the worst-case contingencies of alternating current optimal power flow (ACOPF) in power systems. With the rise of GPU architectures on the upcoming supercomputer architectures, optimization algorithms that rely on sparse linear algebra and indefinite linear systems are becoming increasingly hard to solve efficiently (e.g. interior-point method). To address this we revisit a maximin optimization formulation of the rSCOPF and the single-level mixed-integer semidefinite programming (MISDP) reformulation, which is obtained by taking the Lagrangian relaxation of the inner minimization ACOPF problem. In this paper, we focus on the development of a proximal projection bundle method (PPBM) for solving continuous relaxation node subproblems of the MISDP problem, based primarily on the well-known alternating direction method of multipliers. Cutting planes reminiscent of bundle method ideas are also applied in coordination with updates of the proximal parameter. The cutting-plane method can generate a large number of linear inequalities, leading to a large scale but decomposable quadratic programming (QP) subproblem that is amenable to GPUs. We present the numerical results on the IEEE 30, 57, 118, and 300-bus systems by using our PBMM method. We discuss the main computational bottleneck of our method, which is the time taken to solve each iteration of a QP subproblem instance of the PPBM, and how GPU architectures can accelerate this solution process.

bundle method↗
DOE OSTI2023

Optimization with Neural Network Feasibility Surrogates: Formulations and Application to Security-Constrained Optimal Power Flow

In many areas of constrained optimization, representing all possible constraints that give rise to an accurate feasible region can be difficult and computationally prohibitive for online use. Satisfying feasibility constraints becomes more challenging in high-dimensional, non-convex regimes which are common in engineering applications. A prominent example that is explored in the manuscript is the security-constrained optimal power flow (SCOPF) problem, which minimizes power generation costs, while enforcing system feasibility under contingency failures in the transmission network. In its full form, this problem has been modeled as a nonlinear two-stage stochastic programming problem. In this work, we propose a hybrid structure that incorporates and takes advantage of both a high-fidelity physical model and fast machine learning surrogates. Neural network (NN) models have been shown to classify highly non-linear functions and can be trained offline but require large training sets. In this work, we present how model-guided sampling can efficiently create datasets that are highly informative to a NN classifier for non-convex functions. We show how the resultant NN surrogates can be integrated into a non-linear program as smooth, continuous functions to simultaneously optimize the objective function and enforce feasibility using existing non-linear solvers. Overall, this allows us to optimize instances of the SCOPF problem with an order of magnitude CPU improvement over existing methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Optimizing the optimizer for physics-informed neural networks and Kolmogorov-Arnold networks

Physics-Informed Neural Networks (PINNs) have revolutionized the computation of PDE solutions by integrating partial differential equations (PDEs) into the neural network’s training process as soft constraints, becoming an important component of the scientific machine learning (SciML) ecosystem. More recently, physics-informed Kolmogorv-Arnold networks (PIKANs) have also shown to be effective and comparable in accuracy with PINNs. In their current implementation, both PINNs and PIKANs are mainly optimized using first-order methods like Adam, as well as quasi-Newton methods such as BFGS and its low-memory variant, L-BFGS. However, these optimizers often struggle with highly nonlinear and non-convex loss landscapes, leading to challenges such as slow convergence, local minima entrapment, and (non)degenerate saddle points. In this study, we investigate the performance of Self- Scaled BFGS (SSBFGS), Self-Scaled Broyden (SSBroyden) methods and other advanced quasi-Newton schemes, including BFGS and L-BFGS with different line search strategies. These methods dynamically rescale updates based on historical gradient information, thus enhancing training efficiency and accuracy. We systematically compare these optimizers – using both PINNs and PIKANs – on key challenging PDEs, including the Burgers, Allen-Cahn, Kuramoto-Sivashinsky, Ginzburg-Landau, and Stokes equations. Additionally, we evaluate the performance of SSBFGS and SSBroyden for Deep Operator Network (DeepONet) architectures, demonstrating their effectiveness for data-driven operator learning. Our findings provide state-of-the-art results with orders-of-magnitude accuracy improvements without the use of adaptive weights or any other enhancements typically employed in PINNs. More broadly, our work reveal insights into the effectiveness of quasi-Newton optimization strategies in significantly improving the convergence and accurate generalization of PINNs and PIKANs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Optimal Orbital Selection for Full Configuration Interaction (OptOrbFCI): Pursuing the Basis Set Limit under a Budget

Full configuration interaction (FCI) solvers are limited to small basis sets due to their expensive computational costs. An optimal orbital selection for FCI (OptOrbFCI) is proposed to boost the power of existing FCI solvers to pursue the basis set limit under a computational budget. The optimization problem coincides with that of the complete active space SCF method (CASSCF), while OptOrbFCI is algorithmically quite different. OptOrbFCI effectively finds an optimal rotation matrix via solving a constrained optimization problem directly to compress the orbitals of large basis sets to one with a manageable size, conducts FCI calculations only on rotated orbital sets, and produces a variational ground-state energy and its wave function. Coupled with coordinate descent full configuration interaction (CDFCI), we demonstrate the efficiency and accuracy of the method on the carbon dimer and nitrogen dimer under basis sets up to cc-pV5Z. We also benchmark the binding curve of the nitrogen dimer under the cc-pVQZ basis set with 28 selected orbitals, which provide consistently lower ground-state energies than the FCI results under the cc-pVDZ basis set. Furthermore, the dissociation energy in this case is found to be of higher accuracy.

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

Next-Cycle Optimal Fuel Control for Cycle-to-Cycle Variability Reduction in EGR-Diluted Combustion

In this simulation study, cycle-to-cycle fuel control was used to reduce CCV by injecting additional fuel in operating conditions with sporadic misfires and partial burns. An optimal control policy was proposed that utilizes 1) a physics-based model that tracks in-cylinder gas composition and 2) a one-step-ahead prediction of the combustion efficiency based on a kernel density estimator. The optimal solution, however, presents a tradeoff between the reduction in combustion CCV and the increase in fuel injection quantity required to stabilize the charge. Such a tradeoff can be ad- just by a single parameter embedded in the cost function.

Maldonado, BryanP. [Oak Ridge National Lab. (ORNL)↗
DOE OSTI2021

Analysis and Optimization of a Multi-Layer Integrated Organic Substrate for High Current GaN HEMT-Based Power Module

In this paper, analysis and optimization of a multi-layer organic substrate for high current GaN HEMT based power module are discussed. The organic multi-layer substrates can provide high electrical performance in terms of low parasitic inductance in the power loop by providing vertical layout, and shielding for reduction of common-mode noise, a common problem in fast switching power converters. Furthermore, high performance cooling solutions, such as micro-channel heat sinks, can be directly bonded to the substrate for optimum thermal management. The structure of the proposed architecture, thermal analysis and optimization of layer thickness, thermo-mechanical stress analysis of the GaN HEMT and development of a high-performance heat sink are discussed.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Benchmarking optimization methods for materials research: Gradient descent and Bayesian optimization for lithium-ion battery aging diagnostics

Accurate and efficient parameter estimation is essential for battery diagnostics and aging analysis. Here, in this study, we compare two optimization-based approaches—gradient descent and Bayesian optimization—for extracting parameters from differential voltage analysis in lithium-ion batteries. While these techniques are widely used, their relative strengths and limitations for this application are not well understood. The study evaluates the trade-offs between these methods in terms of result quality, computational cost, and reliability within this specific application. The diagnostic results from our battery data suggest adopting gradient descent as an initial method for rapid and efficient analysis, while employing more stable optimization techniques, such as Bayesian optimization, as a verification step to mitigate potential instability. Comparing the two methods provides information on algorithmic choice, while inspiring further discussions on selecting appropriate techniques for specific research tasks.

Zhao, Ziqing [Boston Univ., MA (United States)] (O↗
DOE OSTI2025

Optimization of an aerostructural machining process using physics-guided Bayesian stability modelling

Existing algorithms for predicting milling chatter have not been widely adopted in industry since they require specialized instruments to measure the stability inputs. This study describes how the machining process for a meter-scale aluminum aerostructure was optimized using a physics-guided Bayesian stability model. The study was performed in collaboration with an industrial partner on production machines to evaluate the practicality of the proposed method under real-world conditions. For each cutting tool, the Bayesian approach automatically selected a small number of cutting tests, which were monitored using a microphone to observe the chatter frequency. The algorithm learned the system dynamics, cutting forces, and stability map from these test results. A novel algorithm for predicting tool bending stress was incorporated into the test selection algorithm to avoid tool breakage. On average, each set of optimized cutting parameters required less than six tests to identify and were 97% more productive than baseline parameters from the cutting tool manufacturer. The machining program was then further optimized using commercial feedrate scheduling software to remove cutting force spikes and reduce air cutting time. Five components were machined using the optimized process. These results demonstrate the potential for physics-guided Bayesian models to improve productivity in industrial settings.

Cornelius, Aaron [UT Knoxville]↗
DOE OSTI2021

The Cell Utilized Partitioning Model as a Predictive Tool for Optimizing Counter-Current Chromatography Processes

Counter-current chromatography (CCC) is capable of unique elution modes that isolate analytes using the movement of the stationary phase in addition to moving the mobile phase. These modes include elution-extrusion CCC (EECCC) and dual-mode CCC (DM CCC) that are not possible in traditional solid-liquid chromatography systems. Although EECCC and DM CCC are widely used to recover highly retained components, to our knowledge, optimizing the elution process in these modes with predictive models has not been reported. To address this gap, we developed a predictive model for CCC dubbed the Cell Utilized Partitioning (CUP) model. The CUP model accurately predicts the effluents of multicomponent separations in EECCC and DM CCC modes when compared to experimental data. Furthermore, CUP model simulations were extended to investigate the influence of operating and intrinsic parameters on the yield and productivity, and to compare the separation performances of EECCC and DM CCC in various conditions. The results demonstrate that low distribution constants, usually a KD less than 1, and a selectivity > 1.3, under specific flowrate ranges, increase both productivity and yield. From these results, generalized optimization and scaleup guidelines are proposed that can apply to research settings and to industrial processes to maximize preparative CCC performance.

BIOMASS FUELS,INORGANIC, ORGANIC, PHYSICAL, AND AN↗
DOE OSTI2020

Machine learning the Hubbard U parameter in DFT+U using Bayesian optimization

Abstract Within density functional theory (DFT), adding a Hubbard U correction can mitigate some of the deficiencies of local and semi-local exchange-correlation functionals, while maintaining computational efficiency. However, the accuracy of DFT+U largely depends on the chosen Hubbard U values. We propose an approach to determining the optimal U parameters for a given material by machine learning. The Bayesian optimization (BO) algorithm is used with an objective function formulated to reproduce the band structures produced by more accurate hybrid functionals. This approach is demonstrated for transition metal oxides, europium chalcogenides, and narrow-gap semiconductors. The band structures obtained using the BO U values are in agreement with hybrid functional results. Additionally, comparison to the linear response (LR) approach to determining U demonstrates that the BO method is superior.

Chemistry↗
DOE OSTI2020

Black-Box Optimization for Design of Concentrating Solar Power and Photovoltaic Hybrid Systems with Optimal Dispatch Decisions

The hybridization of concentrating solar power (CSP) and photovoltaics (PV) can enable dispatchable renewable electricity generation at a lower price than current stand-alone CSP systems. However, designing a CSP-PV hybrid system can be challenging because of the many degrees of freedom in design that affect the internal and external system interactions and trade-offs. We develop a methodology to determine optimal designs for CSP-PV hybrids by implementing NLopt's derivative-free, or “black-box,” algorithms around pre-existing CSP-PV hybrid simulation software that utilizes the National Renewable Energy Laboratory’s System Advisor Model (SAM); we then employ a dispatch optimization model to determine operational decisions that maximize a plant’s profits. We present optimal designs for CSP-PV hybrid systems dispatching against four time-of-delivery (ToD) pricing structures. NLopt’s algorithms can improve the base case design’s power purchase agreement (PPA) price by 15% to 21%, depending on the ToD pricing structure. In addition, we present the resulting optimal CSP-PV hybrid design’s annual performance metrics, which tend to have capacity factors between 50% and 62%, but are able to generate electricity during the year’s highest-valued periods about 90% of the time. Lastly, we investigate the trade-offs between capacity factor and PPA price using Pareto fronts and demonstrate that, for some ToD pricing structures, the system capacity factor can increase by 20% but at the expense of a 2% increase in PPA price.

black-box↗
DOE OSTI2021

Optimal Protocols in Quantum Annealing and Quantum Approximate Optimization Algorithm Problems

Quantum annealing (QA) and the quantum approximate optimization algorithm (QAOA) are two special cases of the following control problem: apply a combination of two Hamiltonians to minimize the energy of a quantum state. Which is more effective has remained unclear. Here we analytically apply the framework of optimal control theory to show that generically, given a fixed amount of time, the optimal procedure has the pulsed (or “bang-bang”) structure of QAOA at the beginning and end but can have a smooth annealing structure in between. This is in contrast to previous works which have suggested that bang-bang (i.e., QAOA) protocols are ideal. To support this theoretical work, we carry out simulations of various transverse field Ising models, demonstrating that bang-anneal-bang protocols are more common. Futher, the general features identified here provide guideposts for the nascent experimental implementations of quantum optimization algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Data-Driven Modeling and Optimization of Building Energy Consumption: a Case Study

Installing sensors and Building Automation Systems (BAS) allows controlling the facility operations while generating data that can be analyzed for model development. This work focuses on data-driven modeling of the building to optimize energy consumption. The City of Orlando aims to reduce its energy consumption so, they provided us access to their BAS for data and studying the operation of its facilities. We selected a mid-size pilot building to conduct data analysis and modeling. We develop an Application Programming Interface (API) to login to the servers and scrape data. The scraped data contains features ranging from environmental conditions to equipment activity. This dataset is a time series so, it's handled in accordance and analyzed to investigate patterns and relations between data points that help choose parameters for predictive models for building and equipment. Finally, the models are optimized to reduce the energy consumption of the facility.

Grover, Divas↗