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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 145 records · Page 8

All sources NASA NTRS DOE OSTI

NASA NTRS1998

A Rigorous Framework for Optimization of Expensive Functions by Surrogates

The goal of the research reported here is to develop rigorous optimization algorithms to apply to some engineering design problems for which design application of traditional optimization approaches is not practical. This paper presents and analyzes a framework for generating a sequence of approximations to the objective function and managing the use of these approximations as surrogates for optimization. The result is to obtain convergence to a minimizer of an expensive objective function subject to simple constraints. The approach is widely applicable because it does not require, or even explicitly approximate, derivatives of the objective. Numerical results are presented for a 31-variable helicopter rotor blade design example and for a standard optimization test example.

Booker, Andrew J.↗

DOE OSTI2023

Design of Multi-Stage Solvent Extraction Process for Separation of Rare Earth Elements

Flowsheet design and stage determination for the separation of rare earth elements (REEs) using solvent extraction (SX) is a challenging task because of the chemical similarity of the REEs. Low separation factors between the elements and complex equilibrium chemistry provide unique challenges to designing an efficient flowsheet for the separation of elements. The multi-stage nature of the SX process adds further complexity, making the assessment of products for a proposed design and stage combination difficult. Therefore, to develop a SX flowsheet, it is essential to quantify the performance for various design and separation conditions. This paper attempts to address the challenge by utilizing an equilibrium and process modeling approach. Results from a bench-scale study performed on a 10 g/L rare earth salt mixture were used in studying the extraction/stripping behavior and developing equilibrium models. DEHPA with TBP as a phase modifier was used as an extractant, while hydrochloric acid was utilized as a stripping agent. The results obtained were used in developing extraction/stripping models, which were integrated into a process framework of a SX train in a Matlab/Simulink environment. The models were programmed as a function block routine and used for developing a flowsheet, which was simulated for differing separation and design conditions. To identify optimum stage combinations, a particle swarm optimization (PSO) routine was developed and implemented for each SX train. Recovery and purity of elements of interest were used as objective function criteria. The stage combination leading to the minimization of the objective function was used to identify the optimum stage combination for a series of SX trains to attempt a balance of purity and recovery. The models and optimization method were implemented to separate a feed mixture containing REEs, which indicated that 99.52 and 85.41 percent purity is achievable for Yttrium and Lanthanum separation using 8-12-3 and 10-3-5 stage combination for loading, scrubbing, and striping. The model also indicated difficult separability between neodymium, praseodymium, and cerium.

Srivastava, Vaibhav (ORCID:0000000212645987)↗

NASA NTRS1994

Optimizations on Designing High-Resolution Finite-Difference Schemes

We describe a general optimization procedure for both maximizing the resolution characteristics of existing finite differencing schemes as well as designing finite difference schemes that will meet the error tolerance requirements of numerical solutions. The procedure is based on an optimization process. This is a generalization of the compact scheme introduced by Lele in which the resolution is improved for single, one-dimensional spatial derivative, whereas in the present approach the complete scheme, after spatial and temporal discretizations, is optimized on a range of parameters of the scheme and the governing equations. The approach is to linearize and Fourier analyze the discretized equations to check the resolving power of the scheme for various wave number ranges in the solution and optimize the resolution to satisfy the requirements of the problem. This represents a constrained nonlinear optimization problem which can be solved to obtain the nodal weights of discretization. An objective function is defined in the parametric space of wave numbers, Courant number, Mach number and other quantities of interest. Typical criterion for defining the objective function include the maximization of the resolution of high wave numbers for acoustic and electromagnetic wave propagations and turbulence calculations. The procedure is being tested on off-design conditions of non-uniform mesh, non-periodic boundary conditions, and non-constant wave speeds for scalar and system of equations. This includes the solution of wave equations and Euler equations using a conventional scheme with and without optimization and the design of an optimum scheme for the specified error tolerance.

Liu, Yen↗

NASA NTRS1989

Efficient mapping algorithms for scheduling robot inverse dynamics computation on a multiprocessor system

