Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Point 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 667 records · Page 37
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Implementation of a Metamodel-Based Optimization for the Design of a High Power Density Wound Field Traction Motor

Traction motors onboard electric vehicles (EVs) are faced with ever-increasing power density requirements and cost reduction challenges. Although permanent magnet (PM) traction motors have been favored for their potential of higher power densities, the price and supply volatility of PM materials are the major drawbacks. Instead of a single load point, the performance of a traction motor needs to be optimized over various combinations of torque and speed to represent real-world vehicular driving scenarios, which tends to be a time-consuming task with direct optimizations. In this study, as a PM-free solution, a wound field synchronous motor (WFSM) is designed and optimized using a metamodel-based approach to maximize its efficiency over a custom set of load points, while utilizing a fully per-unitized geometry template. The workflow has proven to be timesaving and the optimal design is prototyped and tested.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2021

Gradient-Informed Design Optimization of Select Nuclear Systems

In this work, we present a gradient-informed design optimization of nuclear reactor core components based on neutronics objectives with both continuous and discrete materials. The main argument in favor of using gradient-informed design optimization is that it scales well with increasing dimensionality of the design space. First, a challenge problem with 121 free parameters is solved with a gradient-informed method and then with a genetic algorithm. Then, a challenge problem to optimize the flux profile of a simplified assembly with eight axial zones is solved. Both challenge problems are solved using directly calculated derivatives from Tools for Sensitivity and Uncertainty Analysis Methodology Implementation (TSUNAMI) in the SCALE package. Furthermore, we demonstrate how a discrete optimization problem—selection of materials for 121 voxels—can be lifted into a continuous problem with mixed materials. In the continuous space, adjoint-based gradients are well-defined, and gradient descent is applicable. Then, a forcing function is introduced that with the selection of an appropriately sized hyperparameter can be used to guide the optimized continuous solution back into a discrete solution. This paper presents an account of the challenges that were faced when applying a gradient-informed optimization algorithm using a Monte Carlo calculation to estimate the gradient information and compares a gradient descent optimization method to a genetic algorithm optimization of the same geometry. Overall, this work demonstrates the potential use of adjoint-based gradient calculations in design optimization of nuclear systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

Nonlinear Multiobjective MPC-Based Optimal Operation of a High Consistency Refining System in Papermaking

As one of the most important unit in the papermaking industry, the high consistency (HC) refining system is confronted with challenges such as improving pulp quality, energy saving, and emissions reduction in its operation processes. Here in this correspondence, an optimal operation of HC refining system is presented using nonlinear multiobjective model predictive control strategies that aim at set-point tracking objective of pulp quality, economic objective, and specific energy (SE) consumption objective, respectively. First, a set of input and output data at different times are employed to construct the subprocess model of the state process model for the HC refining system, and then the Wiener-type model can be obtained through combining the mechanism model of Canadian Standard Freeness and the state process model that determines their structures based on Akaike information criterion. Second, the multiobjective optimization strategy that optimizes both the set-point tracking objective of pulp quality and SE consumption is proposed simultaneously, which uses NSGA-II approach to obtain the Pareto optimal set. Furthermore, targeting at the set-point tracking objective of pulp quality, economic objective, and SE consumption objective, the sequential quadratic programming method is utilized to produce the optimal predictive controllers. In conclusion, the simulation results demonstrate that the proposed methods can make the HC refining system provide a better performance of set-point tracking of pulp quality when these predictive controllers are employed. In addition, while the optimal predictive controllers orienting with comprehensive economic objective and SE consumption objective, it has been shown that they have significantly reduced the energy consumption.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS2019

Efficient computation of optimal low thrust gravity perturbed orbit transfers

