Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization methods”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Enhanced Data Efficiency Using Deep Neural Networks and Gaussian Processes for Aerodynamic Design Optimization

Adjoint-based optimization methods are attractive for aerodynamic shape design primarily due to their computational costs being independent of the dimensionality of the input space and their ability to generate high-fidelity gradients that can then be used in a gradient-based optimizer. This makes them very well suited for high-fidelity simulation based aerodynamic shape optimization of highly parametrized geometries such as aircraft wings. However, the development of adjoint-based solvers involve careful mathematical treatment and their implementation require detailed software development. Furthermore, they can become prohibitively expensive when multiple optimization problems are being solved, each requiring multiple restarts to circumvent local optima. In this work, we propose a machine learning enabled, surrogate-based framework that replaces the expensive adjoint solver, without compromising on predicting predictive accuracy. Specifically, we first train a deep neural network (DNN) from training data generated from evaluating the high-fidelity simulation model on a model-agnostic design of experiments on the geometry shape parameters. The optimum shape may then be computed by using a gradient-based optimizer coupled with the trained DNN. Subsequently, we also perform a gradient-free Bayesian optimization, where the trained DNN is used as the prior mean. We observe that the latter framework (DNN-BO) improves upon the DNN-only based optimization strategy for the same computational cost. Overall, this framework predicts the true optimum with very high accuracy, while requiring far fewer high-fidelity function calls compared to the adjoint-based method. Furthermore, we show that multiple optimization problems can be solved with the same machine learning model with high accuracy, to amortize the offline costs associated with constructing our models. Our methodology finds applications in the early stages of aerospace design. (C) 2021 Published by Elsevier Masson SAS.

Renganathan, S. Ashwin↗
DOE OSTI2022

Turbine scale and siting considerations in wind plant layout optimization and implications for capacity density

Improvements in wind energy technology, reduced costs, and ambitious clean energy goals have led to projections of high wind contribution in coming years. Developing methodologies to design wind plants with a variety of siting constraints and turbine sizes helps enable high wind penetration, and gain a better understanding of how wind plants are sensitive to setback constraints and turbine design. In this paper, we present a two-step optimization method to simultaneously determine the optimal number of turbines and their locations in a wind plant domain divided into many small, discrete parcels. We present the optimized performance metrics of a wind plant optimized with different turbine sizes and ratings, and with different siting restrictions within the wind plant. Our results indicate that taller and larger turbines are more sensitive to increasing siting constraints. We also compare the optimal wind plant layouts and performance for wind plants optimized for minimum COE and maximum profit. Wind plants optimized for profit had 130%-190% of the capacity of plants optimized for COE, which demonstrates that the optimal results are greatly affected by the objective function, which should be carefully considered. Finally, in this paper we demonstrate the effect of increasing siting constraints on wind plant capacity density, and how the results change when different land areas are used to calculate capacity density. When using the entire wind plant boundary area to determine capacity density, increasing siting constraints decreases the capacity density. However, when we only use the available area (the area left after removing the siting constraints) to calculate the capacity density, increasing the siting constraints increases capacity density. This is a critical insight because of how capacity density is typically defined and used in research, and has important implications for assessment of technical potential and capacity expansion modeling, as well as future wind deployment potential.

17 WIND ENERGY↗
DOE OSTI2015

SU-E-T-527: Is CTV-Based Robust Optimized IMPT in Non-Small-Cell Lung Cancer Robust Against Respiratory Motion?

