Search NASA⌕ Search

SEARCH · Search NASA

Results for “objective function”

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 127 records · Page 7

Least-squares/parabolized Navier-Stokes procedure for optimizing hypersonic wind tunnel nozzles

A new procedure is demonstrated for optimizing hypersonic wind-tunnel-nozzle contours. The procedure couples a CFD computer code to an optimization algorithm, and is applied to both conical and contoured hypersonic nozzles for the purpose of determining an optimal set of parameters to describe the surface geometry. A design-objective function is specified based on the deviation from the desired test-section flow-field conditions. The objective function is minimized by optimizing the parameters used to describe the nozzle contour based on the solution to a nonlinear least-squares problem. The effect of the changes in the nozzle wall parameters are evaluated by computing the nozzle flow using the parabolized Navier-Stokes equations. The advantage of the new procedure is that it directly takes into account the displacement effect of the boundary layer on the wall contour. The new procedure provides a method for optimizing hypersonic nozzles of high Mach numbers which have been designed by classical procedures, but are shown to produce poor flow quality due to the large boundary layers present in the test section. The procedure is demonstrated by finding the optimum design parameters for a Mach 10 conical nozzle and a Mach 6 and a Mach 15 contoured nozzle.

Korte, John J.↗

The Sizing and Optimization Language (SOL): A computer language to improve the user/optimizer interface

The nonlinear mathematical programming method (formal optimization) has had many applications in engineering design. A figure illustrates the use of optimization techniques in the design process. The design process begins with the design problem, such as the classic example of the two-bar truss designed for minimum weight as seen in the leftmost part of the figure. If formal optimization is to be applied, the design problem must be recast in the form of an optimization problem consisting of an objective function, design variables, and constraint function relations. The middle part of the figure shows the two-bar truss design posed as an optimization problem. The total truss weight is the objective function, the tube diameter and truss height are design variables, with stress and Euler buckling considered as constraint function relations. Lastly, the designer develops or obtains analysis software containing a mathematical model of the object being optimized, and then interfaces the analysis routine with existing optimization software such as CONMIN, ADS, or NPSOL. This final state of software development can be both tedious and error-prone. The Sizing and Optimization Language (SOL), a special-purpose computer language whose goal is to make the software implementation phase of optimum design easier and less error-prone, is presented.

Lucas, S. H.↗

Applications of fuzzy theories to multi-objective system optimization

Most of the computer aided design techniques developed so far deal with the optimization of a single objective function over the feasible design space. However, there often exist several engineering design problems which require a simultaneous consideration of several objective functions. This work presents several techniques of multiobjective optimization. In addition, a new formulation, based on fuzzy theories, is also introduced for the solution of multiobjective system optimization problems. The fuzzy formulation is useful in dealing with systems which are described imprecisely using fuzzy terms such as, 'sufficiently large', 'very strong', or 'satisfactory'. The proposed theory translates the imprecise linguistic statements and multiple objectives into equivalent crisp mathematical statements using fuzzy logic. The effectiveness of all the methodologies and theories presented is illustrated by formulating and solving two different engineering design problems. The first one involves the flight trajectory optimization and the main rotor design of helicopters. The second one is concerned with the integrated kinematic-dynamic synthesis of planar mechanisms. The use and effectiveness of nonlinear membership functions in fuzzy formulation is also demonstrated. The numerical results indicate that the fuzzy formulation could yield results which are qualitatively different from those provided by the crisp formulation. It is felt that the fuzzy formulation will handle real life design problems on a more rational basis.

Rao, S. S.↗

Derivative-free optimization of a rapid-cycling synchrotron

Here, we develop and solve a constrained optimization model to identify an integrable optics rapid-cycling synchrotron lattice design that performs well in several capacities. Our model encodes the design criteria into 78 linear and nonlinear constraints, as well as a single nonsmooth objective, where the objective and some constraints are defined from the output of Synergia, an accelerator simulator. We detail the difficulties of the 23-dimensional simulation-constrained decision space and establish that the space is nonempty. We use a derivative-free manifold sampling algorithm to account for structured nondifferentiability in the objective function. Our numerical results quantify the dependence of solutions on constraint parameters and the effect of the form of objective function.

