Search NASA⌕ Search

SEARCH · Search NASA

Results for “Newton optimization”

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

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

At least 271 records · Page 15

An improved computational approach for multilevel optimum design

A penalty-function algorithm employing Newton's method with approximate second derivatives (Haftka and Starnes, 1980) is developed for two-level hierarchical design optimization problems. The difficulties posed by discontinuous behavior in typical multilevel problems are explained and illustrated for the case of a three-bar truss; the algorithm is formulated; and its advantages are demonstrated in the problem of a portal framework having three beams (described by six cross-section parameters), subjected to two loading conditions, and to be constructed in six different materials for comparison. The final design parameters are listed in a table.

Haftka, R. T.↗

A scalable multidimensional fully implicit solver for Hall magnetohydrodynamics

We propose an optimally performant fully implicit algorithm for the Hall magnetohydrodynamics (HMHD) equations based on multigrid-preconditioned Jacobian-free Newton-Krylov methods. HMHD is a challenging system to solve numerically because it supports stiff fast dispersive waves. The preconditioner is formulated using an operator-split approximate block factorization (Schur complement), informed by physics insight. We use a vector-potential formulation (instead of a magnetic field one) to allow a clean segregation of the problematic $\nabla$ x $\nabla$ x operator in the electron Ohm's law subsystem. This segregation allows the formulation of an effective damped block-Jacobi smoother for multigrid. We demonstrate by analysis that our proposed block-Jacobi iteration is convergent and has the smoothing property. The resulting HMHD solver is verified linearly with wave propagation examples, and nonlinearly with the GEM challenge reconnection problem by comparison against another HMHD code. We demonstrate the excellent algorithmic and parallel performance of the algorithm up to 16384 MPI tasks in two dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ESTIMATING THE DEEP SOLAR MERIDIONAL CIRCULATION USING MAGNETIC OBSERVATIONS AND A DYNAMO MODEL: A VARIATIONAL APPROACH

We show how magnetic observations of the Sun can be used in conjunction with an axisymmetric flux-transport solar dynamo model in order to estimate the large-scale meridional circulation throughout the convection zone. Our innovative approach rests on variational data assimilation, whereby the distance between predictions and observations (measured by an objective function) is iteratively minimized by means of an optimization algorithm seeking the meridional flow that best accounts for the data. The minimization is performed using a quasi-Newton technique, which requires knowledge of the sensitivity of the objective function to the meridional flow. That sensitivity is efficiently computed via the integration of the adjoint flux-transport dynamo model. Closed-loop (also known as twin) experiments using synthetic data demonstrate the validity and accuracy of this technique for a variety of meridional flow configurations, ranging from unicellular and equatorially symmetric to multicellular and equatorially asymmetric. In this well-controlled synthetic context, we perform a systematic study of the behavior of our variational approach under different observational configurations by varying their spatial density, temporal density, and noise level, as well as the width of the assimilation window. We find that the method is remarkably robust, leading in most cases to a recovery of the true meridional flow to within better than 1%. These encouraging results are a first step toward using this technique to (i) better constrain the physical processes occurring inside the Sun and (ii) better predict solar activity on decadal timescales.

79 ASTRONOMY AND ASTROPHYSICS↗

Optimization of multiple flyby trajectories

A procedure has been developed which minimizes total delta-V (instantaneous velocity change) for a multiple flyby trajectory with constraints on flyby altitude and orientation. The solution is found by varying the locations of maneuver points between each flyby to minimize the delta-Vs at the maneuver points. Each trajectory segment connecting consecutive maneuver points is found by solving an N-body analog to Lambert's problem. Multiconic techniques are used for trajectory propagation and for computation of the state transition matrix. The constrained parameter optimization problem is converted to an unconstrained problem by means of penalty functions and then solved with a quasi-Newton algorithm utilizing analytic first derivatives. This procedure has been successfully applied to Galileo satellite tour trajectories.

Damario, L. A.↗

Design of a Variational Multiscale Method for Turbulent Compressible Flows

