Search NASA⌕ Search

SEARCH · Search NASA

Results for “gradient based 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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Gradient-Based Optimization of the Common Research Model Wing Subject to CFD-Based Gust and Flutter Constraints

The linearized frequency-domain method was recently implemented in the stabilized finite element solver in NASA’s FUN3D code. Previous work by the authors used this method for enforcing flutter constraints during gradient-based optimizations. More recently, the solver was expanded to account for continuous (also known as stochastic) gust responses. This paper expands on recent Common Research Model wing optimization work, which demonstrated gradient-based optimization with flutter and stochastic gust constraints, among others. While that work utilized FUN3D for static aeroelastic solutions but relied on doublet lattice aerodynamics for gust and flutter responses, the present work replaces these unsteady aerodynamic analyses with those of FUN3D’s linearized frequency-domain solver. With analytic derivatives available, gradient-based optimization is performed through the use of the OpenMDAO/MPhys libraries with over 700 shape, structural, and aerodynamic design variables and over 10 nonlinear constraints. Comparisons of analysis results and optimized designs are made between doublet lattice and linearized frequency-domain solutions.

aeroelasticity↗
NASA NTRSDate not supplied

Gradient Based Optimization of Chaotic Panel Flutter

This work considers the gradient-based optimization of an aeroelastic panel structure undergoing chaotic vibrations. A previously-presented adaptive time-marching scheme is used to stabilize the design sensitivities which would normally grow unbounded in time, owing to intermittent unstable eigenvalues of the Jacobian. The design optimization entails forcing the root mean square (RMS) of the panel vibration to some specified value, in a way that minimizes the deviation of the structural thickness variables from their uniform baseline values. Depending on the location of the RMS constraint, the output physics maybe chaotic, limit cycle oscillations, or statically buckled.

Bret Kennedy Stanford↗
NASA NTRSDate not supplied

Fast Aircraft Separation Calculations for Gradient Based Optimization of Airspace Simulations

Simulations of airspace operational concepts can play a significant role in determining future paradigms that would allow for a safe increase in airspace density. In particular, airspace simulations which are capable of handling large numbers of aircraft act as an enabling capability for the testing of proposed airspace operational concepts. Simulations allowing for gradient based optimization methods are particularly attractive, since they would potentially allow for an efficient and empirical means to derive best operational practices. These could also allow for vehicle multidisciplinary design and optimization studies to include air traffic management considerations as a discipline. But any large scale simulation of airspace operations must include some methodology for addressing airspace separation requirements, which in the most direct sense would be tracked in a manner that computationally grows as a quadratic function of the number of simulated aircraft. Efficient indirect methods have been developed in certain contexts to address this limitation. However, any means of addressing separation requirements in a gradient based optimization context should be implemented by functions which provide analytic derivative information to maximize numerical precision and computational efficiency. In this paper, a fast and differentiable separation metric is described in application to gradient based optimization of airspace operations. Rather than computing the separation distance between every pair of aircraft in a simulation, this method effectively reduces the problem to a smaller relevant set using a geometric decomposition. This method guarantees that the smallest distance at all points in simulated time is determined exactly. When used in an optimization constraint context, this guarantees that a minimum separation is maintained between all pairs of aircraft. The presented metric has logarithmic computational growth with respect to the number of simulated aircraft, and is shown to perform well in a series of notional 2D airspace optimization problems when used to enforce specified airborne separation constraints. Results show that this is notably faster than a direct pairwise distance computing metric for optimizations involving both small and large numbers of aircraft, yet enforce separation requirements to the same tolerance. It is shown that this favorable scalability is an enabling capability for more sophisticated air traffic management conceptual studies.

Optimization↗
NASA NTRSDate not supplied

Towards Low-Noise Design of a Proprotor with the Vortex Lattice Method and Gradient-Based Optimization

