Search NASA⌕ Search

SEARCH · Search NASA

Results for “program optimizations”

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 1,693 records · Page 94

Modeling design and control problems involving neural network surrogates

Here, we consider nonlinear optimization problems that involve surrogate models represented by neural networks. We demonstrate first how to directly embed neural network evaluation into optimization models, highlight a difficulty with this approach that can prevent convergence, and then characterize stationarity of such models. We then present two alternative formulations of these problems in the specific case of feedforward neural networks with ReLU activation: as a mixed-integer optimization problem and as a mathematical program with complementarity constraints. For the latter formulation we prove that stationarity at a point for this problem corresponds to stationarity of the embedded formulation. Each of these formulations may be solved with state-of-the-art optimization methods, and we show how to obtain good initial feasible solutions for these methods. We compare our formulations on three practical applications arising in the design and control of combustion engines, in the generation of adversarial attacks on classifier networks, and in the determination of optimal flows in an oil well network.

97 MATHEMATICS AND COMPUTING↗

A Comparison of Control Allocation Methods in the Presence of Parametric Model Uncertainty

When allocating redundant effectors to virtual control commands, linear (generalized inverse) allocators have historically been used on aircraft and spacecraft. While simple to implement, generalized inverses are unable to realize a significant portion of the attainable moments. To address this drawback, the control allocation problem can also be formulated as a linear programming or quadratic programming problem and solved using convex optimization based solvers. These approaches have been shown to access a larger set of attainable moments, however, little work has been done to understand the performance of convex optimization-based control allocation in the presence of parametric model uncertainty. This paper seeks to compare the performance of several control allocation approaches, including two forms of generalized inverse allocators, the pseudo inverse and minimum-variance, and the linear programming and quadratic programming approach in the presence of parametric model uncertainty. The performance of these four allocators were tested on an aircraft model in the presence of realistic parametric model uncertainty and the convex optimization approaches were shown to outperform the generalized inverses.

Luke J Miller↗

Information Management for a Large Multidisciplinary Project

In 1989, NASA's Langley Research Center (LaRC) initiated the High-Speed Airframe Integration Research (HiSAIR) Program to develop and demonstrate an integrated environment for high-speed aircraft design using advanced multidisciplinary analysis and optimization procedures. The major goals of this program were to evolve the interactions among disciplines and promote sharing of information, to provide a timely exchange of information among aeronautical disciplines, and to increase the awareness of the effects each discipline has upon other disciplines. LaRC historically has emphasized the advancement of analysis techniques. HiSAIR was founded to synthesize these advanced methods into a multidisciplinary design process emphasizing information feedback among disciplines and optimization. Crucial to the development of such an environment are the definition of the required data exchanges and the methodology for both recording the information and providing the exchanges in a timely manner. These requirements demand extensive use of data management techniques, graphic visualization, and interactive computing. HiSAIR represents the first attempt at LaRC to promote interdisciplinary information exchange on a large scale using advanced data management methodologies combined with state-of-the-art, scientific visualization techniques on graphics workstations in a distributed computing environment. The subject of this paper is the development of the data management system for HiSAIR.

Kennie H Jones↗

Poster — Thur Eve — 35: The impact of intensity- and energy-modulated photon radiotherapy (XMRT) optimization on a variety of organ geometries

We previously reported on a novel, modulated in both energy and intensity; photon radiotherapy (XMRT) optimization technique. The purpose of this investigation was to test this XMRT optimization against conventional intensity modulated radiotherapy (IMRT) optimization on four different organ test geometries. All geometries mimicked clinically relevant scenarios. Both IMRT and XMRT were based on a linear programming approach where the objective function was the mean dose to healthy organs and organ-specific linear dose-point constraints were used. For IMRT, the beam energy was fixed to 6 MV while XMRT optimized in terms of both 6 and 18 MV beams. All plans consisted of a seven beam coplanar arrangement. All organ geometries were contoured on a 25cm diameter cylindrical water phantom in open source radiotherapy research software known as CERR. Solutions for both IMRT and XMRT were obtained for each geometry using a numerical solver Gurobi. Analyzing the quality of the solutions was done by comparing dose distributions and dose volume histograms calculated using CERR. For all four geometries, IMRT and XMRT solutions were comparable in terms of target coverage. For two of the geometries, IMRT provided an advantage in terms of reduced dose to the healthy structures. XMRT showed improved dose reduction to healthy organs for one geometry and a comparable dose distribution to IMRT for the remaining geometry. The inability to exploit the benefits of using multiple energies may be attributed to limited water phantom diameter and having the majority of the organs in close proximity to the transverse axis.

60 APPLIED LIFE SCIENCES↗

Spraylon fluorocarbon encapsulation for silicon solar cell arrays