A spectral-element framework is presented for the simulation of subsonic compressible high-Reynolds-number flows. The focus of the work is maximizing the efficiency of the computational schemes to enable unsteady simulations with a large number of spatial and temporal degrees of freedom. A collocation scheme is combined with optimized computational kernels to provide a residual evaluation with computational cost independent of order of accuracy up to 16th order. The optimized residual routines are used to develop a low-memory implicit scheme based on a matrix-free Newton-Krylov method. A preconditioner based on the finite-difference diagonalized ADI scheme is developed which maintains the low memory of the matrix-free implicit solver, while providing improved convergence properties. Emphasis on low memory usage throughout the solver development is leveraged to implement a coupled space-time DG solver which may offer further efficiency gains through adaptivity in both space and time.

Design↗

A Comparison of Trajectory Optimization Methods for the Impulsive Minimum Fuel Rendezvous Problem

In this paper we present a comparison of optimization approaches to the minimum fuel rendezvous problem. Both indirect and direct methods are compared for a variety of test cases. The indirect approach is based on primer vector theory. The direct approaches are implemented numerically and include Sequential Quadratic Programming (SQP), Quasi-Newton, Simplex, Genetic Algorithms, and Simulated Annealing. Each method is applied to a variety of test cases including, circular to circular coplanar orbits, LEO to GEO, and orbit phasing in highly elliptic orbits. We also compare different constrained optimization routines on complex orbit rendezvous problems with complicated, highly nonlinear constraints.

Hughes, Steven P.↗

Train Like a (Var)Pro: Efficient Training of Neural Networks with Variable Projection

Deep neural networks (DNNs) have achieved state-of-the-art performance across a variety of traditional machine learning tasks, e.g., speech recognition, image classification, and segmentation. The ability of DNNs to efficiently approximate high-dimensional functions has also motivated their use in scientific applications, e.g., to solve partial differential equations and to generate surrogate models. In this paper, we consider the supervised training of DNNs, which arises in many of the above applications. We focus on the central problem of optimizing the weights of the given DNN such that it accurately approximates the relation between observed input and target data. Devising effective solvers for this optimization problem is notoriously challenging due to the large number of weights, nonconvexity, data sparsity, and nontrivial choice of hyperparameters. To solve the optimization problem more efficiently, we propose the use of variable projection (VarPro), a method originally designed for separable nonlinear least-squares problems. Our main contribution is the Gauss--Newton VarPro method (GNvpro) that extends the reach of the VarPro idea to nonquadratic objective functions, most notably cross-entropy loss functions arising in classification. These extensions make GNvpro applicable to all training problems that involve a DNN whose last layer is an affine mapping, which is common in many state-of-the-art architectures. In our four numerical experiments from surrogate modeling, segmentation, and classification, GNvpro solves the optimization problem more efficiently than commonly used stochastic gradient descent (SGD) schemes. Finally, GNvpro finds solutions that generalize well, and in all but one example better than well-tuned SGD methods, to unseen data points.

97 MATHEMATICS AND COMPUTING↗

An analysis and comparison of several trajectory optimization methods

The sensitivities of the convergence characteristics of the methods to initially assumed parameters and trial solution, convergence times, computer logic, and storage requirements are discussed. Numerical comparison of the convergence characteristics is made by considering a minimum time, low thrust, Earth-Mars transfer trajectory. A modified quasi-linearization method reduces convergence time by approximately 70% when compared with the generalized Newton-Raphson method and allows the terminal boundary to be specified by a general function of the problem variables. A uniquely specified and easily determined, time dependent weighting matrix for the gradient techniques accelerates the shaping of the optimal control program and improves the convergence characteristics during the terminal iterations. Convergence envelopes, indicating how sensitive the convergence characteristics are to initially assumed parameters, are plotted for the perturbation and quasi-linearization methods. Several iteration schemes are proposed which increase the size of the convergence envelopes and decrease the sensitivity of the method to initially assumed parameters.

Lewallen, J. M.↗

Extended Newton-type method for nonlinear functions with values in a cone

In this paper, we consider the problem of finding solutions of nonlinear inclusion problems in Banach space. Using convex optimization techniques introduced by Robinson (Numer Math 19:341–347, 1972), a convergence theorem for Kantorovich-like methods is given, which improves the results of Yamamoto (Jpn J Appl Math 3(2):295–313, 1986; Numer Math 51(5):545–557, 1987) and Robinson (Numer Math 19:341–347, 1972). The result is compared with previously known results. Numerical examples further justify the theoretical results.

97 MATHEMATICS AND COMPUTING↗