Purpose: To determine which proton planning technique on average-CT is more vulnerable to respiratory motion induced density changes and interplay effect among (a) IMPT of CTV-based minimax robust optimization with 5mm set-up error considered, (b, c) IMPT/SFUD of 5mm-expanded PTV optimization. Methods: Three planning techniques were optimized in Raystation with a prescription of 60/25 (Gy/fractions) and almost the same OAR constraints/objectives for each of 10 NSCLC patients. 4D dose without/with interplay effect was recalculated on eight 4D-CT phases and accumulated after deforming the dose of each phase to a reference (exhalation phase). The change of D98% of each CTV caused by density changes and interplay was determined. In addition, evaluation of the DVH information vector (D99%, D98%, D95%, Dave, D50%, D2%, D1%) which compares the whole DVH by η score = (cosine similarity × Pearson correlation coefficient − 0.9) × 1000 quantified the degree of DVH change: score below 100 indicates changed DVH. Results: Three 3D plans of each technique satisfied our clinical goals. D98% shift mean±SD (Gy) due to density changes was largest in (c): −0.78±1.1 while (a): −0.11±0.65 and (b): − 0.59±0.93. Also the shift due to interplay effect most was (c): −.54±0.70 whereas (a): −0.25±0.93 and (b): −0.12±0.13. Moreover lowest η score caused by density change was also (c): 69, while (a) and (b) kept around 90. η score also indicated less effect of interplay than density changes. Note that generally the changed DVH were still acceptable clinically. Paired T-tests showed a significantly smaller density change effect in (a) (p<0.05) than in (b) or (c) and no significant difference in interplay effect. Conclusion: CTV-based robust optimized IMPT was more robust against respiratory motion induced density changes than PTV-based IMPT and SFUD. The interplay effect was smaller than the effect of density changes and similar among the three techniques. The JSPS Core-to-Core Program (No. 23003), Japan Society for the Promotion of Science Grant-in-Aid for Scientific Research (No. 23390300), Grant-in-Aid for Young Scientists (B) (No. 21791194) and Grant-in-Aid for Cancer Research (H22-3rd Term Cancer Control-General-043)

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

A Comparison of Machine Learning Methods of Association Tested on Dense Nodal Arrays

The association of phase picks to form events is one of the fundamental components of seismology. Large and dense sensor networks, such as >1000 geophone arrays (and distributed acoustic sensing), offer unique challenges in association due to the vast numbers of observations and high likelihood of errant picks. In addition, the large number of stations can greatly increase the time it takes to perform the association. For this reason, machine learning (ML) methods might provide a more optimal method of association for such networks. In this work, we examine how well ML methods (e.g., Gaussian mixture model association, PhaseLink, and Graph Earthquake Neural Interpretation Engine) can incorporate dense seismic arrays into regional networks and how well they handle the increasing numbers of stations. Here, we test their capabilities on two dense seismic deployments, one within Rock Valley Nevada (52 nodes and a 9-station sparse local network), and the LArge-n Seismic Survey in Oklahoma dense nodal array (>1800 vertical-component geophones). Processing data from these two different styles of dense seismic deployments allows testing of how the ML algorithms can merge array data with a broader regional network, how they deal with poorly picked phases, and how they handle anthropogenic noise. We compare the ML-associated bulletins to those obtained using the Rapid Earthquake Association and Location algorithm, a more traditional method of association. We find that there are very small differences in results between the methods for small networks (<100 stations) with low pick rates. For large networks (>1000), there are enough errant picks that some of the ML methods start to create false events out of noise. We also find that the ML methods vary in computation time significantly but are all faster than the traditional method tested here.

58 GEOSCIENCES↗
DOE OSTI2014

Asymmetric dose–volume optimization with smoothness control for rotating-shield brachytherapy