A development program was performed for evaluating, modifying, and optimizing the Lockheed formulated liquid transparent filmforming Spraylon fluorocarbon protective coating for silicon solar cells and modules. The program objectives were designed to meet the requirements of the low-cost automated solar cell array fabrication process. As part of the study, a computer program was used to establish the limits of the safe working stress in the coated silicon solar cell array system under severe thermal shock.

Source record↗

Experiences with NASTRAN in a multidisciplinary optimization environment

NASTRAN and COPES/CONMIN were used in the early-stage design optimization of a propeller and shaft. The work was undertaken, in part, to assess the performance of these programs for such a task. While the optimization was successful, some drawbacks to the approach surfaced and are discussed.

Hurwitz, M. M.↗

Thermal Energy Storage Model Development within the Integrated Energy Systems Hybrid Repository

This publication details newly created energy storage models developed within the HYBRID Modelica repository as part of the Department of Energy Office of Nuclear Energy (DOE-NE) Integrated Energy Systems (IES) program, led by Idaho National Laboratory (INL). Model development to-date includes creation of dynamic systems-level models of concrete, latent heat, and packed-bed thermocline energy storage technologies for deployment in the IES-based HYBRID repository. Models are developed using the latest publicly available data and incorporate the possibility of control strategy inclusion for use with the existing IES modeling, analysis, and optimization toolset. Simulations showcase the abilities of each technology to cyclically charge and discharge when exposed to time-varying boundary conditions. In addition, low-level surrogate models for some of the thermal energy storage technologies were created using Python. These lower order Python files are much cheaper to run (i.e., computationally faster) and thus operate well when incorporated within the stochastic optimization problems run for the IES program. Moreover, economic data was collected for use within the INL-developed Framework for Optimization of ResourCes and Economics (FORCE). This information is incorporated within the FORCE platform. This work has resulted in creation of systems-level models for concrete, latent heat, and thermocline thermal energy storage systems with associated control systems. Now that these models are available, they can be utilized within different integrated energy park concepts to understand optimal system operation, control, and dispatching. Moreover, given the generic nature of the models, industrial partner technologies (e.g., Storworks Power, EnergyNest) can be quickly added to the repository using the existing models as a basis. Additional dynamic models for thermal energy storage concepts can be developed and added to the HYBRID repository as needed.

25 ENERGY STORAGE↗

Optimum equipment maintenance/replacement policy. Part 2: Markov decision approach

Dynamic programming was utilized as an alternative optimization technique to determine an optimal policy over a given time period. According to a joint effect of the probabilistic transition of states and the sequence of decision making, the optimal policy is sought such that a set of decisions optimizes the long-run expected average cost (or profit) per unit time. Provision of an alternative measure for the expected long-run total discounted costs is also considered. A computer program based on the concept of the Markov Decision Process was developed and tested. The program code listing, the statement of a sample problem, and the computed results are presented.

Charng, T.↗

Fitting Nonlinear Curves by use of Optimization Techniques

MULTIVAR is a FORTRAN 77 computer program that fits one of the members of a set of six multivariable mathematical models (five of which are nonlinear) to a multivariable set of data. The inputs to MULTIVAR include the data for the independent and dependent variables plus the user s choice of one of the models, one of the three optimization engines, and convergence criteria. By use of the chosen optimization engine, MULTIVAR finds values for the parameters of the chosen model so as to minimize the sum of squares of the residuals. One of the optimization engines implements a routine, developed in 1982, that utilizes the Broydon-Fletcher-Goldfarb-Shanno (BFGS) variable-metric method for unconstrained minimization in conjunction with a one-dimensional search technique that finds the minimum of an unconstrained function by polynomial interpolation and extrapolation without first finding bounds on the solution. The second optimization engine is a faster and more robust commercially available code, denoted Design Optimization Tool, that also uses the BFGS method. The third optimization engine is a robust and relatively fast routine that implements the Levenberg-Marquardt algorithm.

Hill, Scott A.↗

Fast model-based scenario optimization in NSTX-U enabled by analytic gradient computation

Model-based optimization offers a systematic approach to advanced scenario planning. In this case, the feedforward-control inputs (actuator trajectories) that are needed to attain and sustain a desired scenario are obtained by solving a nonlinear constrained optimization problem. This class of problems generally minimize a cost function that measures the difference between desired and actual plasma states. Several numerical optimization algorithms, such as sequential quadratic programming, require repeated calculation of the cost function gradients with respect to the input trajectories. Calculating these gradients numerically can be computationally intensive, increasing the time needed to solve the feedforward-control optimization problem. Here, this work introduces a method to analytically calculate these cost function gradients from the current profile evolution model. This can significantly reduce the computational time and allow for fast feedforward-control optimization, which would eventually enable optimal scenario planning between discharges. The performance of the feedforward optimizer with analytical gradients is compared to a traditional optimization algorithm based on numerical gradients for different NSTX-U scenarios. The plasma dynamics in the optimization algorithm are simulated using the Control Oriented Transport SIMulator (COTSIM). Results of the work show that analytical gradients consistently reduce the computation time while achieving trajectories that are comparable to those obtained by traditional optimization algorithms based on numerical gradients.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Development of a method for optimal maneuver analysis of complex space missions