A finite element code for electric motor design

FEMOT is a finite element program for solving the nonlinear magnetostatic problem. This version uses nonlinear, Newton first order elements. The code can be used for electric motor design and analysis. FEMOT can be embedded within an optimization code that will vary nodal coordinates to optimize the motor design. The output from FEMOT can be used to determine motor back EMF, torque, cogging, and magnet saturation. It will run on a PC and will be available to anyone who wants to use it.

Campbell, C. Warren↗

A Nonlinear Schur Complement Solver for CFD-Based Multidisciplinary Models

CFD-based multidisciplinary models are the fundamental building blocks of multidis- ciplinary design optimization frameworks. Linear and nonlinear solutions of these coupled models are difficult, especially when the Jacobian matrices represent a saddle point problem, where a block-diagonal corresponding to a discipline is non-invertible. These scenarios necessitate the use of a coupled solver algorithm such as the Newton’s method instead of the popular block Gauss– Seidel-based methods because of this non-invertible block. To address this challenge, we introduce a nonlinear Schur complement solver suitable for CFD-based multidisciplinary models. The solver leverages the specialized linear and nonlinear solvers of the CFD code, and therefore, does not require the solution of a large coupled linear system as the coupled Newton’s method. Further- more, because the solver primarily uses the specialized linear and nonlinear solvers of the CFD code, it does not suffer from the same robustness limitations as the coupled Newton’s method. In this work, we will implement this solver in NASA’s OpenMDAO framework and demonstrate its effectiveness using a CFD-based aeropropulsive model. The solver will contribute to the develop- ment of aeropropulsive design optimization and CFD-based design optimization methods with the ultimate goal of accelerating the design and integration of advanced propulsion systems.

Nonlinear Solvers↗

Improving the efficiency of aerodynamic shape optimization

The computational efficiency of an aerodynamic shape optimization procedure that is based on discrete sensitivity analysis is increased through the implementation of two improvements. The first improvement involves replacing a grid-point-based approach for surface representation with a Bezier-Bernstein polynomial parameterization of the surface. Explicit analytical expressions for the grid sensitivity terms are developed for both approaches. The second improvement proposes the use of Newton's method in lieu of an alternating direction implicit methodology to calculate the highly converged flow solutions that are required to compute the sensitivity coefficients. The modified design procedure is demonstrated by optimizing the shape of an internal-external nozzle configuration. Practically identical optimization results are obtained that are independent of the method used to represent the surface. A substantial factor of 8 decrease in computational time for the optimization process is achieved by implementing both of the design procedure improvements.

Burgreen, Greg W.↗

Improving the efficiency of aerodynamic shape optimization procedures

The computational efficiency of an aerodynamic shape optimization procedure which is based on discrete sensitivity analysis is increased through the implementation of two improvements. The first improvement involves replacing a grid point-based approach for surface representation with a Bezier-Bernstein polynomial parameterization of the surface. Explicit analytical expressions for the grid sensitivity terms are developed for both approaches. The second improvement proposes the use of Newton's method in lieu of an alternating direction implicit (ADI) methodology to calculate the highly converged flow solutions which are required to compute the sensitivity coefficients. The modified design procedure is demonstrated by optimizing the shape of an internal-external nozzle configuration. A substantial factor of 8 decrease in computational time for the optimization process was achieved by implementing both of the design improvements.

Burgreen, Greg W.↗

Algebraic methods for the solution of some linear matrix equations

The characterization of polynomials whose zeros lie in certain algebraic domains (and the unification of the ideas of Hermite and Lyapunov) is the basis for developing finite algorithms for the solution of linear matrix equations. Particular attention is given to equations PA + A'P = Q (the Lyapunov equation) and P - A'PA = Q the (discrete Lyapunov equation). The Lyapunov equation appears in several areas of control theory such as stability theory, optimal control (evaluation of quadratic integrals), stochastic control (evaluation of covariance matrices) and in the solution of the algebraic Riccati equation using Newton's method.

Djaferis, T. E.↗

MOOSE Framework Speed and Memory Optimizations