We have developed a new method for solving low-thrust fuel-optimal orbit transfer problems in the vicinity of a large body (planet or asteroid), considering a high-fidelity spherical harmonic gravity model. The algorithm is formulated via the indirect optimization method, leading to a two-point boundary value problem (TPBVP). We make use of a hyperbolic tangent smoothing law for performing continuation on the thrust magnitude to reduce the sharpness of the control switches in early iterations and thus promote convergence. The TPBVP is solved using the method of particular solutions (MPS) shooting method and Picard-Chebyshev numerical integration. Application of Picard-Chebyshev integration affords an avenue for increased efficiency that is not available with step-by-step integrators. We demonstrate that computing the particular solutions with only a low-fidelity force model greatly increases the efficiency of the algorithm while ultimately achieving near machine precision accuracy. A salient feature of the MPS is that it is parallelizable, and thus further speedups are available. It is also shown that, for near Earth orbits and over a small number of en-route revolutions around the Earth, only the zonal perturbation terms are required in the costate equations to obtain a solution that is accurate to machine precision and optimal to engineering precision. The proposed framework can be used for trajectory design around small asteroids and also for orbit debris rendezvous and removal tasks.

Junkins, John L.↗
DOE OSTI2024

Improved Manufacturability and Throughput of Ultra- Transparent, Super-Insulating Aerogels

AeroShield Materials produces a novel silica aerogel material with exemplary thermal performance and unprecedented optical clarity, offering the potential for super-insulating fenestration and insulated glass to reduce thermal losses in the built environment by billions of dollars every year. One of the most significant challenges facing AeroShield today is the total amount of time that is required to produce large monolithic aerogel samples. This overall process can require as much as 144 hours total, which can significantly hinder scale-up to an economically viable product. The purpose of this Phase 1 research was to continue development of our novel aerogel manufacturing process to reduce material processing time by up to 10x, greatly improving product throughput and reducing cost. AeroShield’s manufacturing process can be divided into 4 major stages, each with their own distinct set of parameters and time requirements. Under this Phase 1 award, AeroShield was able to identify and optimize a number of these parameters, including molding materials, solvent rinse conditions, critical point drying time, and annealing conditions. AeroShield also performed thorough analyses on how these optimized parameters affected important final characteristics of the gels, including optical clarity, thermal conductivity, and dimensional stability. This campaign culminated in the production of laboratory scale aerogel samples using significantly lower process times of both 36 and 18 total hours, which represent Phase 1 Target and Stretch goals. In order to achieve widespread market adoption, monolithic sheets of the aerogel material must be made to industry-standard sizes (8’ x 12’) at a cost that provides 5-7 year or less breakeven energy savings for consumers (<$2 sq/ft). The work performed under this Phase 1 award shows that time and materials required to make aerogel samples, which make up a significant portion of their overall cost, can be greatly reduced without sacrificing quality. AeroShield plans to use these optimized processes to produce larger, product-relevant sized aerogels in order to achieve target final material costs.

Wilke, Kyle↗
NASA NTRS1993

Optimal gains for a single polar orbiting satellite

Gains are the spatial weighting of an observation in its neighborhood versus the local values of a model prediction. They are the key to data assimilation, as they are the direct measure of how the data are used to guide the model. As derived in the broad context of data assimilation by Kalman and in the context of meteorology, for example, by Rutherford, the optimal gains are functions of the prediction error covariances between the observation and analysis points. Kalman introduced a very powerful technique that allows one to calculate these optimal gains at the time of each observation. Unfortunately, this technique is both computationally expensive and often numerically unstable for dynamical systems of the magnitude of meteorological models, and thus is unsuited for use in PMIRR data assimilation. However, the optimal gains as calculated by a Kalman filter do reach a steady state for regular observing patterns like that of a satellite. In this steady state, the gains are constants in time, and thus could conceivably be computed off-line. These steady-state Kalman gains (i.e., Wiener gains) would yield optimal performance without the computational burden of true Kalman filtering. We proposed to use this type of constant-in-time Wiener gain for the assimilation of data from PMIRR and Mars Observer.

Banfield, Don↗
NASA NTRS2012

On Optimal Control of Non-Autonomous Switched Systems with a Fixed Mode Sequence

We consider differentiability with respect to the switch times of the value function of an optimal control problem for a non-autonomous switched system. The control variables are the switch times between the modes and the input in each mode. We provide a method to compute the derivative of the cost function given a nominal input. Then, we view the optimal control problem as a parametrized optimization problem in which the switch times are the parameters and the optimization is over the set of feasible inputs of each mode. From this point of view, we provide conditions under which the continuity and differentiability of the optimal value function, that is the cost function optimized over the inputs, can be guaranteed.

Kamgarpour, Maryam↗
DOE OSTI2025

Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Exploration