43 PARTICLE ACCELERATORS↗

Mission analysis flow sequencing optimization

This investigation is an extension of a project dealing with the problem of optimal use of ground resources for future space missions. This problem was formulated as a linear programming problem using an indirect approach. Instead of minimizing the inventory level of needed ground resources, the overlapping periods during which the same types of resources are used by various flights are minimized. The model was built upon the assumption that during the time interval under consideration, the costs of various needed resources remain constant. Under other assumptions concerning costs of resources, the objective function, in general, assumes a non-linear form. In this study, one case where the form of the objective function turns out to be quadratic is considered. Also, disadvantages and limitations of the approach used are briefly discussed.

Scott, M.↗

Hybrid NN/SVM Computational System for Optimizing Designs

A computational method and system based on a hybrid of an artificial neural network (NN) and a support vector machine (SVM) (see figure) has been conceived as a means of maximizing or minimizing an objective function, optionally subject to one or more constraints. Such maximization or minimization could be performed, for example, to optimize solve a data-regression or data-classification problem or to optimize a design associated with a response function. A response function can be considered as a subset of a response surface, which is a surface in a vector space of design and performance parameters. A typical example of a design problem that the method and system can be used to solve is that of an airfoil, for which a response function could be the spatial distribution of pressure over the airfoil. In this example, the response surface would describe the pressure distribution as a function of the operating conditions and the geometric parameters of the airfoil. The use of NNs to analyze physical objects in order to optimize their responses under specified physical conditions is well known. NN analysis is suitable for multidimensional interpolation of data that lack structure and enables the representation and optimization of a succession of numerical solutions of increasing complexity or increasing fidelity to the real world. NN analysis is especially useful in helping to satisfy multiple design objectives. Feedforward NNs can be used to make estimates based on nonlinear mathematical models. One difficulty associated with use of a feedforward NN arises from the need for nonlinear optimization to determine connection weights among input, intermediate, and output variables. It can be very expensive to train an NN in cases in which it is necessary to model large amounts of information. Less widely known (in comparison with NNs) are support vector machines (SVMs), which were originally applied in statistical learning theory. In terms that are necessarily oversimplified to fit the scope of this article, an SVM can be characterized as an algorithm that (1) effects a nonlinear mapping of input vectors into a higher-dimensional feature space and (2) involves a dual formulation of governing equations and constraints. One advantageous feature of the SVM approach is that an objective function (which one seeks to minimize to obtain coefficients that define an SVM mathematical model) is convex, so that unlike in the cases of many NN models, any local minimum of an SVM model is also a global minimum.

Rai, Man Mohan↗

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↗

Development of Density Functional Tight-Binding Parameters Using Relative Energy Fitting and Particle Swarm Optimization

We provide a strategy to optimize density functional tight-binding (DFTB) parameterization for the calculation of the structures and properties of organic molecules consisting of hydrogen, carbon, nitrogen, and oxygen. We utilize an objective function based on similarity measurements and the Particle Swarm Optimization (PSO) method to find an optimal set of parameters. This objective function considers not only the common DFTB descriptors of binding energies and atomic forces but also incorporates relative energies of isomers into the fitting procedure for more chemistry-driven results. The quality in the description of the binding energies and atomic forces is measured based on the Ballester similarity index and relative energies through a similarity index induced by the Levenshtein edit distance to quantify the correct energetic order of isomers. Training and testing datasets were created to include all relevant chemical functional groups. Finally, the accuracy of this strategy is assessed, and its range of applicability is discussed by comparison against our previous parameterization. The improved performance of the new DFTB parameterization is validated with respect to the density functional theory large datasets QM-9 and ANI-1, where excellent agreement is found between the structures and properties available in these datasets, and the ones obtained with DFTB.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Reconfigurable Cellular Composite Structures for Lighter than Air Vehicles with Scalable Size and Endurance