The Multiphysics Object Oriented Simulation Environment (MOOSE) framework has been developed to solve a variety of complex simulations ranging from groundwater flows to full reactor simulations. MOOSE excels at solving fully-implicit, fully-coupled, highly nonlinear models using the Jacobian Free Newton-Krylov (JFNK) method relying on years of expertise in several dependent packages including PETSc, libMesh, Hypre and many others. The modular design of MOOSE enables the rapid development of new physics models that can be coupled with relative ease within the framework for building up simulations of different levels of complexity. With the ongoing adoption of MOOSE to new application areas along with streamlining of existing simulations, the priorities must be adjusted to include code optimizations. This includes both execution speed and the memory footprint of MOOSE-based simulations. These two categories can be further broken down into ''micro-optimizations'' or source code optimizations and algorithmic optimizations where source code is restructured to accomplish the same tasks through a more efficient means. However, before any code optimizations can occur, one must have robust way of measuring these critical simulation properties to identify the best candidates for optimizations along with having a way to identify the effectiveness of proposed optimizations to the framework. This report discusses the preliminary work towards the implementation of a robust execution baseline of the framework and derivative applications under a variety of different simulations. In addition, several potential optimization target areas in both the MOOSE framework and dependent libraries have been identified. An implementation strategy and potential benefits are discussed.

97 MATHEMATICS AND COMPUTING↗

Quantum Interior Point Methods for Semidefinite Optimization

We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact search direction and is not guaranteed to explore only feasible points; the second scheme uses a nullspace representation of the Newton linear system to ensure feasibility even with inexact search directions. The second is a novel scheme that might seem impractical in the classical world, but it is well-suited for a hybrid quantum-classical setting. We show that both schemes converge to an optimal solution of the semidefinite optimization problem under standard assumptions. By comparing the theoretical performance of classical and quantum interior point methods with respect to various input parameters, we show that our second scheme obtains a speedup over classical algorithms in terms of the dimension of the problem n , but has worse dependence on other numerical parameters.

Augustino, Brandon↗

Mitigating Voltage Instability in the Saudi Grid for a Decarbonized, Fully Solar Power System

Lately, solar photovoltaic (PV) has received significant interest due to its economic and environmental benefits. As the integration of renewable energy sources (RES) increases into existing power grids, challenges such as the decrease in short circuit ratio (SCR) are introduced. Here, this paper investigates a case study of the Saudi power grid, examining the voltage stability as the grid transitions from traditional power generation to 100% penetration of solar PV gradually. Moreover, the paper explores the relationship between the increase in solar penetration and the potential effects on the short circuit MVA (SCMVA), which could significantly impact the overall SCR of the system. To meet the North American Electric Reliability Corporation (NERC) recommendation of maintaining SCR at a particular level, synchronous condensers (SC)s were integrated into the grid. The effectiveness of utilizing SCs to maintain the system voltage at optimal levels in a fully solar grid is also considered. In addition, this paper covers the weak grid analysis via utilizing the Newton-Raphson load flow method, along with PV and QV curve analyses. The purpose behind that is to determine weak bus locations in need of voltage improvements, and to meet the amount of reactive power to be injected. Finally, the amount of power being delivered by SCs will be added progressively in three scenarios to show the enhancements on SCR more precisely.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Adaptive, Distributed Control of Constrained Multi-Agent Systems

Product Distribution (PO) theory was recently developed as a broad framework for analyzing and optimizing distributed systems. Here we demonstrate its use for adaptive distributed control of Multi-Agent Systems (MASS), i.e., for distributed stochastic optimization using MAS s. First we review one motivation of PD theory, as the information-theoretic extension of conventional full-rationality game theory to the case of bounded rational agents. In this extension the equilibrium of the game is the optimizer of a Lagrangian of the (Probability dist&&on on the joint state of the agents. When the game in question is a team game with constraints, that equilibrium optimizes the expected value of the team game utility, subject to those constraints. One common way to find that equilibrium is to have each agent run a Reinforcement Learning (E) algorithm. PD theory reveals this to be a particular type of search algorithm for minimizing the Lagrangian. Typically that algorithm i s quite inefficient. A more principled alternative is to use a variant of Newton's method to minimize the Lagrangian. Here we compare this alternative to RL-based search in three sets of computer experiments. These are the N Queen s problem and bin-packing problem from the optimization literature, and the Bar problem from the distributed RL literature. Our results confirm that the PD-theory-based approach outperforms the RL-based scheme in all three domains.

Bieniawski, Stefan↗