This paper proposes novel noise-free Bayesian optimization strategies that rely on a random exploration step to enhance the accuracy of Gaussian process surrogate models. The new algorithms retain the ease of implementation of the classical GP-UCB algorithm, but the additional random exploration step accelerates their convergence, nearly achieving the optimal convergence rate. Furthermore, to facilitate Bayesian inference with intractable likelihoods, we propose to utilize optimization iterates for maximum a posteriori estimation to build a Gaussian process surrogate model for the unnormalized log-posterior density. We provide bounds for the Hellinger distance between the true and the approximate posterior distributions in terms of the number of design points. We demonstrate the effectiveness of our Bayesian optimization algorithms in nonconvex benchmark objective functions, in a machine learning hyperparameter tuning problem, and in a black-box engineering design problem. The effectiveness of our posterior approximation approach is demonstrated in two Bayesian inference problems for parameters of dynamical systems.

Bayesian inference↗
DOE OSTI2025

Impact and mitigation of polarized extragalactic foregrounds on Bayesian cosmic microwave background lensing

Future low-noise cosmic microwave background (CMB) lensing measurements from e.g., CMB-S4 will be polarization dominated, rather than temperature dominated. In this new regime, statistically optimal lensing reconstructions outperform the standard quadratic estimator, but their sensitivity to extragalactic polarized foregrounds has not been quantified. Using realistic simulations of polarized radio and infrared point sources, we show for the first time that optimal Bayesian lensing from a CMB-S4-like experiment is insensitive to the expected level of polarized extragalactic foregrounds after masking, as long as an accurate foreground power spectrum is included in the analysis. For more futuristic experiments where these foregrounds could cause a detectable bias, we propose a new method to jointly fit for lensing and the Poisson foregrounds, generalizing the bias hardening from the standard quadratic estimator to Bayesian lensing.

cosmic microwave background↗
DOE OSTI2026

ZEUS: An Efficient GPU Optimization Method Integrating PSO, BFGS, and Automatic Differentiation

We introduce a novel, efficient computational method, ZEUS, for numerical optimization, and provide an open-source implementation. It has four key ingredients: (1) particle swarm optimization (PSO), (2) the use of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method, (3) automatic differentiation (AD), and (4) GPUs. Our approach addresses the computational challenges inherent in high-dimensional, non-convex optimization problems. In the first phase of the algorithm, we get a potentially good set of starting points using PSO. Thereafter, we run BFGS independently in parallel from these starting points. BFGS is one of the best-performing algorithms for numerical optimization. However, it requires the gradient of the function being optimized. ZEUS integrates automatic differentiation into BFGS thus avoiding the need for the user to calculate derivatives explicitly. The use of GPUs allows ZEUS to speed up the calculations substantially. We carry out systematic studies to explore the trade-offs between the number of PSO iterations taken, starting points, and BFGS iteration depth. We show that a handful of iterations of PSO can improve global convergence when combined with BFGS. We also present performance studies using common test functions. The source code can be found at https://github.com/fnal-numerics/global-optimizer-gpu.

Soos, Dominik [Old Dominion U.]↗
NASA NTRSDate not supplied

Multidisciplinary Optimization of a Transonic Truss Braced Wing Aircraft with Hybrid-Electric Propulsion

Next generation aircraft concepts have subsystems that are increasingly inter-connected. This necessitates advanced design tools using gradient based optimization to properly account for strong subsystem coupling in these aircraft. Additionally, these design tools require accurate modeling capability to support the increased interest in electrified propulsion. Design studies for these aircraft must consider the trade-offs between electric propulsion and turbojet engines at all points in the flight envelope to determine the optimal balance between propulsion options. This paper describes the development of an electric propulsion subsystem model designed to work within Aviary - an open source aircraft design tool. We will demonstrate the electric propulsion model operating with Aviary by showing results from an optimized Transonic Truss-Braced Wing (TTBW) concept using assisted electric propulsion during climb. First, we present results with and without electrification to show the overall system impacts of hybrid electric propulsion during climb. We also present two distinct battery models compatible with this optimization framework, and compare results using both. Next, we ran the same problem using a slightly different cell type, and demonstrate a considerable change in the result. Finally, we vary the cell energy density of the batteries, and provide an illustrative trend for the system-level impact for improving cell technology.