A system that allows mission planners to find optimal multiple-burn space trajectories easily is described. Previously developed methods with different gravity assumptions perform the optimization function. The power of these programs is extended by a method of costate estimation. A penalty function method of constraining coast arc times to be positive is included. The capability of the method is demonstrated by finding the optimal control for three different space missions. These include a shuttle abort-once-around mission and two- and three-burn geosynchronous satellite-placement missions.

Mcadoo, S. F., Jr.↗

TU-AB-303-01: A Feasibility Study for Dynamic Adaptive Therapy of Non-Small Cell Lung Cancer

Purpose: To compare plans for NSCLC optimized using Dynamic Adaptive Therapy (DAT) with conventional IMRT optimization. DAT adapts plans based on changes in the target volume by using dynamic programing techniques to consider expected changes into the optimization process. Information gathered during treatment, e.g. from CBCT, is incorporated into the optimization. Methods and materials: DAT is formulated using stochastic control formalism, which minimizes the total expected number of tumor cells at the end of a treatment course subject to uncertainty inherent in the tumor response and organs-at-risk (OAR) dose constraints. This formulation allows for non-stationary dose distribution as well as non-stationary fractional dose as needed to achieve a series of optimal plans that are conformal to tumor over time. Sixteen phantom cases with various sizes and locations of tumors, and OAR geometries were generated. Each case was planned with DAT and conventional IMRT (60Gy/30fx). Tumor volume change over time was obtained by using, daily MVCT-based, two-level cell population model. Monte Carlo simulations have been performed for each treatment course to account for uncertainty in tumor response. Same OAR dose constraints were applied for both methods. The frequency of plan modification was varied to 1, 2, 5 (weekly), and 29 (daily). The final average tumor dose and OAR doses have been compared to quantify the potential benefit of DAT. Results: The average tumor max, min, mean, and D95 resulted from DAT were 124.0–125.2%, 102.1–114.7%, 113.7–123.4%, and 102.0–115.9% (range dependent on the frequency of plan modification) of those from conventional IMRT. Cord max, esophagus max, lung mean, heart mean, and unspecified tissue D05 resulted from AT were 84–102.4%, 99.8–106.9%, 66.9–85.6%, 58.2–78.8%, and 85.2–94.0% of those from conventional IMRT. Conclusions: Significant tumor dose increase and OAR dose reduction, especially with parallel OAR with mean or dose-volume constraints, can be achieved using DAT.

60 APPLIED LIFE SCIENCES↗

Aero/structural tailoring of engine blades (AERO/STAEBL)

This report describes the Aero/Structural Tailoring of Engine Blades (AERO/STAEBL) program, which is a computer code used to perform engine fan and compressor blade aero/structural numerical optimizations. These optimizations seek a blade design of minimum operating cost that satisfies realistic blade design constraints. This report documents the overall program (i.e., input, optimization procedures, approximate analyses) and also provides a detailed description of the validation test cases.

Brown, K. W.↗

Optimization of LIBS Acquisition Parameters for Chemical Analysis on HLW Liquid Solution - 18291

Research programs are currently underway in the Joint CEA-AREVA Vitrification Laboratory (LCV) to develop and optimize Laser Induced Breakdown Spectroscopy (LIBS) for nuclear waste streams analyses. The laboratory has full scale prototypes with the advantage of working on simulated inactive solutions of fission products. LIBS is an elemental chemical analysis technology that uses a short laser pulse to create a micro-plasma on the sample surface. This analytical technique offers many advantages compared to other techniques. It includes a sample preparation-free measurement and an extremely fast measurement time, from a few seconds to a few minutes. This paper presents the LIBS technique available in the laboratory. The first LIBS analyzes results of liquid samples from the off-gas treatment unit integrated on the full scale vitrification process are also presented and discussed. These complex solutions contain suspended particles and up to 30 chemical elements. A vision of an online LIBS analysis cell is also proposed with the development and associated research steps. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians

In this study, we consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We assume for the objective that its evaluation, gradient, and Hessian are inaccessible, while one can compute their stochastic estimates by, for example, subsampling. We propose a stochastic algorithm based on sequential quadratic programming (SQP) that uses a differentiable exact augmented Lagrangian as the merit function. To motivate our algorithm design, we first revisit and simplify an old SQP method Lucidi developed for solving deterministic problems, which serves as the skeleton of our stochastic algorithm. Based on the simplified deterministic algorithm, we then propose a non-adaptive SQP for dealing with stochastic objective, where the gradient and Hessian are replaced by stochastic estimates but the stepsizes are deterministic and prespecified. Finally, we incorporate a recent stochastic line search procedure Paquette and Scheinberg into the non-adaptive stochastic SQP to adaptively select the random stepsizes, which leads to an adaptive stochastic SQP. The global "almost sure" convergence for both non-adaptive and adaptive SQP methods is established. Numerical experiments on nonlinear problems in CUTEst test set demonstrate the superiority of the adaptive algorithm.