Engineered non-stochastic cellular materials show promising characteristics on the laboratory scale,with nearly ideal specific stiffness and strength scaling at ultralight mass density. These propertiessuggest performance benefits in any application with combined stiffness and mass constraints, suchas air vehicles. We investigate here the application of re-configurable cellular composite materialsand structures to lighter than air vehicles. We describe the properties and applicability of these materials,provide an example analysis of governing loading conditions associated with airships, showan example optimization method for navigating the design space, and describe how recent advancesin cellular material manufacturing and reconfiguration enable system performance benefits includingnew concepts of operation. Lastly, we propose lighter than air vehicles that are assembled andmaintained in-flight, eliminating structural compromises associated with transitional flight modesand ground handling.Engineered non-stochastic cellular material properties suggest performance benefits in lighter than air vehicles due tostiffness and mass constraints that are intrinsic to the airship design problem. Recent advances in cellular materialmanufacturing and reconfiguration enable system performance benefits including new concepts of operation, such aslighter than air vehicles that are assembled and maintained in-flight, eliminating structural compromises associatedwith transitional flight modes and ground handling. Existing engineered cellular materials display properties allowinglarge large scale airships design as monocoque cellular solids. Inevitable improvements in cellular material propertiesand manufacturing will improve feasibility even further. Given the suggestion that the two most significant technologygaps exist across all current airship projects are manufacturing and assembly processes and ground handling [7],a strategy that encompasses construction and maintenance in flight could provide critical rephrasing of the systemdesign problem through these new concepts of operation. Refactoring of traditional manufacturing, operation, andservice process constraints could extend to other domains in aerospace systems and manufacturing in general.In future work, the complexity of the design task would benefit from a form of optimization in order to find themost suitable geometry for a chosen application. For example, the Sequential Least SQuares Programming (SLSQP)function from within the SciPy Minimize library is a multiobjective constrained optimization method that has beenapplied to fixed wing aircraft design. [17] In this situation it would allow for several objective functions such as drag,bending stiffness, buoyancy and cost of transport to be incorporated into a composite objective function.

Copplestone, Grace↗

From Optimization to Sampling Through Gradient Flows

Optimization and sampling algorithms play a central role in science and engineering as they enable finding optimal predictions, policies, and recommendations, as well as expected and equilibrium states of complex systems. The notion of “optimality” is formalized by the choice of an objective function, while the notion of an “expected” state is specified by a probabilistic model for the distribution of states. Optimizing rugged objective functions and sampling multimodal distributions is computationally challenging, especially in high-dimensional problems. Here, for this reason, many optimization and sampling methods have been developed by researchers working in disparate fields such as Bayesian statistics, molecular dynamics, genetics, quantum chemistry, machine learning, weather forecasting, econometrics, and medical imaging.

Trillos, N. García↗

A multilevel approach for minimum weight structural design including local and system buckling constraints

A rational multilevel approach for minimum weight structural design of truss and wing structures including local and system buckling constraints is presented. Overall proportioning of the structure is achieved at the system level subject to strength, displacement and system buckling constraints, while the detailed component designs are carried out separately at the component level satisfying local buckling constraints. Total structural weight is taken to be the objective function at the system level while employing the change in the equivalent system stiffness of the component as the component level objective function. Finite element analysis is used to predict static response while system buckling behavior is handled by incorporating a geometric stiffness matrix capability. Buckling load factors and the corresponding mode shapes are obtained by solving the eigenvalue problem associated with the assembled elastic stiffness and geometric stiffness matrices for the structural system. At the component level various local buckling failure modes are guarded against using semi-empirical formulas. Mathematical programming techniques are employed at both the system and component level.

Schmit, L. A., Jr.↗

Impedance Eduction in a Duct Using the Linearized Euler Equations