This work aims to combine an aerodynamic model based on the unsteady vortex lattice method with an acoustic model provided by Farassat's formulation 1A to perform gradient-based optimizations of a proprotor with aerodynamic and acoustic constraints. The resulting combination of tools is applied to the problem of designing a single proprotor operating at a cruise condition, with and without an acoustic constraint and wing placed downstream of the proprotor rotation plane. Results are compared to a baseline design studied previously, and to similar optimizations performed with a simpler blade element momentum theory aerodynamic model. Each optimization case achieved feasibility and made significant improvements in the objective function, but the optimality criterion was not satisfied. Overall the designs the optimizer found roughly comported with our previous experience with similar problems, with some discrepancies that are discussed.

Aerodynamics↗
NASA NTRSDate not supplied

Towards Low-Noise Design of a Proprotor with the Vortex Lattice Method and Gradient-Based Optimization

This work aims to combine an aerodynamic model based on the unsteady vortex lattice method with an acoustic model provided by Farassat's formulation 1A to perform gradient-based optimizations of a proprotor with aerodynamic and acoustic constraints. The resulting combination of tools is applied to the problem of designing a single proprotor operating at a cruise condition, with and without an acoustic constraint and wing placed downstream of the proprotor rotation plane. Results are compared to a baseline design studied previously, and to similar optimizations performed with a simpler blade element momentum theory aerodynamic model. Each optimization case achieved feasibility and made significant improvements in the objective function, but the optimality criterion was not satisfied. Overall the designs the optimizer found roughly comported with our previous experience with similar problems, with some discrepancies that are discussed.

Aerodynamics↗
NASA NTRS2019

Multipoint Variable Cycle Engine Design Using Gradient-based Optimization

Supersonic aircraft are challenging to optimally design due to the widely varying constraints and flight conditions they experience. Additionally, a large number of disciplinary subsystems must be considered due to highly complex design requirements. One subsystem that has a major effect on overall performance is the engine. In this work, we construct a supersonic mixed-flow variable cycle engine and perform multipoint gradient-based optimization using this model. We see that the operational variables allow the optimizer to tailor performance at each individual flight condition, leading to better overall performance. To simulate airframe integration constraints, we run successive optimizations with increasingly restrictive inlet areas and see decreases in engine performance. This work is part of a larger effort to incorporate engine design into aero-thermal-mission optimization of a supersonic aircraft.

Cycle analysis↗
NASA NTRSDate not supplied

Low-Noise Propeller Design with the Vortex Lattice Method and Gradient-Based Optimization

This work aims to combine an aerodynamic model based on the unsteady vortex lattice method with an acoustic model provided by Farassat’s formulation 1A to perform gradient-based propeller optimizations with aerodynamic and acoustic constraints. Two optimization cases are attempted and successfully converged: an isolated propeller and a propeller-wing configuration, both operating in a 0.11 Mach freestream, representative of a cruise condition. The results show that simultaneously decreasing the RPM and increasing the collective angle of a propeller is an effective noise reduction technique, as expected, and little difference is observed between the two cases. A vortex dissipation model was found to be needed to stabilize the derivatives of the vortex lattice outputs, and a constraint on the propeller blade’s chord distribution concavity was needed to produce realistic-looking blade chord distributions.

Propellers↗
NASA NTRS1999

Demonstration of Automatically-Generated Adjoint Code for Use in Aerodynamic Shape Optimization