Purpose: It is important to reduce fluence map complexity in rotating-shield brachytherapy (RSBT) inverse planning to improve delivery efficiency while maintaining plan quality. This study proposes an efficient and effective RSBT dose optimization method which enables to produce smooth fluence maps. Methods: Five cervical cancer patients each with a high-risk clinical-target-volume (HR-CTV) larger than 40 cm{sup 3} were considered as the test cases. The RSBT source was a partially shielded electronic brachytherapy source (Xoft Axxent™). The anchor RSBT plans generated by the asymmetric dose–volume optimization with smoothness control (ADOS) method were compared against those produced by the dose–surface optimization (DSO) method and inverse-planning with simulated annealing (IPSA). Either L{sub 1}-norm or L{sub 2}-norm was used to measure the smoothness of a fluence map in the proposed ADOS method as one weighted term of the objective function. Uniform dwell-time scaling was applied to all plans such that HR-CTV D{sub 90} was maximized without violating the D{sub 2cc} tolerances of the rectum, bladder, and sigmoid colon. The quality of the anchor plans was measured with HR-CTV D{sub 90} of the anchor plans. Single-shielded RSBT [(S-RSBT), RSBT with single, fix sized delivery window] and dynamic-sheilded RSBT [(D-RSBT), RSBT with dynamically varying sized delivery window] delivery plans generated based on the anchor plans were also measured, with delivery time constraints of 10, 20, and 30 min/fraction (fx). Results: The average HR-CTV D{sub 90} values of the anchor plans achieved by the ADOS, DSO, and IPSA methods were 111.5, 94.2, and 107.4 Gy, respectively, where the weighting parameter β used in ADOS with L{sub 2}-norm was set to be 100. By using S-RSBT sequencing and 20 min/fx delivery time, the corresponding D{sub 90} values were 88.8, 81.9, and 83.4 Gy; while using D-RSBT sequencing with 20 min/fx delivery time, the corresponding D{sub 90} values were 91.4, 88.3, and 78.9 Gy, respectively. The average optimization times for ADOS, DSO, and IPSA were, respectively, 77, 4, and 1800 s. By using L{sub 1}-norm instead of L{sub 2}-norm in the ADOS method, the optimization time was increased by 20 s, while the D{sub 90} was reduced by 6.8 Gy on average. ADOS-L1 was found to be more sensitive to the weighting parameter than ADOS-L2. If β was increased to 10 000, the D{sub 90} drop with ADOS-L1 was 38 Gy, while the drop with ADOS-L2 is 13 Gy. Conclusions: The ADOS method had a reasonable optimization time cost, while achieving comparable RSBT dose plans as the IPSA method, which is of much higher time complexity. Compared to the DSO and IPSA methods, ADOS is able to generate anchor plans which are more suitable for RSBT delivery while preserving the high quality of the original plans. Compared to ADOS-L1, ADOS-L2 is able to achieve better quality of anchor plans more efficiently.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2018

Highly Efficient Compensation-Based Parallelism for Wavefront Loops on GPUs

Wavefront loops are widely used in many scientific applications, e.g., partial differential equation (PDE) solvers and sequence alignment tools. However, due to the data dependencies in wavefront loops, it is challenging to fully utilize the abundant compute units of GPUs and to reuse data through their memory hierarchy. Existing solutions can only optimize for these factors to a limited extent. For example, tiling-based methods optimize memory access but may result in load imbalance; while compensation-based methods, which change the original order of computation to expose more parallelism and then compensate for it, suffer from both global synchronization overhead and limited generality. In this paper, we first prove under which circumstances that breaking data dependencies and properly changing the sequence of computation operators in our compensation-based method does not affect the correctness of results. Based on this analysis, we design a highly efficient compensation-based parallelism on GPUs. Our method provides weighted scan-based GPU kernels to optimize the computation and combines with the tiling method to optimize memory access and synchronization. The performance results on the NVIDIA K80 and P100 GPU platforms demonstrate that our method can achieve significant improvements for four types of real-world application kernels over the state-of-the-art research.

Hou, Kaixi↗
DOE OSTI2024

Stochastic Optimization to Find Optimum Beginning-of-Life Core Configuration of Stable Salt Reactor with Online Refueling

