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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS2018

Application of a Knowledge-Based Optimization Method for Aerodynamic Design

The current research is investigating the application of an optimization technique to an existing knowledge-based design tool. The optimization method, referred to as CODISC, helps improve the results from a knowledge-based design by eliminating the required advanced design knowledge, or help fine-tune a well-performing vehicle. Three CODISC designs are presented using a generic transonic transport, the Common Research Model (CRM). One design optimizes the baseline CRM to demonstrate the ability to improve a well-performing vehicle. Another design is performed from the CRM with camber and twist removed, which highlights the ability to use CODISC in the conceptual design phase. The final design implements laminar flow on the CRM, showing how CODISC can optimize the extent of laminar flow to find the best aerodynamic performance. All three CODISC designs reduced the vehicle drag compared to the baseline CRM, and highlight the new optimization technique’s versatility in the aircraft design industry.

CODISC↗
DOE OSTI2022

Comparison of multiobjective optimization methods for the $\mathrm{LCLS-II}$ photoinjector

Particle accelerators are among some of the largest science experiments in the world and can consist of thousands of components with a wide variety of input ranges. These systems can easily become unwieldy optimization problems during design and operations studies. Starting in the early 2000s, searching for better beam dynamics configurations became synonymous with heuristic optimization methods in the accelerator physics community. Genetic algorithms and particle swarm optimization are currently the most widely used. These algorithms can take thousands of simulation evaluations to find optimal solutions for one machine prototype. For large facilities such as the Linac Coherent Light Source (LCLS) and others, this equates to a limited exploration of many possible design configurations. In this paper, the LCLS-II photoinjector is optimized with three optimization algorithms. All optimizations were started from both a uniform random and Latin hypercube sample. In all cases, the optimizations started from Latin hypercube samples outperformed optimizations started from uniform samples. All three algorithms were able to optimize the photoinjector, with the model-based methods approximating the Pareto front in fewer simulation evaluations. This work, in combination with previous optimization observations, indicates objective penalties have a strong impact on the efficiency of such methods. In general, we recommend heuristic methods for initial optimizations and model-based methods when information about the objective space is available.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

Decentralized Voltage optimization Method for Distribution Networks with Distributed PVs

In order to solve the voltage violations caused by high penetration distributed photovoltaics (PVs), this paper proposes a decentralized voltage optimization method for distribution networks. Through the optimal dispatch of distributed PVs and reactive power resources, it realizes the voltage security and economic operation of distribution systems and facilitates the integration of massive distributed PVs. The proposed method is inspired by the idea of locational marginal price (LMP) and feasible cutting plane. It separates the optimization of boundary bus voltage and power flow in adjacent regions and uses the interaction of boundary variables’ marginal prices to obtain the optimal solution. The effectiveness and accuracy of the proposed method are demonstrated via simulation test on a practical l0kV feeder in China.

Xue, Yaosuo↗
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 OSTI2014

Poster — Thur Eve — 69: Computational Study of DVH-guided Cancer Treatment Planning Optimization Methods

Purpose: To compare methods to incorporate the Dose Volume Histogram (DVH) curves into the treatment planning optimization. Method: The performance of three methods, namely, the conventional Mixed Integer Programming (MIP) model, a convex moment-based constrained optimization approach, and an unconstrained convex moment-based penalty approach, is compared using anonymized data of a prostate cancer patient. Three plans we generated using the corresponding optimization models. Four Organs at Risk (OARs) and one Tumor were involved in the treatment planning. The OARs and Tumor were discretized into total of 50,221 voxels. The number of beamlets was 943. We used commercially available optimization software Gurobi and Matlab to solve the models. Plan comparison was done by recording the model runtime followed by visual inspection of the resulting dose volume histograms. Conclusion: We demonstrate the effectiveness of the moment-based approaches to replicate the set of prescribed DVH curves. The unconstrained convex moment-based penalty approach is concluded to have the greatest potential to reduce the computational effort and holds a promise of substantial computational speed up.

60 APPLIED LIFE SCIENCES↗
NASA NTRS1992

Survey - Applications of structural optimization methods to fixed wing aircraft and spacecraft

Results of a technical survey of the practical applications of structural optimization methods in the U.S. aerospace industry through 1980s are summarized. One of the most important developments in the 80s is the more widespread acceptance of structural optimization as one of the design tools that support practical structural design. Another significant advance is the development of large software tools for production applications. Attention is also given to the tailoring of the computerized design process to the specific environment of each company. The two most important aspects of this tailoring are seamless and easy-to-use incorporation of structural optimization in the overall aerospace design/production process and multidisciplinary integration aimed at ultimate performance optimization of the final product. Some specific applications discussed include the X-29 forward swept wing demonstrator aircraft, composite wing and vertical tail program, fighter wing redesign evaluations, high speed aircraft design, and space structures.