Gradient-based optimization requires accurate derivatives of the objective function and constraints. These gradients may have previously been obtained by manual differentiation of analysis codes, symbolic manipulators, finite-difference approximations, or existing automatic differentiation (AD) tools such as ADIFOR (Automatic Differentiation in FORTRAN). Each of these methods has certain deficiencies, particularly when applied to complex, coupled analyses with many design variables. Recently, a new AD tool called ADJIFOR (Automatic Adjoint Generation in FORTRAN), based upon ADIFOR, was developed and demonstrated. Whereas ADIFOR implements forward-mode (direct) differentiation throughout an analysis program to obtain exact derivatives via the chain rule of calculus, ADJIFOR implements the reverse-mode counterpart of the chain rule to obtain exact adjoint form derivatives from FORTRAN code. Automatically-generated adjoint versions of the widely-used CFL3D computational fluid dynamics (CFD) code and an algebraic wing grid generation code were obtained with just a few hours processing time using the ADJIFOR tool. The codes were verified for accuracy and were shown to compute the exact gradient of the wing lift-to-drag ratio, with respect to any number of shape parameters, in about the time required for 7 to 20 function evaluations. The codes have now been executed on various computers with typical memory and disk space for problems with up to 129 x 65 x 33 grid points, and for hundreds to thousands of independent variables. These adjoint codes are now used in a gradient-based aerodynamic shape optimization problem for a swept, tapered wing. For each design iteration, the optimization package constructs an approximate, linear optimization problem, based upon the current objective function, constraints, and gradient values. The optimizer subroutines are called within a design loop employing the approximate linear problem until an optimum shape is found, the design loop limit is reached, or no further design improvement is possible due to active design variable bounds and/or constraints. The resulting shape parameters are then used by the grid generation code to define a new wing surface and computational grid. The lift-to-drag ratio and its gradient are computed for the new design by the automatically-generated adjoint codes. Several optimization iterations may be required to find an optimum wing shape. Results from two sample cases will be discussed. The reader should note that this work primarily represents a demonstration of use of automatically- generated adjoint code within an aerodynamic shape optimization. As such, little significance is placed upon the actual optimization results, relative to the method for obtaining the results.

Green, Lawrence↗
NASA NTRS2018

Solution of Ordinary Differential Equations in Gradient-Based Multidisciplinary Design Optimization

A gradient-based approach to multidisciplinary design optimization enables efficient scalability to large numbers of design variables. However, the need for derivatives causes difficulties when integrating ordinary differential equations (ODEs) in models. To simplify this, we propose the use of the general linear methods framework, which unifies all Runge-Kutta and linear multistep methods. This approach enables rapid implementation of integration methods without the need to differentiate each one, even in a gradient-based optimization context. We also develop a new parallel time integration algorithm that enables vectorization across time steps. We present a set of benchmarking results using a stiff ODE, a non-stiff nonlinear ODE, and an orbital dynamics ODE, and compare integration methods. In a modular gradient-based multidisciplinary design optimization context, we find that the new parallel time integration algorithm with high-order implicit methods, especially Gauss-Legendre collocation, is the best choice for a broad range of problems.

Hwang, John T.↗
NASA NTRS1994

Multidisciplinary design optimization using genetic algorithms

Multidisciplinary design optimization (MDO) is an important step in the conceptual design and evaluation of launch vehicles since it can have a significant impact on performance and life cycle cost. The objective is to search the system design space to determine values of design variables that optimize the performance characteristic subject to system constraints. Gradient-based optimization routines have been used extensively for aerospace design optimization. However, one limitation of gradient based optimizers is their need for gradient information. Therefore, design problems which include discrete variables can not be studied. Such problems are common in launch vehicle design. For example, the number of engines and material choices must be integer values or assume only a few discrete values. In this study, genetic algorithms are investigated as an approach to MDO problems involving discrete variables and discontinuous domains. Optimization by genetic algorithms (GA) uses a search procedure which is fundamentally different from those gradient based methods. Genetic algorithms seek to find good solutions in an efficient and timely manner rather than finding the best solution. GA are designed to mimic evolutionary selection. A population of candidate designs is evaluated at each iteration, and each individual's probability of reproduction (existence in the next generation) depends on its fitness value (related to the value of the objective function). Progress toward the optimum is achieved by the crossover and mutation operations. GA is attractive since it uses only objective function values in the search process, so gradient calculations are avoided. Hence, GA are able to deal with discrete variables. Studies report success in the use of GA for aircraft design optimization studies, trajectory analysis, space structure design and control systems design. In these studies reliable convergence was achieved, but the number of function evaluations was large compared with efficient gradient methods. Applicaiton of GA is underway for a cost optimization study for a launch-vehicle fuel-tank and structural design of a wing. The strengths and limitations of GA for launch vehicle design optimization is studied.