An impedance eduction technique that is based upon a numerical solution to the linearized Euler equations coupled with the minimization of an objective function is presented. The linearized Euler equations are solved numerically using a cubic finite element method and the minimum of the objective function is obtained via a gradient based optimizer. The mean flow is allowed to have a gradient in two coordinate directions and the impedance of the liner may vary arbitrarily over the liner surface. A new regularized wall impedance boundary condition presented by Rienstra which contains the effects of the mean boundary layer thickness is implemented. Impedances are educed for a perforate over honeycomb liner using test data acquired in the Langley Grazing Flow Impedance Tube. The impedance of the liner is educed both with an upstream source and a downstream source. The method is validated by comparing the educed impedance to a benchmark method. The primary conclusion of the study is that the impedances educed for upstream and downstream sources are not well matched and that the primary effect of the boundary thickness is to reduce the resistance of the liner.

Watson, Willie R.↗

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗

Submodular optimization problems and greedy strategies: A survey

The greedy strategy is an approximation algorithm to solve optimization problems arising in decision making with multiple actions. How effective is the greedy strategy compared to the optimal solution? In this survey, we mainly consider two classes of optimization problems where the objective function is submodular. The first is set submodular optimization, which is to choose a set of actions to optimize a set submodular objective function, and the second is string submodular optimization, which is to choose an ordered set of actions to optimize a string submodular function. Our emphasis here is on performance bounds for the greedy strategy in submodular optimization problems. Specifically, we review performance bounds for the greedy strategy, more general and improved bounds in terms of curvature, performance bounds for the batched greedy strategy, and performance bounds for Nash equilibria.

97 MATHEMATICS AND COMPUTING↗

Navigating the Dynamic Noise Landscape of Variational Quantum Algorithms with QISMET

In the Noisy Intermediate Scale Quantum (NISQ) era, the dynamic nature of quantum systems causes noise sources to constantly vary over time. Transient errors from the dynamic NISQ noise landscape are challenging to comprehend and are especially detrimental to classes of applications that are iterative and/or long-running, and therefore their timely mitigation is important for quantum advantage in real-world applications. The most popular examples of iterative long-running quantum applications are variational quantum algorithms (VQAs). Iteratively, VQA’s classical optimizer evaluates circuit candidates on an objective function and picks the best circuits towards achieving the application’s target. Noise fluctuation can cause a significant transient impact on the objective function estimation of the VQA iterations’ tuning candidates. This can severely affect VQA tuning and, by extension, its accuracy and convergence. Furthermore, this paper proposes QISMET: Quantum Iteration Skipping to Mitigate Error Transients, to navigate the dynamic noise landscape of VQAs. QISMET actively avoids instances of high fluctuating noise which are predicted to have a significant transient error impact on specific VQA iterations. To achieve this, QISMET estimates transient error in VQA iterations and designs a controller to keep the VQA tuning faithful to the transient-free scenario. By doing so, QISMET efficiently mitigates a large portion of the transient noise impact on VQAs and is able to improve the fidelity by 1.3x-3x over a traditional VQA baseline, with 1.6-2.4x improvement over alternative approaches, across different applications and machines.

Ravi, Gokul Subramanian↗

Total Variation Majorization Minimization (TV-MM) Approach to Radiometer Brightness Temperature Gridding and Reconstruction

This paper presents the implementation of an algorithm to enhance the image resolution of the Earth's surface brightness temperature (T B ) data measured by radiometers such as the one onboard of the Soil Moisture Active Passive (SMAP) mission. A key step in radiometer T B processing is the conversion of the swath-based calibrated antenna temperature (T A ) measurements to the Level 3 Earth-centered grid. The simplest algorithm to transform this data from swath to gridded format is called drop-in-the-bucket which simply averages surrounding noisy T A samples to form a T B value at the gridded location. This method reduces noise, however produces low resolution products. To obtain a higher resolution product, SMAP uses other techniques such the Backus-Gilbert (BG) algorithm, which is the conventional method used in microwave radiometry. Although this method performs the required interpolation, it is not effective in denoising and removing blurring effects due to antenna filtering of the radiometer image data. Our motivation for this development is to further improve the resolution through post-processing of the radiometer T B image, a highly cost-effective method of image enhancement. The approach adapted in this work is based on the minimization of the Total Variation (TV) regularized objective function that is used extensively in solving general ill-posed linear inverse problems in image processing. Since the TV-based objective function is convex but not everywhere differentiable, there exists many numerical algorithms that can estimate the solution and the one selected for this work is called Majorization- Minimization (MM). By applying this algorithm, simulation experiments were performed based on synthetic data from the Geophysical model as well as real SMAP data to demonstrate the effectiveness of the technique. Results were then compared against the BG method.