Two efficient mapping algorithms for scheduling the robot inverse dynamics computation consisting of m computational modules with precedence relationship to be executed on a multiprocessor system consisting of p identical homogeneous processors with processor and communication costs to achieve minimum computation time are presented. An objective function is defined in terms of the sum of the processor finishing time and the interprocessor communication time. The minimax optimization is performed on the objective function to obtain the best mapping. This mapping problem can be formulated as a combination of the graph partitioning and the scheduling problems; both have been known to be NP-complete. Thus, to speed up the searching for a solution, two heuristic algorithms were proposed to obtain fast but suboptimal mapping solutions. The first algorithm utilizes the level and the communication intensity of the task modules to construct an ordered priority list of ready modules and the module assignment is performed by a weighted bipartite matching algorithm. For a near-optimal mapping solution, the problem can be solved by the heuristic algorithm with simulated annealing. These proposed optimization algorithms can solve various large-scale problems within a reasonable time. Computer simulations were performed to evaluate and verify the performance and the validity of the proposed mapping algorithms. Finally, experiments for computing the inverse dynamics of a six-jointed PUMA-like manipulator based on the Newton-Euler dynamic equations were implemented on an NCUBE/ten hypercube computer to verify the proposed mapping algorithms. Computer simulation and experimental results are compared and discussed.

Lee, C. S. G.↗

NASA NTRS2004

Adaptive model-based control systems and methods for controlling a gas turbine

Adaptive model-based control systems and methods are described so that performance and/or operability of a gas turbine in an aircraft engine, power plant, marine propulsion, or industrial application can be optimized under normal, deteriorated, faulted, failed and/or damaged operation. First, a model of each relevant system or component is created, and the model is adapted to the engine. Then, if/when deterioration, a fault, a failure or some kind of damage to an engine component or system is detected, that information is input to the model-based control as changes to the model, constraints, objective function, or other control parameters. With all the information about the engine condition, and state and directives on the control goals in terms of an objective function and constraints, the control then solves an optimization so the optimal control action can be determined and taken. This model and control may be updated in real-time to account for engine-to-engine variation, deterioration, damage, faults and/or failures using optimal corrective control action command(s).

Brunell, Brent Jerome↗

NASA NTRS1985

Optimization of Controlled Structures

A formulation is presented for the coupled optimal design of a structural system and its control by defining a composite objective function as a linear combination of two components: a structural objective and a control objective. For the case when the structural objective is a function of the structural design variables only, and when the control objective is represented by the quadratic functional of the response and control energy, one can analytically express the optimal control in terms of any set of admissible structural design variables. The expression for the optimal control is used recursively in an iterative Newton-Raphson search scheme, the goal of which is to determine a corresponding optimal set of structural design variables that minimize the composite objective function. A numerical example is given to illustrate the computational procedure.

Salama, M.↗

NASA NTRS1976

Optimum design of composite laminates with thermal effects

An analytical approach to determine an optimum laminate for a variety of thermal and mechanical loading combinations is presented. The analysis is performed for a linear elastic material under static mechanical and uniform thermal loadings. The problem is restricted to a unit width and length laminate with angle orientations resulting in an orthotropic, symmetric, and balanced configuration. An objective function defining total strain energy, is formulated and an optimum laminate design determined subject to constraints on stiffness, average coefficient of thermal expansion, and strength. The objective function is formulated in terms of the orientation angles, number of plies, and material properties. The method presented has, in varying degrees, shown that the design of a laminate can be accomplished using strain energy minimization as the primary criteria. The results of various combinations of applied constraints in the optimized design process are presented and discussed.

Markham, L. R.↗

NASA NTRS1992

Design tradeoffs on engine-integrated hypersonic vehicles

Two classes of airbreathing hypersonic vehicle concepts, one for primarily cruise missions and the other for accelerator type missions, are presented. Both are designed with waverider airframes and hydrogen-fueled scramjet engine modules. Cruise configurations are optimized for the product of I(sp) and L/D while matching lift to weight and thrust to drag at some equivalence ratio. Accelerator configurations are optimized for effective specific impulse while matching lift to weight at an equivalence ratio of one. The method and computer code developed to optimize the configurations are discussed. The features and design tradeoffs for each class of vehicles are described. Recently available weight estimates for all-body waveriders have had a significant impact on the integrated configurations. Mach 8 vehicles at 40 km altitude optimized with the cruise objective function have L/Ds of 2.55 to 2.92 and I(sp)s of 2850 to 2940 sec. A Mach 14 vehicle at 40-km altitude optimized with the accelerator objective function has an I(sp) sub eff of 189 sec, and a Mach 10 vehicle an I(sp) sub eff of 880 sec.