Unal, Resit↗
NASA NTRS2019

Gradient-Based Aeroservoelastic Optimization with Static Output Feedback

Static output feedback considers an optimal low-order feedback matrix which directly connects the sensors to the control inputs. This work demonstrates the numerical techniques needed to compute the analytical gradient of the optimal feedback matrix with respect to design variables, which may then be used for gradient-based optimization. The derivatives are demonstrated for aeroservoelastic optimization under a series of closed- loop gust load alleviation constraints, considering a continuous stochastic gust load applied to a transport vehicle configuration, among other design constraints such as utter and maneuver loads. The optimal trade-o s between passive load alleviation and active load alleviation for static output feedback are compared with those from full-state feedback, which may be considered an upper-bound for effective sensor-based control.

Stanford, Bret K.↗
NASA NTRS2019

Gradient-Based Propeller Optimization with Acoustic Constraints

Urban Air Mobility (UAM) vehicles are intended to operate near or within large cities, where a significant portion of the public will be exposed to the noise they create. If these vehicles are to become acceptable to the public, designers must be able to manage the amount of noise they generate, and understand the relationship between traditional performance metrics (thrust, efficiency, etc.) and noise. As a first step to addressing this need, this work combines a Blade Element Momentum Theory tool (OpenBEMT) with an acoustic prediction tool (ANOPP2) to optimize a propeller subject to both aerodynamic and acoustic constraints. These tools are developed within a optimization framework (OpenMDAO (Multidisciplinary Design Analysis Optimization)) that allows analytic derivatives to be propagated through the models and passed to a gradient-based optimizer. This tool chain is exercised on the cruise propellers from the X-57 Maxwell, and yields propeller designs that reduced the overall sound pressure level by about 8 decibels for a cost of 3 percent propeller efficiency.

Acoustics↗
NASA NTRS2019

Gradient-Based Propeller Optimization with Acoustic Constraints

Urban Air Mobility vehicles are intended to operate near or within large cities, where a significant portion of the public will be exposed to the noise they create. If these vehicles are to become acceptable to the public, designers must be able to manage the amount of noise they generate, and understand the relationship between traditional performance metrics (thrust, efficiency, etc.) and noise. As a first step to addressing this need, this work combines a blade element momentum theory tool (OpenBEMT) with an acoustic prediction tool (ANOPP2) to optimize a propeller subject to both aerodynamic and acoustic constraints. These tools are developed within a optimization framework (OpenMDAO) that allows analytic derivatives to be propagated through the models and passed to a gradient-based optimizer. This tool chain is exercised on the cruise propellers from the X-57 Maxwell, and yields propeller designs that reduced the overall sound pressure level by about 5 dB for a cost of 1% propeller efficiency.

Ingraham, Daniel↗
NASA NTRS1997

Efficient Gradient-Based Shape Optimization Methodology Using Inviscid/Viscous CFD

