Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization methods”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

A method to stabilize linear systems using eigenvalue gradient information

Formal optimization methods and eigenvalue gradient information are used to develop a stabilizing control law for a closed loop linear system that is initially unstable. The method was originally formulated by using direct, constrained optimization methods with the constraints being the real parts of the eigenvalues. However, because of problems in trying to achieve stabilizing control laws, the problem was reformulated to be solved differently. The method described uses the Davidon-Fletcher-Powell minimization technique to solve an indirect, constrained minimization problem in which the performance index is the Kreisselmeier-Steinhauser function of the real parts of all the eigenvalues. The method is applied successfully to solve two different problems: the determination of a fourth-order control law stabilizes a single-input single-output active flutter suppression system and the determination of a second-order control law for a multi-input multi-output lateral-directional flight control system. Various sets of design variables and initial starting points were chosen to show the robustness of the method.

Wieseman, C. D.↗
NASA NTRS1996

A PDE Sensitivity Equation Method for Optimal Aerodynamic Design

The use of gradient based optimization algorithms in inverse design is well established as a practical approach to aerodynamic design. A typical procedure uses a simulation scheme to evaluate the objective function (from the approximate states) and its gradient, then passes this information to an optimization algorithm. Once the simulation scheme (CFD flow solver) has been selected and used to provide approximate function evaluations, there are several possible approaches to the problem of computing gradients. One popular method is to differentiate the simulation scheme and compute design sensitivities that are then used to obtain gradients. Although this black-box approach has many advantages in shape optimization problems, one must compute mesh sensitivities in order to compute the design sensitivity. In this paper, we present an alternative approach using the PDE sensitivity equation to develop algorithms for computing gradients. This approach has the advantage that mesh sensitivities need not be computed. Moreover, when it is possible to use the CFD scheme for both the forward problem and the sensitivity equation, then there are computational advantages. An apparent disadvantage of this approach is that it does not always produce consistent derivatives. However, for a proper combination of discretization schemes, one can show asymptotic consistency under mesh refinement, which is often sufficient to guarantee convergence of the optimal design algorithm. In particular, we show that when asymptotically consistent schemes are combined with a trust-region optimization algorithm, the resulting optimal design method converges. We denote this approach as the sensitivity equation method. The sensitivity equation method is presented, convergence results are given and the approach is illustrated on two optimal design problems involving shocks.

Borggaard, Jeff↗
NASA NTRS2006

Comparison of a Convected Helmholtz and Euler Model for Impedance Eduction in Flow

Impedances educed from a well-tested convected Helmholtz model are compared to that of a recently developed linearized Euler model using two ceramic test liners under the assumed conditions or uniform flow and a plane wave source. The convected Helmholtz model is restricted to uniform mean flow whereas the linearized Euler model can account for the effect or the shear layer. Test data to educe the impedance is acquired from measurements obtained in the NASA Langley Research Center Grazing Incidence Tube for mean flow Mach numbers ranging from 0.0 to 0.5 and source frequencies ranging from 0.5 kHz to 3.0 kHz. The unknown impedance of the liner b educed by judiciously choo~ingth e impedance via an optimization method to match the measured acoustic pressure on the wall opposite the test liner. Results are presented on four spatial grids using three different optimization methods (contour deformation, Davidon-Fletcher Powell, and the Genetic Algorithm). All three optimization methods converge to the same impedance when used with the same model and to nearly identical impedances when used on different models. h anomaly was observed only at 0.5 kHz for high mean flow speeds. The anomaly is likely due to the use of measured data in a flow regime where shear layer effects are important but are neglected in the math models. Consistency between the impedances educed using the two models provides confidence that the linearized Euler model is ready For application to more realistic flows, such as those containing shear layers.

Watson, Willie R.↗
DOE OSTI2021

Apparatus and method for optimizing quantifiable behavior in configurable devices and systems

An apparatus and method are provided to perform constrained optimization of a constrained property of an apparatus, which is complex due to having several components, and these components are configurable in real-time. The optimization is achieved by detecting values of the constrained property and a plurality of other properties of the apparatus when the apparatus is configured in a first subset of the plurality of configurations. A model is learned using the detected values of the constrained property. The model represents the constrained property and can also represent other properties as a function of the configurations. The model can also include estimated uncertainties of the constrained property in the model. Then, using the d model and the estimated uncertainties, the optimal configuration can be selected to minimize an error value (e.g., the difference between a desired value and an observed value of the at least one constrained property).