A stochastic optimization method has been developed to find an optimum equilibrium cycle core configuration of the waste-burning stable salt reactor, which is a fast-spectrum molten salt reactor with frequent online refueling. An optimum core configuration was determined with the goal of minimizing radial power peaking. Because of the vast number of potential candidate core configurations, stochastic optimization was applied based on simulated annealing and an additional acceleration method, which screened out unpromising core configurations. It has been demonstrated that the developed stochastic optimization method successfully finds the optimal core configuration regardless of the initial guess and outperforms the gradient descent approach. In addition, it has been observed that the use of a so-called out-in core configuration as the initial guess speeds up convergence of the iterative solution more than five times. Based on the searched optimum equilibrium cycle core configuration, new beginning-of-life (BOL) core configurations have been developed. In conclusion, the new BOL core configurations will be used in developing optimum refueling strategies.

Moltex static salt reactor↗
DOE OSTI2017

An improved hyperbolic embedding algorithm

Because hyperbolic space has properties that make it amenable to graph representations, there is significant interest in scalable hyperbolic-space embedding methods. These embeddings enable constant-time approximation of shortest-path distances, and so are significantly more efficient than full shortest-path computations. In this article, we improve on existing landmark-based hyperbolic embedding algorithms for large-scale graphs. Whereas previous methods compute the embedding by using the derivative-free Nelder–Mead simplex optimization method, our approach uses the limited-memory BFGS (LBFGS) method, which is quasi-Newton optimization, with analytic gradients. Our method is not only significantly faster but also produces higher-quality embeddings. Moreover, we are able to include the hyperbolic curvature as a variable in the optimization. We compare our hyperbolic embedding method implementation in Python (called Hypy) against the best publicly available software, Rigel. Our method is an order of magnitude faster and shows significant improvements in the accuracy of the shortest-path distance calculations. Furthermore, tests are performed on a variety of real-world networks, and we show the scalability of our method by embedding a graph with 1.8 billion edges and 65 million nodes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Optimization approaches to volumetric modulated arc therapy planning

Volumetric modulated arc therapy (VMAT) has found widespread clinical application in recent years. A large number of treatment planning studies have evaluated the potential for VMAT for different disease sites based on the currently available commercial implementations of VMAT planning. In contrast, literature on the underlying mathematical optimization methods used in treatment planning is scarce. VMAT planning represents a challenging large scale optimization problem. In contrast to fluence map optimization in intensity-modulated radiotherapy planning for static beams, VMAT planning represents a nonconvex optimization problem. In this paper, the authors review the state-of-the-art in VMAT planning from an algorithmic perspective. Different approaches to VMAT optimization, including arc sequencing methods, extensions of direct aperture optimization, and direct optimization of leaf trajectories are reviewed. Their advantages and limitations are outlined and recommendations for improvements are discussed.

07 ISOTOPE AND RADIATION SOURCES↗
DOE OSTI2021

Optimal design of acoustic metamaterial cloaks under uncertainty

In this work, we consider the problem of optimal design of an acoustic cloak under uncertainty and develop scalable approximation and optimization methods to solve this problem. The design variable is taken as an infinite-dimensional spatially-varying field that represents the material property, while an additive infinite-dimensional random field represents the variability of the material property or the manufacturing error. Discretization of this optimal design problem results in high-dimensional design variables and uncertain parameters. To solve this problem, we develop a computational approach based on a Taylor approximation and an approximate Newton method for optimization, which is based on a Hessian derived at the mean of the random field. We show our approach is scalable with respect to the dimension of both the design variables and uncertain parameters, in the sense that the necessary number of acoustic wave propagations is essentially independent of these dimensions, for numerical experiments with up to one million design variables and half a million uncertain parameters. Additionally, we demonstrate that, using our computational approach, an optimal design of the acoustic cloak that is robust to material uncertainty is achieved in a tractable manner. The optimal design under uncertainty problem is posed and solved for the classical circular obstacle surrounded by a ring-shaped cloaking region, subjected to both a single-direction single-frequency incident wave and multiple-direction multiple-frequency incident waves. Finally, we apply the method to a deterministic large-scale optimal cloaking problem with complex geometry, to demonstrate that the approximate Newton method’s Hessian computation is viable for large, complex problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Optimal Power Flow of Radial Networks and Its Variations: A Sequential Convex Optimization Approach