Wing Lee↗

Thermal and Mechanical Energy Performance Analysis of Closed-loop Systems in Hot-Dry-Rock and Hot-Wet-Rock Reservoirs

To understand the potential and limitations for recovering thermal and mechanical energy from closed-loop geothermal systems a collaborative study is underway that will investigate an array of system configurations, working fluids, geothermal reservoir characteristics, operational periods, and heat transfer enhancements. Closed-loop geothermal systems are distinguished from hydrothermal or enhanced geothermal systems (EGS) in that the working fluid only circulates through drilled boreholes. Principal objectives of this study are to determine upper limits for thermal and mechanical energy recovery and optimal operational and configuration parameters for each scenario. Teams of scientists and engineers are applying a suite of numerical simulation and analytical tools to model the heat recovery from closed-loop geothermal systems, and then optimizing operational and configuration parameters to maximize the thermal and mechanical energy recovery. Results from the suite of numerical simulators and analytical tools, such as outlet and inlet states and temperature profiles in the geothermal reservoir over time are intercompared to increase confidence in the analysis. This paper documents the study findings for closed-loop systems in hot-dry-rock and hot-wet-rock reservoirs, where water is the working fluid. The characteristics of the hot-dry-rock reservoir were based on the U.S. Department of Energy's Utah Frontier Observatory for Research in Geothermal Energy (FORGE) site, near Milford Utah. Two objective functions are defined to optimize the operational and configuration parameters of the system, one each for the recovery of mechanical and thermal energy over the period of operation. For both objective functions, a surface plant thermal to mechanical energy conversion factor and an energy drilling cost is required. In keeping with the study objectives the surface plant conversion factor is determined from a second-law of thermodynamics analysis of a generic binary plant, and drilling costs are based on those from the Utah FORGE site and current national electrical costs.

closed-loop geothermal systems↗

Thermal and Mechanical Energy Performance Analysis of Closed-loop Systems in Hot-Dry-Rock and Hot-Wet-Rock Reservoirs

To understand the potential and limitations for recovering thermal and mechanical energy from closed-loop geothermal systems a collaborative study is underway that will investigate an array of system configurations, working fluids, geothermal reservoir characteristics, operational periods, and heat transfer enhancements. Closed-loop geothermal systems are distinguished from hydrothermal or enhanced geothermal systems (EGS) in that the working fluid only circulates through drilled boreholes. Principal objectives of this study are to determine upper limits for thermal and mechanical energy recovery and optimal operational and configuration parameters for each scenario. Teams of scientists and engineers are applying a suite of numerical simulation and analytical tools to model the heat recovery from closed-loop geothermal systems, and then optimizing operational and configuration parameters to maximize the thermal and mechanical energy recovery. Results from the suite of numerical simulators and analytical tools, such as outlet and inlet states and temperature profiles in the geothermal reservoir over time are intercompared to increase confidence in the analysis. This paper documents the study findings for closed-loop systems in hot-dry-rock and hot-wet-rock reservoirs, where water is the working fluid. The characteristics of the hot-dry-rock reservoir were based on the U.S. Department of Energy’s Utah Frontier Observatory for Research in Geothermal Energy (FORGE) site, near Milford Utah. Two objective functions are defined to optimize the operational and configuration parameters of the system, one each for the recovery of mechanical and thermal energy over the period of operation. For both objective functions, a surface plant thermal to mechanical energy conversion factor and an energy drilling cost is required. In keeping with the study objectives the surface plant conversion factor is determined from a second-law of thermodynamics analysis of a generic binary plant, and drilling costs are based on those from the Utah FORGE site and current national electrical costs.

Closed-loop geothermal systems, hot-dry-rock, hot-↗