O'Neill, Mary Kae L.↗

DOE OSTI2020

Batch Measurement Extremum Seeking Control of Distributed Energy Resources to Account for Communication Delays and Information Loss

Distributed Energy Resources (DER) have great potential to enhance the operation of electric power distribution systems. Previously, we explored the use of 2 Dimensional Extremum Seeking (2D-ES) control algorithms to enable model-free optimal control of DER to provide grid services to both the distribution and transmissions systems. Motivated by preliminary deployments of DER managed by 2D-ES algorithms in hardware-in-the-loop tests and in operational distribution grids, in this work, we extend the control scheme to accommodate communication delays and information loss. We propose a modification to the 2D-ES scheme to allow for the processing of batches of possibly noncontiguous objective function measurements at unknown and possibly uneven intervals. We provide a proof of the convergence of the batch 2D-ES (2D-BES) scheme when optimizing a generic convex objective function, as well as simulation results that demonstrate the suitability of the approach for substation active and reactive power target tracking.

Sankur, Michael↗

NASA NTRS2004

Distributed Control by Lagrangian Steepest Descent

Often adaptive, distributed control can be viewed as an iterated game between independent players. The coupling between the players mixed strategies, arising as the system evolves from one instant to the next, is determined by the system designer. Information theory tells us that the most likely joint strategy of the players, given a value of the expectation of the overall control objective function, is the minimizer of a function o the joint strategy. So the goal of the system designer is to speed evolution of the joint strategy to that Lagrangian mhimbhgpoint,lowerthe expectated value of the control objective function, and repeat Here we elaborate the theory of algorithms that do this using local descent procedures, and that thereby achieve efficient, adaptive, distributed control.

Wolpert, David H.↗

DOE OSTI2022

Applicability study of Bayesian optimization in core neutronic design using a toy model

At the Japan Atomic Energy Agency (JAEA), an innovative design approach named ARKADIA (Advanced Reactor Knowledge- and AI-aided Design Integration Approach through the whole plant life cycle) for advanced nuclear reactors is currently under development. One task in ARKADIA is to build a system that automatically optimizes core and fuel designs by conducting core neutronic and thermal-hydraulic calculations, fuel integrity evaluations, and plant dynamic analyses. This system will be implemented to automatically find an optimal design that minimizes (or maximizes) objective function defined by core performance while varying the core and fuel design parameters such as fuel pin diameter, core height and diameter. In this study, as the first step of system development, we focused only on core neutronic design and conducted a study of automatic optimization. As the optimization algorithm, Bayesian optimization (BO), an effective method for optimization problems with expensive computational cost of objective function, was utilized. The applicability of BO was studied based on single- and two-objective optimization examples of core neutronic design in a toy model. As a result, in the former, it was shown that BO can give the optimal solution, which matches the reference solution calculated by a brute force calculation well, with a small number of required calculations. Usability on core neutronic designs, where the computational cost per case is high, was confirmed. In the latter, it was found that BO can give a Pareto solutions-set that shows good agreement with the reference solution. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2021

Synthetic Reference-based Transition Optimal Control of Inverter for Surge-Current-Free Rapid Interface to Grid

This article addresses the problem of the transition between objective functions in optimal control for power inverters when switching between standalone and grid-connected modes. The work proposes the use of a synthetic reference during the transition between the corresponding objective functions. Moreover, the authors aim to show that a transition function can be imposed and controlled externally from the main optimal control routine. In the end, the simulation results demonstrate the importance of properly applying the proposed strategy for a smooth transition between the operating modes with minimal surge current. These results contrast with the strategies found in the literature where the smooth transition comes with the price of a few grid cycles to sync.

Roig Greidanus, Mateo D.↗

DOE OSTI2020

Calibration of energy density functionals with deformed nuclei