Hoffmann, Henry↗
NASA NTRS2005

A Simple, Powerful Method for Optimal Guidance of Spacecraft Formations

One of the most interesting and challenging aspects of formation guidance law design is the coupling of the orbit design and the science return. The analyst s role is more complicated than simply to design the formation geometry and evolution. He or she is also involved in designing a significant portion of the science instrument itself. The effectiveness of the formation as a science instrument is intimately coupled with the relative geoniet,ry and evolution of the collection of spacecraft. Therefore, the science return can be maximized by optimizing the orbit design according to a performance metric relevant to the science mission goals. In this work, we present a simple method for optimal formation guidance that is applicable to missions whose performance metric, requirements, and constraints can be cast as functions that are explicitly dependent upon the orbit states and spacecraft relative positions and velocities. We present a general form for the cost and constraint functions, and derive their semi-analytic gradients with respect to the formation initial conditions. The gradients are broken down into two types. The first type are gradients of the mission specific performance metric with respect to formation geometry. The second type are derivatives of the formation geometry with respect to the orbit initial conditions. The fact that these two types of derivatives appear separately allows us to derive and implement a general framework that requires minimal modification to be applied to different missions or mission phases. To illustrate the applicability of the approach, we conclude with applications to twc missims: the Magnetospheric Mu!tiscale mission (MMS), a,nd the TJaser Interferometer Space Antenna (LISA).

Hughes, Steven P.↗
NASA NTRS2006

A Simple, Powerful Method for Optimal Guidance of Spacecraft Formations

One of the most interesting and challenging aspects of formation guidance law design is the coupling of the orbit design and the science return. The analyst's role is more complicated than simply to design the formation geometry and evolution. He or she is also involved in designing a significant portion of the science instrument itself. The effectiveness of the formation as a science instrument is intimately coupled with the relative geometry and evolution of the collection of spacecraft. Therefore, the science return can be maximized by optimizing the orbit design according to a performance metric relevant to the science mission goals. In this work, we present a simple method for optimal formation guidance that is applicable to missions whose performance metric, requirements, and constraints can be cast as functions that are explicitly dependent upon the orbit states and spacecraft relative positions and velocities. We present a general form for the cost and constraint functions, and derive their semi-analytic gradients with respect to the formation initial conditions. The gradients are broken down into two types. The first type are gradients of the mission specific performance metric with respect to formation geometry. The second type are derivatives of the formation geometry with respect to the orbit initial conditions. The fact that these two types of derivatives appear separately allows us to derive and implement a general framework that requires minimal modification to be applied to different missions or mission phases. To illustrate the applicability of the approach, we conclude with applications to two missions: the Magnetospheric Multiscale mission (MMS) , and the Laser Interferometer Space Antenna (LISA).

Hughes, Steven P.↗
NASA NTRS1975

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.↗
DOE OSTI2024

On Properties of Adjoint Systems for Evolutionary PDEs

We investigate the geometric structure of adjoint systems associated with evolutionary partial differential equations at the fully continuous, semi-discrete, and fully discrete levels and the relations between these levels. We show that the adjoint system associated with an evolutionary partial differential equation has an infinite-dimensional Hamiltonian structure, which is useful for connecting the fully continuous, semi-discrete, and fully discrete levels. We subsequently address the question of discretize-then-optimize versus optimize-then-discrete for both semi-discretization and time integration, by characterizing the commutativity of discretize-then-optimize methods versus optimize-then-discretize methods uniquely in terms of an adjoint-variational quadratic conservation law. For Galerkin semi-discretizations and one-step time integration methods in particular, we explicitly construct these commuting methods by using structure-preserving discretization techniques.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Randomized Federated Learning Methods for Nonsmooth, Nonconvex, and Hierarchical Optimization (Final Technical Report)

This final technical report summarizes the outcomes of a DOE-funded project on federated scientific machine learning (FL) under nonsmooth, nonconvex, and hierarchical optimization settings. The project develops new mathematical models, algorithms, and theoretical guarantees for decentralized stochastic, bilevel, and minimax optimization problems arising in DOE mission-relevant applications. A unified framework of randomized and zeroth-order federated optimization methods is introduced, providing provable convergence, communication efficiency, and sample-complexity guarantees. The report documents algorithmic design, theoretical analysis, and empirical validation of the proposed federated learning methods. The project also contributes to workforce development through graduate training and dissemination of results via publications and seminars.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1975