The formerly developed preconditioned-biconjugate-gradient (PBCG) solvers for the analysis and the sensitivity equations had resulted in very large error reductions per iteration; quadratic convergence was achieved whenever the solution entered the domain of attraction to the root. Its memory requirement was also lower as compared to a direct inversion solver. However, this memory requirement was high enough to preclude the realistic, high grid-density design of a practical 3D geometry. This limitation served as the impetus to the first-year activity (March 9, 1995 to March 8, 1996). Therefore, the major activity for this period was the development of the low-memory methodology for the discrete-sensitivity-based shape optimization. This was accomplished by solving all the resulting sets of equations using an alternating-direction-implicit (ADI) approach. The results indicated that shape optimization problems which required large numbers of grid points could be resolved with a gradient-based approach. Therefore, to better utilize the computational resources, it was recommended that a number of coarse grid cases, using the PBCG method, should initially be conducted to better define the optimization problem and the design space, and obtain an improved initial shape. Subsequently, a fine grid shape optimization, which necessitates using the ADI method, should be conducted to accurately obtain the final optimized shape. The other activity during this period was the interaction with the members of the Aerodynamic and Aeroacoustic Methods Branch of Langley Research Center during one stage of their investigation to develop an adjoint-variable sensitivity method using the viscous flow equations. This method had algorithmic similarities to the variational sensitivity methods and the control-theory approach. However, unlike the prior studies, it was considered for the three-dimensional, viscous flow equations. The major accomplishment in the second period of this project (March 9, 1996 to March 8, 1997) was the extension of the shape optimization methodology for the Thin-Layer Navier-Stokes equations. Both the Euler-based and the TLNS-based analyses compared with the analyses obtained using the CFL3D code. The sensitivities, again from both levels of the flow equations, also compared very well with the finite-differenced sensitivities. A fairly large set of shape optimization cases were conducted to study a number of issues previously not well understood. The testbed for these cases was the shaping of an arrow wing in Mach 2.4 flow. All the final shapes, obtained either from a coarse-grid-based or a fine-grid-based optimization, using either a Euler-based or a TLNS-based analysis, were all re-analyzed using a fine-grid, TLNS solution for their function evaluations. This allowed for a more fair comparison of their relative merits. From the aerodynamic performance standpoint, the fine-grid TLNS-based optimization produced the best shape, and the fine-grid Euler-based optimization produced the lowest cruise efficiency.

Baysal, Oktay↗
NASA NTRS2019

Using Graph Coloring to Compute Total Derivatives More Efficiently in OpenMDAO

When they are applicable, gradient based optimization algorithms are the most efficient way to solve design optimization problems. Although gradient based methods are generally efficient, they can be made significantly more so through the usage of analytic techniques to compute the necessary total derivatives. The traditional forward (direct) and reverse (adjoint) analytic techniques have computational costs that scale linearly with the number of design variables and the number of constraints, respectively. In this work, we present an application of a graph coloring algorithm to the analytic techniques for computing total derivative Jacobians in order to achieve much better computational scaling than the pure analytic methods can provide alone. A detailed theoretical explanation of how coloring algorithms interact with analytic derivative methods is presented that illustrates specific types of sparsity patterns that must be present in total derivative Jacobians in order for this coloring technique to be effective. The new technique has been implemented as a feature in the OpenMDAO framework and the implementation is demonstrated on two example problems. The performance on the example problems up to 50% reduction in compute cost for optimizations with bi-directional coloring compared to traditional constraint aggregation. Additionally, the results show how coloring technique alleviates some of the numerical difficulties that constraint aggregation can cause, leading to the ability to solve larger problems. It is expected that the new method will have wide applicability to multidisciplinary optimization problems, and that its availability in OpenMDAO will offer significant computational savings for users without the need for them to implement the coloring algorithm themselves.

Trajectory↗
NASA NTRSDate not supplied

Efficient Global Optimization with Gradient Finish for Design Under Uncertainty

The Efficient Global Optimization (EGO) algorithm is extended to include a gradient-descent-based finish upon reaching a threshold value of the expected improvement function. Emphasis is placed on efficient evaluation of local gradients using Kriging models during the gradient-based finish to enable application to design under uncertainty (DUU) problems. The modified algorithm is applied to both the well-known Rosenbrock function and a more challenging hypersonic inlet design under uncertainty problem. Results demonstrate improvement in locating the global optimum compared to the classical implementation of EGO, as well as a reduced number of true function evaluations compared to pure gradient-based algorithms. For the Rosenbrock function, a global optimum is returned using an average of 12% fewer function calls than a gradient-based optimizer with comparable tolerances. For the design under uncertainty problem, a global optimum is found using an average of 75% fewer function calls than a gradient-based optimizer. Global Pareto fronts of multiobjective DUU problems are obtained at little additional cost after a single optimization is complete.

Optimization↗