Nuclear density functional theory is the prevalent theoretical framework for accurately describing nuclear properties at the scale of the entire chart of nuclides. Given an energy functional and a many-body scheme (e.g., single- or multireference level), the predictive power of the theory depends strongly on how the parameters of the energy functionals have been calibrated with experimental data. Expanded algorithms and computing power have enabled recent optimization protocols to include data in deformed nuclei in order to optimize the coupling constants of the energy functional. The primary motivation of this work is to test the robustness of such protocols with respect to some of the technical and numerical details of the underlying calculations, especially when the calibration explores a large parameter space. To this end, we quantify the effect of these uncertainties on both the optimization and statistical emulation of composite objective functions. We also emphasize that Bayesian calibration can provide better estimates of the theoretical errors used to define objective functions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

A direct-adjoint approach for material point model calibration with application to plasticity

Here, this paper proposes a new approach for the calibration of material parameters in local elastoplastic constitutive models. The calibration is posed as a constrained optimization problem, where the constitutive model evolution equations for a single material point serve as constraints. The objective function quantifies the mismatch between the stress predicted by the model and corresponding experimental measurements. To improve calibration efficiency, a novel direct-adjoint approach is presented to compute the Hessian of the objective function, which enables the use of second-order optimization algorithms. Automatic differentiation is used for gradient and Hessian computations. Two numerical examples are employed to validate the Hessian matrices and to demonstrate that the Newton–Raphson algorithm consistently outperforms gradient-based algorithms such as L-BFGS-B.

36 MATERIALS SCIENCE↗

DOE OSTI2023

Single-stage stellarator optimization: combining coils with fixed boundary equilibria

We introduce a novel approach for the simultaneous optimization of plasma physics and coil engineering objectives using fixed-boundary equilibria that is computationally efficient and applicable to a broad range of vacuum and finite plasma pressure scenarios. Our approach treats the plasma boundary and coil shapes as independently optimized variables, penalizing the mismatch between the two using a quadratic flux term in the objective function. Four use cases are presented to demonstrate the effectiveness of the approach, including simple and complex stellarator geometries. As shown here, this method outperforms previous two-stage approaches, achieving smaller plasma objective function values when coils are taken into account.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1985

Engineering calculations for communications satellite systems planning

Computer-based techniques for optimizing communications-satellite orbit and frequency assignments are discussed. A gradient-search code was tested against a BSS scenario derived from the RARC-83 data. Improvement was obtained, but each iteration requires about 50 minutes of IBM-3081 CPU time. Gradient-search experiments on a small FSS test problem, consisting of a single service area served by 8 satellites, showed quickest convergence when the satellites were all initially placed near the center of the available orbital arc with moderate spacing. A transformation technique is proposed for investigating the surface topography of the objective function used in the gradient-search method. A new synthesis approach is based on transforming single-entry interference constraints into corresponding constraints on satellite spacings. These constraints are used with linear objective functions to formulate the co-channel orbital assignment task as a linear-programming (LP) problem or mixed integer programming (MIP) problem. Globally optimal solutions are always found with the MIP problems, but not necessarily with the LP problems. The MIP solutions can be used to evaluate the quality of the LP solutions. The initial results are very encouraging.

Reilly, C. H.↗

NASA NTRS1987

Structural tailoring of advanced turboprops

A computer program has been developed for the performance of numerical optimizations of highly swept propfan blades by minimizing an objective function that is defined either as direct operating cost or the aeroelastic difference between a blade and its scaled model. Three component analysis categories are employed: an optimization algorithm, approximate analysis procedures for objective function and constraint evaluation, and refined analysis procedures for optimum design validation. The analyses conducted by the program encompass aerodynamic efficiency evaluation, finite element stress and vibration analysis, acoustics, flutter, and forced response life prediction.

Brown, K. W.↗

NASA NTRS1989

Integrated aerodynamic/dynamic optimization of helicopter rotor blades

An integrated aerodynamic/dynamic optimization procedure is used to minimize blade weight and 4/rev vertical shear of a rotor blade in forward flight. Both single and multiple objective functions are used, with constraints imposed on the first four coupled natural frequencies (elastic modes only), the blade aerorotational inertia, and the centrifugal stress. The global criteria approach is used for the multiple objective formulation, and the results are compared with those obtained from single objective function formulations. Optimum designs are compared against a reference blade, and it is shown that optimum results can be obtained in 7-10 cycles.

Chattopadhyay, Aditi↗