optimization↗
DOE OSTI2023

Identifying native point defect configurations in α-alumina

Intimately intertwined atomic and electronic structures of point defects govern diffusion-limited corrosion and underpin the operation of optoelectronic devices. For some materials, complex energy landscapes containing metastable defect configurations challenge first-principles modeling efforts. Here, we thoroughly reevaluate native point defect geometries for the illustrative case of α-Al 2 O 3 by comparing three methods for sampling candidate geometries in density functional theory calculations: displacing atoms near a naively placed defect, initializing interstitials at high-symmetry points of a Voronoi decomposition, and Bayesian optimization. We find symmetry-breaking distortions for oxygen vacancies in some charge states, and we identify several distinct oxygen split-interstitial geometries that help explain literature discrepancies involving this defect. We also report a surprising and, to our knowledge, previously unknown trigonal geometry favored by aluminum interstitials in some charge states. Importantly, these new configurations may have transformative impacts on our understanding of defect migration pathways in aluminum-oxide scales protecting metal alloys from corrosion. Overall, the Voronoi scheme appears most effective for sampling candidate interstitial sites because it always succeeded in finding the lowest-energy geometry identified in this study, although no approach found every metastable configuration. Finally, we show that the position of defect levels within the band gap can depend strongly on the defect geometry, underscoring the need to conduct careful searches for ground-state geometries in defect calculations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Development of a Vibration Technique Based on Geometric Optimization for Fatigue Life Evaluation of Sandwich Composite Structures

A major obstacle to obtaining cost-effective experimental data on the fatigue life of sandwich panels is the prohibitive amount of time and cost required to carry out millions of cycles. On the other hand, vibration techniques applied to sandwich geometries fail to match the stress patterns that are obtained from standard flexural fatigue tests. To overcome such limitations, a vibration-based fatigue technique is proposed, which entails the use of sandwich specimens whose geometries are optimized to reproduce the stress distribution observed during three point bend loading while vibrating at the first resonant frequency. The proposed vibration technique was experimentally validated. The results, compared with the average number of cycles to failure at different stress ratios obtained via the Three-Point Bending test, showed high levels of accuracy. The proposed method is robust and time effective and indicates the possibility of attaining fatigue lifetime prediction of a wide class of composite elements, such as sandwich panels.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Deep reinforcement learning assisted co-optimization of Volt-VAR grid service in distribution networks

With the increasing penetration of distributed energy resources in distribution networks, Volt-VAR control and optimization (VVC/VVO) have become very important to ensure an acceptable quality of service to all customers. System operators can rely on slow-responding utility devices, including capacitor banks and on-load tap changing transformers, along with fast-responding battery and photovoltaic (PV) inverters for the VVC/VVO implementation. Because of variations in response time of these two classes of devices, and different control actions (discrete versus continuous), coordinated and optimal scheduling and operation have become of utmost importance. Here, this paper develops a look-ahead deep reinforcement learning (DRL)-based multi-objective VVO technique to improve the voltage profile of active distribution networks, decrease network and inverter power loss, and save the operational cost of the grid. It proposes a deep deterministic policy gradient (DDPG)-based approach to schedule the optimal reactive and/or active power set-points of fast-responding inverters, and a deep Q-network (DQN)-based DRL agent to schedule the discrete decisions variables of slow-responding assets. The reactive power output of PV and battery smart inverters are scheduled at 30-minute intervals and the capacitors’ commitment status is scheduled with several hour intervals. The proposed framework is validated on the modified IEEE 34-bus and 123-bus test cases with embedded PV and PV-plus-storage. To validate the efficacy of the proposed VVO, it is compared with several scenarios, including the base case without VVO, localized droop control of DERs, DDPG-only, and twin delayed DDPG (TD3) agent-based DRL techniques. The results justify the superior performance of the proposed method to improve the voltage profile, reduce network power loss, and minimize the look-ahead grid operational cost while minimizing the undesirable power losses in inverters as a result of power factor adjustments.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1994

Applications Performance Under MPL and MPI on NAS IBM SP2