This paper proposes a sequential convex optimization method to solve broader classes of optimal power flow (OPF) problems over radial networks. The non-convex branch power flow equation is decomposed as a second-order cone inequality and a non-convex constraint involving the difference of two convex functions. Provided with an initial solution offered by an inexact second-order cone programming relaxation model, this approach solves a sequence of convexified penalization problems, where concave terms are approximated by linear functions and updated in each iteration. It could recover a feasible power flow solution, which usually appears to be very close, if not equal, to the global optimal one. Two variations of the OPF problem, in which non-cost related objectives are optimized subject to power flow constraints and the convex relaxation is generally inexact, are elaborated in detail. One is the maximum loadability problem, which is formulated as a special OPF problem that seeks the maximal distance to the boundary of power flow insolvability. The proposed method is shown to outperform commercial nonlinear solvers in terms of robustness and efficiency. The other is the bi-objective OPF problem. A non-parametric scalarization model is suggested, and is further reformulated as an extended OPF problem by convexifying the objective function. It provides a single trade-off solution without any subjective preference. The proposed computation framework also helps retrieve the Pareto front of the bi-objective OPF via the e-constraint method or the normal boundary intersection method. This paper also discusses extensions for OPF problems over meshed networks based on the semidefinite programming relaxation method.

bi-objective optimization↗
DOE OSTI2016

Computationally efficient characterization of potential energy surfaces based on fingerprint distances

An analysis of the network defined by the potential energy minima of multi-atomic systems and their connectivity via reaction pathways that go through transition states allows us to understand important characteristics like thermodynamic, dynamic, and structural properties. Unfortunately computing the transition states and reaction pathways in addition to the significant energetically low-lying local minima is a computationally demanding task. We here introduce a computationally efficient method that is based on a combination of the minima hopping global optimization method and the insight that uphill barriers tend to increase with increasing structural distances of the educt and product states. This method allows us to replace the exact connectivity information and transition state energies with alternative and approximate concepts. Without adding any significant additional cost to the minima hopping global optimization approach, this method allows us to generate an approximate network of the minima, their connectivity, and a rough measure for the energy needed for their interconversion. This can be used to obtain a first qualitative idea on important physical and chemical properties by means of a disconnectivity graph analysis. Besides the physical insight obtained by such an analysis, the gained knowledge can be used to make a decision if it is worthwhile or not to invest computational resources for an exact computation of the transition states and the reaction pathways. Furthermore it is demonstrated that the here presented method can be used for finding physically reasonable interconversion pathways that are promising input pathways for methods like transition path sampling or discrete path sampling.

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

Online Optimization for Networked Distributed Energy Resources With Time-Coupling Constraints

This paper proposes a Lyapunov optimization-based online distributed (LOOD) algorithmic framework for active distribution networks (ADNs) with numerous photovoltaic inverters and inverter air conditionings (IACs). In the proposed scheme, ADNs can track an active power setpoint reference at the substation in response to transmission-level requests while concurrently minimizing the social utility loss and ensuring the security of voltages. Conventional distributed optimization methods are rarely feasible to track the optimal solutions in fast variable environments using a fine-grained sampling interval where the underlying optimization problem evolves with the iterations of the algorithms. In contrast, based on the framework of online convex optimization (OCO), the developed approach uses a distributed algebraic update to compute the next round decisions relying on the current feedback of measurements. Notably, the time-coupling constraints of IACs are decoupled for online implementation with Lyapunov optimization technique. An incentive scheme is tailored to coordinate the customer-owned assets in lieu of the direct control from network operators. Optimality and convergency are characterized analytically. Finally, we corroborate the proposed method on a modified version of 33-node test feeder. Benchmark tests show that the proposed method is computationally and economically efficient, and outperforming existing algorithms.