A multilevel control system for the large space telescope

A multilevel scheme was proposed for control of Large Space Telescope (LST) modeled by a three-axis-six-order nonlinear equation. Local controllers were used on the subsystem level to stabilize motions corresponding to the three axes. Global controllers were applied to reduce (and sometimes nullify) the interactions among the subsystems. A multilevel optimization method was developed whereby local quadratic optimizations were performed on the subsystem level, and global control was again used to reduce (nullify) the effect of interactions. The multilevel stabilization and optimization methods are presented as general tools for design and then used in the design of the LST Control System. The methods are entirely computerized, so that they can accommodate higher order LST models with both conceptual and numerical advantages over standard straightforward design techniques.

D D Siljak↗
DOE OSTI2024

A Novel Noise-Aware Classical Optimizer for Variational Quantum Algorithms

A key component of variational quantum algorithms (VQAs) is the choice of classical optimizer employed to update the parameterization of an ansatz. It is well recognized that quantum algorithms will, for the foreseeable future, necessarily be run on noisy devices with limited fidelities. Thus, the evaluation of an objective function (e.g., the guiding function in the quantum approximate optimization algorithm (QAOA) or the expectation of the electronic Hamiltonian in variational quantum eigensolver (VQE)) required by a classical optimizer is subject not only to stochastic error from estimating an expected value but also to error resulting from intermittent hardware noise. Model-based derivative-free optimization methods have emerged as popular choices of a classical optimizer in the noisy VQA setting, based on empirical studies. However, these optimization methods were not explicitly designed with the consideration of noise. In this work we adapt recent developments from the “noise-aware numerical optimization” literature to these commonly used derivative-free model-based methods. We introduce the key defining characteristics of these novel noise-aware derivative-free model-based methods that separate them from standard model-based methods. In conclusion, we study an implementation of such noise-aware derivative-free model-based methods and compare its performance on demonstrative VQA simulations to classical solvers packaged in scikit-quant.

classical optimizers↗
NASA NTRS1985

Factorization and reduction methods for optimal control of distributed parameter systems

A Chandrasekhar-type factorization method is applied to the linear-quadratic optimal control problem for distributed parameter systems. An aeroelastic control problem is used as a model example to demonstrate that if computationally efficient algorithms, such as those of Chandrasekhar-type, are combined with the special structure often available to a particular problem, then an abstract approximation theory developed for distributed parameter control theory becomes a viable method of solution. A numerical scheme based on averaging approximations is applied to hereditary control problems. Numerical examples are given.

Burns, J. A.↗
DOE OSTI2018

Projected nonmonotone search methods for optimization with orthogonality constraints

In this paper, we propose two feasible methods based on projections using a curvilinear search for solving optimization problems with orthogonality constraints. In one of them we apply a projected Adams–Moulton-like update scheme. All our algorithms compute the SVD decomposition in each iteration to preserve feasibility. Additionally, we present some convergence results. Finally, we perform numerical experiments with simulated problems; and analyze the performance of the proposed methods compared with state-of-the-art algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Comprehensive Comparative Study of Active Learning Schemes for Nanophotonics Design

We present a benchmarking study of active learning (AL) schemes for designing planar multilayer nanophotonic metamaterials, where the design tasks are formulated as binary optimization problems. Different surrogate models, including factorization machine (FM), Gaussian process regression (GPR), and convolutional neural network (CNN), combined with different optimization methods, including exhaustive enumeration, discrete particle swarm optimization (DPSO), quantum annealing (QA), hybrid QA, and simulated annealing are studied. The benchmark cases investigated range from small problems with short binary lengths (N = 25) to large problems with N up to 100, focusing on the design of two classes of photonic structures, including antireflective coatings for the long-wavelength infrared region and transparent radiative coolers. For small problems, CNN coupled with DPSO in AL achieves the best performance. As N increases, FM with QA outperforms GPR and CNN. For FM-based AL, hybrid QA yields the best optimization results, particularly in high-dimensional cases (N = 100). These results demonstrate that the optimization method can significantly affect in AL performance as N increases, and that QA-based optimization can provide practical routes for mitigating the optimization bottleneck in high-dimensional problems.