On July 5, 1994, an IBM Scalable POWER parallel System (IBM SP2) with 64 nodes, was installed at the Numerical Aerodynamic Simulation (NAS) Facility Each node of NAS IBM SP2 is a "wide node" consisting of a RISC 6000/590 workstation module with a clock of 66.5 MHz which can perform four floating point operations per clock with a peak performance of 266 Mflop/s. By the end of 1994, 64 nodes of IBM SP2 will be upgraded to 160 nodes with a peak performance of 42.5 Gflop/s. An overview of the IBM SP2 hardware is presented. The basic understanding of architectural details of RS 6000/590 will help application scientists the porting, optimizing, and tuning of codes from other machines such as the CRAY C90 and the Paragon to the NAS SP2. Optimization techniques such as quad-word loading, effective utilization of two floating point units, and data cache optimization of RS 6000/590 is illustrated, with examples giving performance gains at each optimization step. The conversion of codes using Intel's message passing library NX to codes using native Message Passing Library (MPL) and the Message Passing Interface (NMI) library available on the IBM SP2 is illustrated. In particular, we will present the performance of Fast Fourier Transform (FFT) kernel from NAS Parallel Benchmarks (NPB) under MPL and MPI. We have also optimized some of Fortran BLAS 2 and BLAS 3 routines, e.g., the optimized Fortran DAXPY runs at 175 Mflop/s and optimized Fortran DGEMM runs at 230 Mflop/s per node. The performance of the NPB (Class B) on the IBM SP2 is compared with the CRAY C90, Intel Paragon, TMC CM-5E, and the CRAY T3D.

Saini, Subhash↗
NASA NTRS1996

The Newton Modified Barrier Method for QP Problems

The Modified Barrier Functions (MBF) have elements of both Classical Lagrangians (CL) and Classical Barrier Functions (CBF). The MBF methods find an unconstrained minimizer of some smooth barrier function in primal space and then update the Lagrange multipliers, while the barrier parameter either remains fixed or can be updated at each step. The numerical realization of the MBF method leads to the Newton MBF method, where the primal minimizer is found by using Newton's method. This minimizer is then used to update the Lagrange multipliers. In this paper, we examine the Newton MBF method for the Quadratic Programming (QP) problem. It will be shown that under standard second-order optimality conditions, there is a ball around the primal solution and a cut cone in the dual space such that for a set of Lagrange multipliers in this cut cone, the method converges quadratically to the primal minimizer from any point in the aforementioned ball, and continues to do so after each Lagrange multiplier update. The Lagrange multipliers remain within the cut cone and converge linearly to their optimal values. Any point in this ball will be called a "hot start". Starting at such a "hot start", at most Omicron(1n 1n epsilon(exp -1)) Newton steps are sufficient to perform the primal minimization which is necessary for the Lagrange multiplier update. Here, epsilon > 0 is the desired accuracy. Because of the linear convergence of the Lagrange multipliers, this means that only Omicron(1n epsilon(exp -1))omicron(ln 1n epsilon(exp-1)) Newton steps are required to reach an epsilon-approximation to the solution from any "hot start". In order to reach the "hot start", one has to perform Omicron(square root(m) 1n C) Newton steps, where m characterizes the size of the problem and C > 0 is the condition number of the QP problem. This condition number will be characterized explicitly in terms of key parameters of the QP problem, which in turn depend on the input data and the size of the problem.

Melman, A.↗
DOE OSTI2023

Chapter 6: Surrogate Model Guided Optimization Algorithms and Their Potential Use in Autonomous Experimentation

This chapter reviews the basics of derivative-free optimization methods based on surrogate models and outlines how these methods can straightforwardly be applied to autonomously steering experimentation. It summarizes general solution approaches that use surrogate models and active learning. Surrogate modeling is often combined with active learning strategies, where in each iteration of the optimization algorithm, the surrogate model is used to identify which new inputs should be evaluated next and given the new input-output pair, the surrogate model is updated. Regardless of feasibility, the surrogate models for the constraints are updated in each iteration of the optimization algorithm, while the surrogate model for the objective function is only updated when a feasible point has been found. Similarly to the case of computationally cheap constraints, the surrogate models of the constraints should be incorporated into the definition of the auxiliary optimization problem that is solved to select new sample points.

active learning↗