active distribution networks↗
DOE OSTI2020

Parallel-in-Time Simulation of Lindblad's Equation

Constructing fast quantum logic gates is critical to building a scalable quantum computer. We consider a qudit, a quantum version of a bit that can take an arbitrary number of states, coupled with a cavity. In this project, we wish to force the qudit to reach the 0-state, for any possible initial state. The coupled system changes in time according to Lindblad’s equation, an ordinary differential equation on the density matrix of the quantum system. Lindblad’s equation contains some parameters that we can control, so-called control functions. We seek control functions which force the qudit to the 0-state within 2 microseconds, which is much faster than what is currently done in practice. The search method is gradient descent, a numerical optimization method that uses gradient information to iteratively improve the control parameters. My contribution to this project is an attempt to speed up the computation of the gradient. It currently takes about 40 seconds to compute the gradient which involves solving a set of ODEs sequentially. Current supercomputers have thousands of cores, but sequential computations can only make use of 1 core at a time. We wish to divide up the work better, so that we can use many more cores at once. To this end, we have implemented the Multigrid Reduction in Time (MGRIT) algorithm. We perform a systematic parameter search on how to best apply this algorithm. Results indicate a 25 percent speed up for solving Lindblad’s equation and determining how close the final state is the 0-state.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Journey Over Destination: Differentiable Sensor Placement Enhances Generalization [Poster]

The challenge of reconstructing spatial fields that change over time from limited sensor data has been a focal point for many research studies. Various machine learning methods have been used in attempts to address this complex issue, including convolutional neural networks. All of the proposed methods share a common requirement that the user needs to manually determine the sensor positions. This requirement remains a limiting factor in the ongoing quest for efficient learning and accurate field reconstruction. This study aims to present a method that enables a model to optimize sensor positions via backpropagation, thereby facilitating the model’s exploration of the spatial domain and enhancing sensor positioning effectively. Indexing naturally incorporates discrete decisions. This operation is nondifferentiable which is a requirement for the application of gradient-based optimization methods. We showcased its effectiveness by training an attention-based neural network, which achieved top-tier performance on two separate datasets. To our knowledge, this represents the first fully end-to-end differentiable workflow for enhancing sensor placement within a neural network model.

58 GEOSCIENCES↗
DOE OSTI2017

Optimal Operation and Dispatch of Voltage Regulation Devices Considering High Penetrations of Distributed Photovoltaic Generation

Voltage regulation devices have been traditionally installed and utilized to support distribution voltages. Installations of distributed energy resources (DERs) in distribution systems are rapidly increasing, and many of these generation resources have variable and uncertain power output. These generators can significantly change the voltage profile for a feeder; therefore, in the distribution system planning stage of the optimal operation and dispatch of voltage regulation devices, possible high penetrations of DERs should be considered. In this paper, we model the IEEE 34-bus test feeder, including all essential equipment. An optimization method is adopted to determine the optimal siting and operation of the voltage regulation devices in the presence of distributed solar power generation. Finally, we verify the optimal configuration of the entire system through the optimization and simulation results.

14 SOLAR ENERGY↗
DOE OSTI2021

Estimating the Adequacy of a Multi-Objective Optimization

Multi-objective optimization methods can be criticized for lacking a statistically valid measure of the quality and representativeness of a solution. This stance is especially relevant to metaheuristic optimization approaches but can also apply to other methods that typically might only report a small representative subset of a Pareto frontier. Here we present a method to address this deficiency based on random sampling of a solution space to determine, with a specified level of confidence, the fraction of the solution space that is surpassed by an optimization. The Superiority of Multi-Objective Optimization to Random Sampling, or SMORS method, can evaluate quality and representativeness using dominance or other measures, e.g., a spacing measure for high-dimensional spaces. SMORS has been tested in a combinatorial optimization context using a genetic algorithm but could be useful for other optimization methods.

42 ENGINEERING↗