Miura, Hirokazu↗
DOE OSTI2016

SU-G-BRC-01: A Data-Driven Pre-Optimization Method for Prediction of Achievability of Clinical Objectives in IMRT

Purpose: We propose a novel data-driven method to predict the achievability of clinical objectives upfront before invoking the IMRT optimization. Methods: A new metric called “Geometric Complexity (GC)” is used to estimate the achievability of clinical objectives. Here, GC is the measure of the number of “unmodulated” beamlets or rays that intersect the Region-of-interest (ROI) and the target volume. We first compute the geometric complexity ratio (GCratio) between the GC of a ROI (say, parotid) in a reference plan and the GC of the same ROI in a given plan. The GCratio of a ROI indicates the relative geometric complexity of the ROI as compared to the same ROI in the reference plan. Hence GCratio can be used to predict if a defined clinical objective associated with the ROI can be met by the optimizer for a given case. Basically a higher GCratio indicates a lesser likelihood for the optimizer to achieve the clinical objective defined for a given ROI. Similarly, a lower GCratio indicates a higher likelihood for the optimizer to achieve the clinical objective defined for the given ROI. We have evaluated the proposed method on four Head and Neck cases using Pinnacle3 (version 9.10.0) Treatment Planning System (TPS). Results: Out of the total of 28 clinical objectives from four head and neck cases included in the study, 25 were in agreement with the prediction, which implies an agreement of about 85% between predicted and obtained results. The Pearson correlation test shows a positive correlation between predicted and obtained results (Correlation = 0.82, r2 = 0.64, p < 0.005). Conclusion: The study demonstrates the feasibility of the proposed method in head and neck cases for predicting the achievability of clinical objectives with reasonable accuracy.

60 APPLIED LIFE SCIENCES↗
NASA NTRS1980

Application of an advanced trajectory optimization method to ramjet propelled missiles

The mission performance characteristics of ramjet-propelled missiles are highly dependent upon the trajectory flown. Integration of the trajectory profile with the ramjet propulsion system performance characteristics to achieve optimal missile performance is very complex. Past trajectory optimization methods have been extremely problem dependent and require a high degree of familiarity to achieve success. A general computer code (CTOP) has been applied to ramjet-powered missiles to compute open-loop optimal trajectories. CTOP employs Chebyshev polynomial representations of the states and controls. This allows a transformation of the continuous optimal control problem to one of parameter optimization. With this method, the trajectory boundary conditions are always satisfied. State dynamics and path constraints are enforced via penalty functions. The presented results include solutions to minimum fuel-to-climb, minimum time-to-climb, and minimum time-to-target intercept problems.

Paris, S. W.↗
DOE OSTI2019

Nonlinear Optimization Methods for Large-Scale Learning

Future advances in large-scale machine learning depend heavily on the availability of new and more powerful nonlinear optimization methods. The goal of this project is to address this challenge by designing new optimization algorithms that can deal with the scale, nonlinearity and stochasticity arising in machine learning models. Our research will provide the theoretical foundations for the new methods, and will involve intensive numerical testing on state-of-the-art machine learning systems. The project is organized into three interrelated projects that constitute a broad research agenda in the area of large-scale stochastic optimization for data science.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Do optimization methods in deep learning applications matter?

With advances in deep learning, exponential data growth and increasing model complexity, developing efficient optimization methods are attracting much research attention. Several implementations favor the use of Conjugate Gradient (CG) and Stochastic Gradient Descent (SGD) as being practical and elegant solutions to achieve quick convergence, however, these optimization processes also present many limitations in learning across deep learning applications. Recent research is exploring higher-order optimization functions as better approaches, but these present very complex computational challenges for practical use. Comparing first and higher-order optimization functions, in this paper, our experiments reveal that Levemberg-Marquardt (LM) significantly supersedes optimal convergence but suffers from very large processing time increasing the training complexity of both, classification and reinforcement learning problems. Our experiments compare off-the-shelf optimization functions(CG, SGD, LM and L-BFGS) in standard CIFAR, MNIST, CartPole and FlappyBird experiments.The paper presents arguments on which optimization functions to use and further, which functions would benefit from parallelization efforts to improve pretraining time and learning rate convergence.

Ozyildirim, Buse Melis↗
NASA NTRS1984

Structural optimization using optimality criteria methods

Optimality criteria methods take advantage of some concepts as those of statically determinate or indeterminate structures, and certain variational principles of structural dynamics, to develop efficient algorithms for the sizing of structures that are subjected to stiffness-related constraints. Some of the methods and iterative strategies developed over the last decade for calculations of the Lagrange multipliers in stressand displacement-limited problems, as well as for satisfying the appropriate optimality criterion, are discussed. The application of these methods are illustrated by solving problems with stress and displacement constraints.