Jung, Serang [Kyung Hee University, Korea]↗
NASA NTRSDate not supplied

Q-Law for Rapid Assessment of Low Thrust Cislunar Trajectories Via Automatic Differentiation

Q-Law is a Lyapunov-based control law used to determine optimal controls for a low thrust trajectory. One major issue with its use is the difficult derivatives re-quired for calculating optimal controls at a given time. In this paper, an implementation of Q-Law with automatic differentiation via a Python package called JAX is applied. With automatic differentiation, the difficult derivatives for Q-Law’s optimal controls are calculated with ease, and derivatives of final states with respect to Q-Law’s weights are found enabling gradient-based optimization of Q-Law for the first time. Different search and optimization methods for finding optimal weights are then compared using the LEO to GEO problem, and it was found that gradient-free methods like design of experiments and genetic algorithm produced the best results, but they took the longest time to get a solution, while the gradient-based method found a locally optimal result in a much faster time. Overall, the run time for a single propagation is manageable and well-suited for a mission designer to use as an initial guess generator for trajectory optimization, or for simple orbit transfer analysis.

Nathan Steffen↗
DOE OSTI2015

SU-E-T-780: Use Robustness Optimization (RO) Method to Improve the Planning Efficiency for Pencil Beam Scanning Cranial Spinal Irradiation

Purpose: We evaluate the feasibility of using robustness optimization (RO) function to improve the planning efficiency of pencil beam scanning (PBS) craniospinal irradiation (CSI) with gradient matching technique. Methods: A CSI patient was planned with 2 lateral brain fields and 4 posterior fields to cover the entire spine to maximal field of 24 cm × 20 cm on a compact PBS gantry, ProteusONE. CSI plans were generated using traditional volumetric gradient dose optimization (VGDO) and robustness optimization (RO) method respectively. In traditional VGDO, besides the sectioned spine target volumes, gradient volume (GV) were generated as 4 equally spaced structures e.g. 80%, 60%, 40%, and 20% of prescription dose. In RO method, only sectioned spine target volumes with an overlap of 4cm were created. In the robustness optimization settings, 5mm uncertainty in superior and inferior direction was defined for auto gradient optimization. Dosimetric metrics of conformity number (CN), homogeneity index (HI), and maximal cord doses were compared in Raystation version 4.6.100.6. Results: In VGDO method, total 16 GV structures and five 100% dose level target structures were contoured compared to total 5 target structures in RO method which saves 30 min in contour. With the same PTV coverage (95% volume receive 30.6Gy prescription dose), maximum cord dose is 32.64Gy in VGDO and 31.94Gy in RO. HI is 1.03 and 1.04 for VGDO and RO respectively. CN is 0.93 and 0.94 for VGDO and RO respectively. Conclusions: The dosimetric comparison demonstrated both methods are equivalent in terms of plan quality. With robust optimization for CSI gradient matching, it efficiently reduces the amount of planning target contour structure by factor of 4 and thus improves the planning efficiency especially for 4 or more gradient junction area.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2018

HyperSpace: Distributed Bayesian Hyperparameter Optimization

As machine learning models continue to increase in complexity, so does the potential number of free model parameters commonly known as hyperparameters. While there has been considerable progress toward finding optimal configurations of these hyperparameters, many optimization procedures are treated as black boxes. We believe optimization methods should not only return a set of optimized hyperparameters, but also give insight into the effects of model hyperparameter settings. To this end, we present HyperSpace, a parallel implementation of Bayesian sequential model-based optimization. HyperSpace leverages high performance computing (HPC) resources to better understand unknown, potentially non-convex hyperparameter search spaces. We show that it is possible to learn the dependencies between model hyperparameters through the optimization process. By partitioning large search spaces and running many optimization procedures in parallel, we also show that it is possible to discover families of good hyperparameter settings over a variety of models including unsupervised clustering, regression, and classification tasks.

Computer Science↗
NASA NTRS1992

New optimality criteria methods - Forcing uniqueness of the adjoint strains by corner-rounding at constraint intersections

In new, iterative continuum-based optimality criteria (COC) methods, the strain in the adjoint structure becomes non-unique if the number of active local constraints is greater than the number of design variables for an element. This brief note discusses the use of smooth envelope functions (SEFs) in overcoming economically computational problems caused by the above non-uniqueness.

Rozvany, G. I. N.↗