97 MATHEMATICS AND COMPUTING↗

Computational Approaches to Simulation and Optimization of Global Aircraft Trajectories

This study examines three possible approaches to improving the speed in generating wind-optimal routes for air traffic at the national or global level. They are: (a) using the resources of a supercomputer, (b) running the computations on multiple commercially available computers and (c) implementing those same algorithms into NASAs Future ATM Concepts Evaluation Tool (FACET) and compares those to a standard implementation run on a single CPU. Wind-optimal aircraft trajectories are computed using global air traffic schedules. The run time and wait time on the supercomputer for trajectory optimization using various numbers of CPUs ranging from 80 to 10,240 units are compared with the total computational time for running the same computation on a single desktop computer and on multiple commercially available computers for potential computational enhancement through parallel processing on the computer clusters. This study also re-implements the trajectory optimization algorithm for further reduction of computational time through algorithm modifications and integrates that with FACET to facilitate the use of the new features which calculate time-optimal routes between worldwide airport pairs in a wind field for use with existing FACET applications. The implementations of trajectory optimization algorithms use MATLAB, Python, and Java programming languages. The performance evaluations are done by comparing their computational efficiencies and based on the potential application of optimized trajectories. The paper shows that in the absence of special privileges on a supercomputer, a cluster of commercially available computers provides a feasible approach for national and global air traffic system studies.

global air traffic optimization↗

Computational Approaches to Simulation and Optimization of Global Aircraft Trajectories

This study examines three possible approaches to improving the speed in generating wind-optimal routes for air traffic at the national or global level. They are: (a) using the resources of a supercomputer, (b) running the computations on multiple commercially available computers and (c) implementing those same algorithms into NASA’s Future ATM Concepts Evaluation Tool (FACET) and compares those to a standard implementation run on a single CPU. Wind-optimal aircraft trajectories are computed using global air traffic schedules. The run time and wait time on the supercomputer for trajectory optimization using various numbers of CPUs ranging from 80 to 10,240 units are compared with the total computational time for running the same computation on a single desktop computer and on multiple commercially available computers for potential computational enhancement through parallel processing on the computer clusters. This study also re-implements the trajectory optimization algorithm for further reduction of computational time through algorithm modifications and integrates that with FACET to facilitate the use of the new features which calculate time-optimal routes between worldwide airport pairs in a wind field for use with existing FACET applications. The implementations of trajectory optimization algorithms use MATLAB, Python, and Java programming languages. The performance evaluations are done by comparing their computational efficiencies and based on the potential application of optimized trajectories. The paper shows that in the absence of special privileges on a supercomputer, a cluster of commercially available computers provides a good option for computing wind-optimal trajectories for national and global air traffic system studies.

Ng, Hok K.↗

Automation of reverse engineering process in aircraft modeling and related optimization problems

During the year of 1994, the engineering problems in aircraft modeling were studied. The initial concern was to obtain a surface model with desirable geometric characteristics. Much of the effort during the first half of the year was to find an efficient way of solving a computationally difficult optimization model. Since the smoothing technique in the proposal 'Surface Modeling and Optimization Studies of Aerodynamic Configurations' requires solutions of a sequence of large-scale quadratic programming problems, it is important to design algorithms that can solve each quadratic program in a few interactions. This research led to three papers by Dr. W. Li, which were submitted to SIAM Journal on Optimization and Mathematical Programming. Two of these papers have been accepted for publication. Even though significant progress has been made during this phase of research and computation times was reduced from 30 min. to 2 min. for a sample problem, it was not good enough for on-line processing of digitized data points. After discussion with Dr. Robert E. Smith Jr., it was decided not to enforce shape constraints in order in order to simplify the model. As a consequence, P. Dierckx's nonparametric spline fitting approach was adopted, where one has only one control parameter for the fitting process - the error tolerance. At the same time the surface modeling software developed by Imageware was tested. Research indicated a substantially improved fitting of digitalized data points can be achieved if a proper parameterization of the spline surface is chosen. A winning strategy is to incorporate Dierckx's surface fitting with a natural parameterization for aircraft parts. The report consists of 4 chapters. Chapter 1 provides an overview of reverse engineering related to aircraft modeling and some preliminary findings of the effort in the second half of the year. Chapters 2-4 are the research results by Dr. W. Li on penalty functions and conjugate gradient methods for quadratic programming problems.

Li, W.↗