Khot, N. S.↗
DOE OSTI2016

Using a derivative-free optimization method for multiple solutions of inverse transport problems

Identifying unknown components of an object that emits radiation is an important problem for national and global security. Radiation signatures measured from an object of interest can be used to infer object parameter values that are not known. This problem is called an inverse transport problem. An inverse transport problem may have multiple solutions and the most widely used approach for its solution is an iterative optimization method. This paper proposes a stochastic derivative-free global optimization algorithm to find multiple solutions of inverse transport problems. The algorithm is an extension of a multilevel single linkage (MLSL) method where a mesh adaptive direct search (MADS) algorithm is incorporated into the local phase. Furthermore, numerical test cases using uncollided fluxes of discrete gamma-ray lines are presented to show the performance of this new algorithm.

42 ENGINEERING↗
DOE OSTI2023

Yet another parameter-free shape optimization method

The use of node coordinates as design variables in shape optimization offers a larger design space than computer-aided design (CAD)-based shape parameterizations. It also allows for the optimization of legacy designs, i.e., a finite element mesh from an existing design can be readily optimized to meet new performance requirements without involving a CAD model. However, it is well known that the node coordinate parameterization method is fraught with numerical difficulties, which makes it impractical to use. This has led to several of “parameter-free” shape optimization methods that seek the advantages and avoid the pitfalls of the naïve node coordinate parameterization method. These methods come in two main varieties: sensitivity filtering (or gradient smoothing) and consistent filtering. The latter is analogous to the density filter method used in topology optimization (TO). In this work, we use the PDE filter from TO and energy-based filters to implement consistent shape optimization filtering schemes easily and efficiently. Numerical experiments demonstrate that consistent methods are more robust than sensitivity filtering methods.

42 ENGINEERING↗
DOE OSTI2026

A Hierarchical Optimization Method for Electric Vertical Takeoff and Landing Aircraft Network Design

Electric vertical takeoff and landing aircraft (eVTOLs) are expected to serve urban air mobility in a station-to-station configuration, which makes the optimal network design of eVTOL stations a critical question to explore. Existing approaches often face limitations, such as the inability to interact station locations with demand or difficulty in finding the optimal solution for large study regions. Here, this paper first proposes a mathematical model to generate optimal eVTOL station locations while considering associated potential eVTOL demand, and then proposes a heuristic algorithm, Hierarchical Optimization MEthod (HOME), to efficiently solve the model. With a case study of Southern California, HOME was compared to 1) directly solving the original integer linear programming-based network design problem, and 2) employing the widely used genetic algorithm. Results suggest that HOME can find optimal solutions with limited computational resources. The proposed framework powered by HOME provides a computationally efficient way to support urban air mobility planning.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1995

Optimization methods, flux conserving methods for steady state Navier-Stokes equation

Navier-Stokes equation as discretized by new flux conserving method proposed by Chang and Scott results in the system: vector F(vector x) = 0, where F is a vector valued function. The Optimization method we use is based on Quasi-Newton methods: given a nonlinear function vector F(vector x) = 0, we solve, Delta(vector x) = -BF(vector x), where Delta(vector x) is the correction term and B is the inverse Jacobian of F(x). Then, iteratively, vector(x(sub (i+1))) = vector(x (sub i)) + alpha.Delta(vector x(sub i)), where alpha is a line search correction term determined by a line search routine. We use the BFCG's update the Jacobian matrix B(sub k) at each iteration. It is well known that B(sub k) approaches B(*) at the solution X(*). This algorithm has several advantages over the Newton-Raphson method. For example, we do not need to calculate the Jacobian matrix at each iteration which is computationally very expensive.

Adeyeye, John↗
NASA NTRS1988

Active cooling design for scramjet engines using optimization methods

A methodology for using optimization in designing metallic cooling jackets for scramjet engines is presented. The optimal design minimizes the required coolant flow rate subject to temperature, mechanical-stress, and thermal-fatigue-life constraints on the cooling-jacket panels, and Mach-number and pressure contraints on the coolant exiting the panel. The analytical basis for the methodology is presented, and results for the optimal design of panels are shown to demonstrate its utility.

Scotti, Stephen J.↗
NASA NTRS1988

Active cooling design for scramjet engines using optimization methods

A methodology for using optimization in designing metallic cooling jackets for scramjet engines is presented. The optimal design minimizes the required coolant flow rate subject to temperature, mechanical-stress, and thermal-fatigue-life constraints on the cooling-jacket panels, and Mach-number and pressure constraints on the coolant exiting the panel. The analytical basis for the methodology is presented, and results for the optimal design of panels are shown to demonstrate its utility.

Scotti, Stephen J.↗